Stationary algorithmic probability
From MaRDI portal
Publication:1041228
DOI10.1016/j.tcs.2009.09.017zbMath1189.68067OpenAlexW1678579760MaRDI QIDQ1041228
Publication date: 1 December 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.017
Related Items
Revisiting Chaitin's incompleteness theorem ⋮ Universality, Invariance, and the Foundations of Computational Complexity in the Light of the Quantum Computer
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithmic information and simplicity in statistical physics
- The discovery of algorithmic probability
- Universal artificial intelligence. Sequential decisions based on algorithmic probability.
- A Theory of Program Size Formally Identical to Information Theory
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS