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

DOI10.1016/J.IPL.2007.11.018zbMATH Open1186.68227OpenAlexW2051517377MaRDI QIDQ963375FDOQ963375

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)