Kolmogorov complexity: Difference between revisions

Revision as of 10:28, 23 December 2003

Revision as of 10:38, 23 December 2003

Line 40:

* [http://www.idsia.ch/~juergen/kolmogorov.html Schmidhuber's generalizations of algorithmic information]

* [http://homepages.cwi.nl/~paulv/kolmogorov.html Li & Vitanyi's textbook]

* [http://www3.oup.co.uk/computer_journal/hdb/Volume_42/Issue_04/pdf/420270.pdf Minimum Message Length and Kolmogorov Complexity] (by [http://www.csse.monash.edu.au/cgi-bin/pub_search?publication_type=0&year=&authors=wallace&title= ChrisC.S. Wallace's] publicationsand [http://www.csse.monash.edu.au/~dld D.L. Dowe], Computer Journal, Vol. 42, No. 4, 1999).

* [http://www.csse.monash.edu.au/~dld/MML David Dowe]'s [http://www.csse.monash.edu.au/~dld/MML.html Minimum Message Length (MML)] and [http://www.csse.monash.edu.au/~dld/Occam.html Occam's razor] pages.