On Martin-Löf Convergence of Solomonoff’s Mixture
From MaRDI portal
Publication:4922128
DOI10.1007/978-3-642-38236-9_20zbMath1382.68129OpenAlexW1900289622WikidataQ58012253 ScholiaQ58012253MaRDI QIDQ4922128
Publication date: 28 May 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1885/14720
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A philosophical treatise of universal induction
- On semimeasures predicting Martin-Löf random sequences
- On universal prediction and Bayesian confirmation
- Complexity-based induction systems: Comparisons and convergence theorems
- The context-tree weighting method: basic properties
- Algorithmic Learning Theory
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The definition of random sequences
- A formal theory of inductive inference. Part I
- An introduction to Kolmogorov complexity and its applications