On generalized computable universal priors and their convergence
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Theoretical Computer Science|
|Hutter On generalized computable universal 2006.pdf||272.01 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.