The discovery of algorithmic probability

DOI10.1006/jcss.1997.1500zbMath1004.68525OpenAlexW2057728133MaRDI QIDQ1370859

Ray J. Solomonoff

Publication date: 28 October 1997

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

Full work available at URL: https://doi.org/10.1006/jcss.1997.1500

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Obituary: Ray Solomonoff, founding father of algorithmic information theory, A generalized characterization of algorithmic probability, New error bounds for Solomonoff prediction, Mathematics as information compression via the matching and unification of patterns, Between order and chaos: The quest for meaningful information, Stationary algorithmic probability

Cites Work

• A Mathematical Theory of Communication
• Modeling by shortest data description
• Autonomous theory building systems
• Process complexity and effective random tests
• A Theory of Program Size Formally Identical to Information Theory
• Complexity-based induction systems: Comparisons and convergence theorems
• A Method for the Construction of Minimum-Redundancy Codes
• Fuzzy sets
• Three models for the description of language
• On the Length of Programs for Computing Finite Binary Sequences
• An Information Measure for Classification
• Logical basis for information theory and probability theory
• On the Length of Programs for Computing Finite Binary Sequences
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• Computational Complexity and Probability Constructions
• The definition of random sequences
• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item