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

DOI10.1016/J.IPL.2007.11.018MaRDI QIDQ963375zbMATH OpenOpenAlexFDO

Authors 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

analysis of algorithmsalgorithmic probabilitytheory of computationKolmogorov complexitynormalizationTuring machinehalting problemuniversal Turing machineincomputableuniversal probability distribution

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1304330
• Universal probability-free prediction
• Universality probability of a prefix-free machine
• The probability of a computable output from a random oracle
• The miraculous universal distribution

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• Complexity-based induction systems: Comparisons and convergence theorems
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.

Cited in

(1)

• Obituary: Ray Solomonoff, founding father of algorithmic information theory

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963375)