Universal Convergence of Semimeasures on Individual Random Sequences
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior μ, if the latter is computable. Hence, M is eligible as a universal sequence pr
|Collections||ANU Research Publications|
|Source:||Algorithmic Learning Theory: 15th International Conference, ALT 2004, Pedova, Italy, October 2004, Proceedings|
|01_Hutter_Universal_Convergence_of_2004.pdf||256.4 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.