On semimeasures predicting Martin-Löf random sequences
Solomonoff’s central result on induction is that the prediction of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating predictor µ, if the latter is computable. Hence, M is eligible as a universal sequence predictor in the case of unknown µ. Despite some nearby results and proofs in the literature, the stronger result of convergence for all (Martin-Lof) random sequences remained open. Such a convergence result would be particularly interesting...[Show more]
|Collections||ANU Research Publications|
|Source:||Theoretical Computer Science|
|Hutter and Muchnik On Semimeasures Predicting 2007.pdf||275.51 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.