A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
On generalized computable universal priors and their convergence
2006
Theoretical 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 the 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 . The first part of the paper investigates the existence and
doi:10.1016/j.tcs.2006.07.039
fatcat:zidqw3nhhrhujpscobtrwd6wiu