Kolmogorov complexity: Difference between revisions

Revision as of 09:54, 25 March 2004

Revision as of 18:25, 6 April 2004

Line 42:

* [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= C.S. Wallace] and [http://www.csse.monash.edu.au/~dld D.L. Dowe], Computer Journal, Vol. 42, No. 4, 1999).

* [http://www.csse.monash.edu.au/~dld 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.

* [http://nms.lcs.mit.edu/~gch/kolmogorov.html Kolmogorov Complexity] provides a simple explanation of Kolmogorov Complexity.