A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the posterior of his universal semimeasure M converges rapidly to the true sequence generating posterior µ, if the latter is computable. Hence, M is eligible as a universal predictor in case of unknown µ. We investigate the existence and convergence of computabledoi:10.1007/978-3-540-39624-6_24 fatcat:3dle7qlw6jayvairul3ry36pty