The probability of ``undefined (non-converging) output in generating the universal probability distribution

DOI10.1016/j.ipl.2007.11.018zbMath1186.68227OpenAlexW2051517377MaRDI QIDQ963375

Ray J. Solomonoff

Publication date: 19 April 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.11.018

zbMATH Keywords

Kolmogorov complexityanalysis of algorithmsnormalizationalgorithmic probabilityTuring machinetheory of computationhalting problemuniversal Turing machineincomputableuniversal probability distribution

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Obituary: Ray Solomonoff, founding father of algorithmic information theory

Cites Work

• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• Complexity-based induction systems: Comparisons and convergence theorems
• Unnamed Item
• Unnamed Item

This page was built for publication: The probability of ``undefined (non-converging) output in generating the universal probability distribution