A generalized characterization of algorithmic probability

DOI10.1007/s00224-017-9774-9zbMath1420.03101arXiv1508.05733OpenAlexW2964287127WikidataQ59482348 ScholiaQ59482348MaRDI QIDQ1694008

Tom F. Sterkenburg

Publication date: 1 February 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.05733

zbMATH Keywords

algorithmic probabilityOccam's razorprinciple of indifferencea priori semimeasuremonotone Turing machinessemicomputable semimeasures

Mathematics Subject Classification ID

Other connections with logic and set theory (28E15) Algorithmic randomness and dimension (03D32)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A philosophical treatise of universal induction
• The discovery of algorithmic probability
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• Process complexity and effective random tests
• On the computational power of random strings
• On universal prediction and Bayesian confirmation
• (Non-)Equivalence of Universal Priors
• Increasing the gap between descriptional complexity and algorithmic probability
• Algorithmic Randomness and Complexity
• Gödel numberings of partial recursive functions
• A Theory of Program Size Formally Identical to Information Theory
• Philosophical issues in Kolmogorov complexity
• Elements of Information Theory
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• A formal theory of inductive inference. Part II
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: A generalized characterization of algorithmic probability