A formal theory of inductive inference. Part I

1964/03/01 by R.J. Solomonoff, Ray J. Solomonoff · 14 citations
Computer Science · #Algorithms and Data Compression #Computability, Logic, AI Algorithms #semigroups and automata theory

paper · doi:10.1016/s0019-9958(64)90223-2

crossref issued 1964/03/01 · crossref published 1964/03/01 · crossref published-print 1964/03/01 · openalex publication_date 1964/03/01 · crossref created 2004/12/15 · crossref deposited 2019/01/31 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29 · crossref indexed 2026/08/01

Citations

• On Computable Numbers, with an Application to the Entscheidungsproblem

Cited by

• Logical basis for information theory and probability theory
• The definition of random sequences
• Is “the Theory of Everything” Merely the Ultimate Ensemble Theory?
• Universal Algorithmic Intelligence: A Mathematical Top→Down Approach
• A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
• Poverty of the Stimulus Revisited
• Communication Capacity of Quantum Computation
• Universality probability of a prefix-free machine
• Recursively enumerable reals and chaitin Ω numbers
• The SP Theory of Intelligence: An Overview
• Algorithmic information theory [wikipedia]
• Concept learning [wikipedia]
• Kolmogorov complexity [wikipedia]
• Occam's razor [wikipedia]