Interesting Esoterica

The Fastest and Shortest Algorithm for All Well-Defined Problems

Article by Hutter, Marcus
  • Published in 2002
  • Added on

Links

Other information

journal
International Journal of Foundations of Computer Science
keywords
Kolmogorov complexity,acceleration,algorithmic information theory,blum's speed-up theorem,computational complexity,levin search
number
3
pages
431--443
volume
13

BibTeX entry

@article{Hutter2002,
	title = {The Fastest and Shortest Algorithm for All Well-Defined Problems},
	author = {Hutter, Marcus},
	url = {http://www.hutter1.net/ai/pfastprg.htm http://arxiv.org/abs/cs.CC/0206022},
	urldate = {2012-08-14},
	abstract = {},
	comment = {},
	journal = {International Journal of Foundations of Computer Science},
	keywords = {Kolmogorov complexity,acceleration,algorithmic information theory,blum's speed-up theorem,computational complexity,levin search},
	number = 3,
	pages = {431--443},
	volume = 13,
	year = 2002,
	collections = {Attention-grabbing titles,Basically computer science}
}