Before revision: In his general theory of inductive inference, Solomonoff uses the method together with Bayes' rule to obtain probabilities of prediction for an algorithm's future outputs.Li, M. and Vitanyi, P., An Introduction to Kolmogorov Complexity and Its Applications, 3rd Edition, Springer Science and Business Media, N.Y., 2008 In the mathematical formalism used, the observations have the form of finite binary strings , and the universal prior is a probability distribution over the set of finite binary strings .
After revision: viewed as outputs of Turing machinescalculated from a probability distribution over programs (that is, inputs to a universal Turing machine)In his general theory of inductive inference, Solomonoff uses the method together with Bayes' rule to obtain probabilities of prediction for an algorithm's future outputs.Li, M. and Vitanyi, P., An Introduction to Kolmogorov Complexity and Its Applications, 3rd Edition, Springer Science and Business Media, N.Y., 2008 In the mathematical formalism used, the observations have the form of finite binary strings , and the universal prior is a probability distribution over the set of finite binary strings .