Algorithmic probability

Marcus Hütter, Shane Legg, Paul M. B. Vitanyi · Scholarpedia · 2007

Algorithmic "Solomonoff" Probability (AP) assigns to objects an a priori probability that is in some sense universal. This prior distribution has theoretical applications in a number of areas, including inductive inference theory and the time complexity analysis of algorithms. Its main drawback is that it is not computable and thus can only be approximated in practice.

Read the paper · More papers on PaperTik