Kolmogorov complexity: Difference between revisions

Content deleted Content added
m Link to "Bayesian probability"
No edit summary
Line 33:
polar co-ordinates to Cartesian co-ordinates), statistical consistency (even
for very hard problems, MML will converge to any underlying model) and efficiency (the MML model will converge to any true underlying model about as quickly as is possible). C.S. Wallace and D.L. Dowe showed a formal connection between MML and algorithmic information theory (or Kolmogorov complexity) in 1999.
 
==See also==
[[List of important publications in computer science#algorithmic information theory| Important publications in algorithmic information theory]]
 
==External links==