On Martin-Löf (non-)convergence of Solomonoff's universal mixture

DOI10.1016/j.tcs.2014.12.004zbMath1329.68151OpenAlexW2042260931WikidataQ58012191 ScholiaQ58012191MaRDI QIDQ2348255

Tor Lattimore, Marcus Hutter

Publication date: 11 June 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.004

zbMATH Keywords

Kolmogorov complexitytheory of computationSolomonoff inductionsemi-computable semi-measures

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items

A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE

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

This page was built for publication: On Martin-Löf (non-)convergence of Solomonoff's universal mixture