The miraculous universal distribution

DOI10.1007/BF03024407zbMath0934.01007OpenAlexW1992958898MaRDI QIDQ1272403

Ming Li, Walter W. Kirchherr, Paul M. B. Vitányi

Publication date: 2 April 2000

Published in: The Mathematical Intelligencer (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03024407

zbMATH Keywords

BayesKolmogorov complexityOckham's razoruniversal distribution

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of probability theory (60-03)

Related Items (6)

A computable measure of algorithmic probability by finite approximations with an application to integer sequences ⋮ An algorithmic look at financial volatility ⋮ Impugning randomness, convincingly ⋮ Numerical evaluation of algorithmic complexity for short strings: a glance into the innermost structure of randomness ⋮ Applying MDL to learn best model granularity ⋮ Turing patterns with Turing machines: emergence and low-level structure formation

Cites Work

• Average case complexity under the universal distribution equals worst- case complexity
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Unnamed Item
• Unnamed Item

This page was built for publication: The miraculous universal distribution