Sequential predictions based on algorithmic complexity

DOI10.1016/j.jcss.2005.07.001zbMath1101.68616arXivcs/0508043OpenAlexW2058908939WikidataQ58012439 ScholiaQ58012439MaRDI QIDQ2581758

Marcus Hutter

Publication date: 10 January 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

ConvergenceSelf-optimizationSolomonoff's priorSequence predictionAlgorithmic information theoryMinimal description lengthMonotone Kolmogorov complexity

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (4)

Algorithmic complexity bounds on future prediction errors ⋮ Open problems in universal induction \& intelligence ⋮ A complete theory of everything (will be subjective) ⋮ Predictions and algorithmic statistics for infinite sequences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the relation between descriptional complexity and algorithmic probability
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• Process complexity and effective random tests
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• Convergence and loss bounds for bayesian sequence prediction
• Randomness conservation inequalities; information and independence in mathematical theories
• Minimum complexity density estimation
• A Theory of Program Size Formally Identical to Information Theory
• Complexity-based induction systems: Comparisons and convergence theorems
• Minimum description length induction, Bayesianism, and Kolmogorov complexity
• Learning Theory
• Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
• Learning Theory and Kernel Machines
• On minimal-program complexity measures
• Algorithmic Learning Theory
• A variant of the Kolmogorov concept of complexity
• 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 I
• New error bounds for Solomonoff prediction

This page was built for publication: Sequential predictions based on algorithmic complexity