The discovery of algorithmic probability

DOI10.1006/JCSS.1997.1500MaRDI QIDQ1370859zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A formal theory of inductive inference. Part I
• A formal theory of inductive inference. Part II
• A Mathematical Theory of Communication
• A Method for the Construction of Minimum-Redundancy Codes
• A Theory of Program Size Formally Identical to Information Theory
• An Information Measure for Classification
• Autonomous theory building systems
• Complexity-based induction systems: Comparisons and convergence theorems
• Computational Complexity and Probability Constructions
• Fuzzy sets
• scientific article; zbMATH DE number 4174360 (Why is no real title available?)
• scientific article; zbMATH DE number 3427210 (Why is no real title available?)
• scientific article; zbMATH DE number 3169455 (Why is no real title available?)
• scientific article; zbMATH DE number 45100 (Why is no real title available?)
• scientific article; zbMATH DE number 107774 (Why is no real title available?)
• scientific article; zbMATH DE number 3489016 (Why is no real title available?)
• scientific article; zbMATH DE number 3489106 (Why is no real title available?)
• scientific article; zbMATH DE number 3492569 (Why is no real title available?)
• scientific article; zbMATH DE number 3219315 (Why is no real title available?)
• scientific article; zbMATH DE number 3402108 (Why is no real title available?)
• scientific article; zbMATH DE number 3419039 (Why is no real title available?)
• scientific article; zbMATH DE number 3188896 (Why is no real title available?)
• Logical basis for information theory and probability theory
• Modeling by shortest data description
• On the Length of Programs for Computing Finite Binary Sequences
• On the Length of Programs for Computing Finite Binary Sequences
• Process complexity and effective random tests
• 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
• Three models for the description of language

Cited in

(8)

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

This page was built for publication: The discovery of algorithmic probability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370859)