The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
A formal theory of inductive inference. Part II
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“The ability to generalise is closely related to compression [14,15], with more compressed representations yielding better accuracy [13] for the same reason that there is only one straight line interpolating any two points, but infinitely many polynomials of higher degree.”
From Compression, The Fermi Paradox and Artificial Super-Intelligence (2022) · cites this paper as [15]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Banks, D. L., Ríos, J., & Insua, D. R. (2015) · Chapman & Hall/CRC eBooks · doi:10.1201/b18653-3 · Cited by 3,649
Three models for the description of language
Chomsky, N. (1956) · IEEE Transactions on Information Theory · doi:10.1109/tit.1956.1056813 · Cited by 2,984
Keynes, J. M. (1973) · Palgrave Macmillan UK eBooks · doi:10.1007/978-1-349-00843-8 · Cited by 2,576
Logical Foundations of Probability
Savage, L. J., & Carnap, R. (1952) · Econometrica · doi:10.2307/1907654 · Cited by 2,042
Computer Languages for Symbol Manipulation
Green, B. F. (1961) · IRE Transactions on Electronic Computers · doi:10.1109/tec.1961.5219281 · Cited by 11
Cited by
Sorted by citations
Items 501–600 of 1,001
Characterizing Pure High-Order Entanglements in Lexical Semantic Spaces via Information Geometry
Hou, Y., & Song, D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00834-4_20 · Cited by 24
A Complete Theory of Everything (Will Be Subjective)
Hütter, M. (2010) · Algorithms · doi:10.3390/a3040329 · Cited by 24
Subjectivity in Inductive Inference
Gilboa, I., & Samuelson, L. (2009) · Theoretical Economics · doi:10.3982/te845 · Cited by 24
López, C. (2018) · Advanced Optical Materials · doi:10.1002/adom.201800439 · Cited by 25
Computational enactivism under the free energy principle
Korbak, T. (2019) · Synthese · doi:10.1007/s11229-019-02243-4 · Cited by 34
Communication Defined as Complementary Informative Processes
Losee, R. M. (1999) · Cited by 24
Open Problems in Universal Induction & Intelligence
Hütter, M. (2009) · Algorithms · doi:10.3390/a2030879 · Cited by 24
Autonomous Agents and the Concept of Concepts
Davidsson, P. (1996) · Lund University Publications (Lund University) · Cited by 24
Seginer, Y. (2007) · UvA-DARE (University of Amsterdam) · Cited by 24
Solving a Problem With or Without a Program
Wang, P. (2013) · Journal of Artificial General Intelligence · doi:10.2478/v10229-011-0021-5 · Cited by 23
THE NO FREE LUNCH THEOREM: BAD NEWS FOR (WHITE'S ACCOUNT OF) THE PROBLEM OF INDUCTION
Schurz, G. (2019) · Episteme · doi:10.1017/epi.2018.54 · Cited by 23
Learning to Learn Programs from Examples: Going Beyond Program Structure
Ellis, K., & Gulwani, S. (2017) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2017/227 · Cited by 23
Why God is probably good: a response to the evil-god challenge
Miller, C. (2019) · Religious Studies · doi:10.1017/s0034412519000465 · Cited by 23
On the computational measurement of intelligence factors
Hernández‐Orallo, J., & Informàtics, D. D. S. (2000) · Cited by 23
Partitional vs Hierarchical Clustering Using a Minimum Grammar Complexity Approach
Fred, A. L. N., & Leitão, J. M. N. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44522-6_20 · Cited by 23
On universal transfer learning
Mahmud, M. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.013 · Cited by 23
Subjective randomness as statistical inference
Griffiths, T. L., Daniels, D., Austerweil, J. L., & Tenenbaum, J. B. (2018) · Cognitive Psychology · doi:10.1016/j.cogpsych.2018.02.003 · Cited by 23
Does Algorithmic Probability Solve the Problem of Induction
Solomonoff, R. J. (2006) · Cited by 23
Self-citationModel Selection and the Multiplicity of Patterns in Empirical Data
McAllister, J. W. (2007) · Philosophy of Science · doi:10.1086/525630 · Cited by 23
Mapping efficiency and information content
Tomislav Hengl, A., Nikolić, M., & MacMillan, R. A. (2012) · International Journal of Applied Earth Observation and Geoinformation · doi:10.1016/j.jag.2012.02.005 · Cited by 23
On the Approximation of the Kolmogorov Complexity for DNA Sequences
Pratas, D., & Pinho, A. J. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58838-4_29 · Cited by 23
Theory of chaos and its application to the crisis of debts and the origin of inflation
Маслов, В. П. (2009) · Russian Journal of Mathematical Physics · doi:10.1134/s1061920809010087 · Cited by 23
Rationality in discovery: a study of logic, cognition, computation and neuropharmacology
van den Bosch, A. P. M. (2001) · Cited by 23
Unifying Computing and Cognition: The SP Theory and its ApplicationsPreprint
Wolff, J. G. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0401009 · Cited by 24
The complexity landscape of viral genomes
Silva, J. M., Pratas, D., Caetano, T., & Matos, S. (2022) · GigaScience · doi:10.1093/gigascience/giac079 · Cited by 22
Symmetry of information and one-way functions
Longpré, L., & Mocas, S. (1993) · Information Processing Letters · doi:10.1016/0020-0190(93)90204-m · Cited by 22
The process complexity and effective random tests.
Schnorr, C. P. (1972) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800152.804910 · Cited by 22
From Algorithmic to Subjective Randomness
Griffiths, T. L., & Tenenbaum, J. B. (2003) · Cited by 22
Enumerations of the Kolmogorov function
Beigel, R., Buhrman, H., Fejer, P. A., Fortnow, L., Grabowski, P., Longpré, L., Muchnik, A., Stephan, F., & Torenvliet, L. (2006) · Journal of Symbolic Logic · doi:10.2178/jsl/1146620156 · Cited by 22
Non-linear Methods Predominant in Fetal Heart Rate Analysis: A Systematic Review
Ribeiro, M., Monteiro-Santos, J., Castro, L., Antunes, L. F., Santos, C., Teixeira, A., & Henriques, T. S. (2021) · Frontiers in Medicine · doi:10.3389/fmed.2021.661226 · Cited by 24
Why Frequentists and Bayesians Need Each Other
Williamson, J. (2011) · Erkenntnis · doi:10.1007/s10670-011-9317-8 · Cited by 22
Cosmological zoo—accelerating models with dark energy
Szydłowski, M. (2007) · Journal of Cosmology and Astroparticle Physics · doi:10.1088/1475-7516/2007/09/007 · Cited by 22
Kolmogorov's Contributions to the Foundations of Probability
Vovk, V., & Shafer, G. R. (2003) · Problems of Information Transmission · doi:10.1023/a:1023674330295 · Cited by 22
Wesolowski, C. A., Yahil, A., Puetter, R. C., Babyn, P., Gilday, D. L., & Khan, M. (2005) · Computerized Medical Imaging and Graphics · doi:10.1016/j.compmedimag.2004.08.003 · Cited by 22
Algorithmic Statistics: Forty Years Later
Vereshchagin, N., & Shen', A. K. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-50062-1_41 · Cited by 22
Quantifying self-organization in cyclic cellular automata
Shalizi, C. R., & Shalizi, K. L. (2003) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.485805 · Cited by 22
Reconstructing Language Hierarchies
Crutchfield, J. P. (1991) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4899-2305-9_4 · Cited by 22
Links Between Artificial Neural Networks (ANN) and Statistical Pattern Recognition
Werbos, P. J. (1991) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-88740-5.50007-4 · Cited by 22
PAC learning of concept classes through the boundaries of their items
Apolloni, B., & Chiaravalli, S. (1997) · Theoretical Computer Science · doi:10.1016/s0304-3975(95)00240-5 · Cited by 22
Discovery by Minimal Length Encoding: A Case Study in Molecular Evolution
Milosavljević, A., & Jurka, J. (1993) · Machine Learning · doi:10.1007/bf00993061 · Cited by 22
Algorithmic complexity of a protein
Dewey, T. G. (1996) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.54.r39 · Cited by 22
Circuit size relative to pseudorandom oracles
Lutz, J. H., & Schmidt, W. J. (1993) · Theoretical Computer Science · doi:10.1016/0304-3975(93)90256-s · Cited by 22
Structured audio, Kolmogorov complexity, and generalized audio coding
Scheirer, E. D. (2001) · IEEE Transactions on Speech and Audio Processing · doi:10.1109/89.966095 · Cited by 22
Evolution of complexity in real-world domains
Pollack, J. B., & Funes, P. (2001) · Cited by 22
Infinitely productive language can arise from chance under communicative pressure
Piantadosi, S. T., & Fedorenko, E. G. (2017) · Journal of Language Evolution · doi:10.1093/jole/lzw013 · Cited by 22
HydroZIP: How Hydrological Knowledge can Be Used to Improve Compression of Hydrological Data
Weijs, S. V., van de Giesen, N., & Parlange, M. B. (2013) · Entropy · doi:10.3390/e15041289 · Cited by 21
Optimality Issues of Universal Greedy Agents with Static Priors
Orseau, L. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16108-7_28 · Cited by 21
Searching for image information content, its discovery, extraction, and representation
Diamant, E. (2005) · Journal of Electronic Imaging · doi:10.1117/1.1867476 · Cited by 21
Universal Compressed Sensing for Almost Lossless Recovery
Jalali, S., & Poor, H. V. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2672754 · Cited by 21
Gini, G. C. (2018) · Methods in molecular biology · doi:10.1007/978-1-4939-7899-1_3 · Cited by 23
Causal Direction of Data Collection Matters: Implications of Causal and Anticausal Learning for NLP
Jin, Z., von Kügelgen, J., Ni, J., Vaidhya, T., Kaushal, A., Sachan, M., & Schölkopf, B. (2021) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2021.emnlp-main.748 · Cited by 21
The Kolmogorov complexity of random reals
Yu, L., Ding, D., & Downey, R. G. (2004) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2004.01.006 · Cited by 21
Iterated Limiting Recursion and the Program Minimization Problem
Schubert, L. K. (1974) · Journal of the ACM · doi:10.1145/321832.321841 · Cited by 21
Circular clustering of protein dihedral angles by Minimum Message Length.
Dowe, D. L., Allison, L., Ti, D., Hunter, L., Cs, W., & Edgoose, T. C. (1996) · PubMed · Cited by 21
Salamon, P., Wootton, J. C., Konopka, A. K., & Hansen, L. K. (1993) · Computers & Chemistry · doi:10.1016/0097-8485(93)85005-w · Cited by 21
Inference for transition network grammars
Chou, S.-C., & Fu, K. S. (1979) · Computer Languages · doi:10.1016/0096-0551(79)90002-x · Cited by 21
Nonparametric Problem-Space Clustering: Learning Efficient Codes for Cognitive Control Tasks
Maisto, D., Donnarumma, F., & Pezzulo, G. (2016) · Entropy · doi:10.3390/e18020061 · Cited by 20
Algorithmic Probability-Guided Machine Learning on Non-Differentiable Spaces
Hernández-Orozco, S., Zenil, H., Riedel, J., Uccello, A., Kiani, N. A., & Tegner, J. N. (2021) · Frontiers in Artificial Intelligence · doi:10.3389/frai.2020.567356 · Cited by 26
Minimum Description Length Model Selection - Problems and Extensions
Vitanyi, P. M. B., Grünwald, P., & de Rooij, S. (2001) · Cited by 20
Jalali, S., & Maleki, A. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120382 · Cited by 20
Pandey, H. M., Chaudhary, A., Mehrotra, D., & Kendall, G. (2016) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2016.05.002 · Cited by 20
Algorithmic Information Dynamics
Zenil, H., Kiani, N. A., Abrahão, F. S., & Tegner, J. N. (2020) · Scholarpedia · doi:10.4249/scholarpedia.53143 · Cited by 20
Evaluation of analogical proportions through Kolmogorov complexity
Bayoudh, M., Prade, H. M., & Richard, G. (2011) · Knowledge-Based Systems · doi:10.1016/j.knosys.2011.06.022 · Cited by 20
Algorithmic Relative Complexity
Cerra, D., & Datcu, M. P. (2011) · Entropy · doi:10.3390/e13040902 · Cited by 20
Unsupervised learning of Gamma mixture models using Minimum Message Length
Agusta, Y., & Dowe, D. L. (2003) · Cited by 20
Convergence and Error Bounds for Universal Prediction of Nonbinary Sequences
Hütter, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44795-4_21 · Cited by 20
Model Selection for Two View Geometry:A Review
Torr, P. H. S. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46805-6_17 · Cited by 20
Artificial sequences and complexity measures
Baronchelli, A., Caglioti, E., & Loreto, V. (2005) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2005/04/p04002 · Cited by 20
Franks, B. (1995) · The British Journal for the Philosophy of Science · doi:10.1093/bjps/46.4.475 · Cited by 20
Self-Motivated Development Through Rewards for Predictor Errors / Improvements
Schmidhuber, J. (2005) · mediaTUM – the media and publications repository of the Technical University Munich (Technical University Munich) · Cited by 20
Russell, S., & Grosof, B. N. (1990) · Kluwer international series in engineering and computer science · doi:10.1007/978-1-4613-1523-0_16 · Cited by 20
Inductive reasoning and Kolmogorov complexity
Li, M., & Vitanyi, P. M. B. (2003) · Structure in Complexity Theory Annual Conference · doi:10.1109/sct.1989.41823 · Cited by 20
Sequence Prediction Based on Monotone Complexity
Hütter, M. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-45167-9_37 · Cited by 20
Complexity Measures for System Architecture Models
Kinnunen, M. (2006) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 20
Schmidhuber, J. (2003) · arXiv (Cornell University) · Cited by 20
Logical InductionPreprint
Garrabrant, S., Benson-Tilsen, T., Critch, A., Soares, N., & Taylor, J. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1609.03543 · Cited by 20
The SP Theory of Intelligence: An Overview
Wolff, J. G. (2013) · Information · doi:10.3390/info4030283 · Cited by 19
Constructive reinforcement learning
Hernández‐Orallo, J. (2000) · International Journal of Intelligent Systems · doi:10.1002/(sici)1098-111x(200003)15:3 · Cited by 19
Pavlović, D. (2011) · New Security Paradigms Workshop · doi:10.1145/2073276.2073289 · Cited by 19
Algorithmic Data Analytics, Small Data Matters and Correlation versus Causation
Zenil, H. (2017) · Springer eBooks · doi:10.1007/978-3-658-12153-2_22 · Cited by 19
Zenil, H., & Mináry, P. (2019) · Nucleic Acids Research · doi:10.1093/nar/gkz750 · Cited by 19
Kolmogorov’s Legacy about Entropy, Chaos, and Complexity
Falcioni, M., Loreto, V., & Vulpiani, A. (2003) · Lecture notes in physics · doi:10.1007/978-3-540-39668-0_4 · Cited by 19
Conclusions, Future Directions and Outlook
Wiering, M., & van Otterlo, M. (2012) · Adaptation, learning, and optimization · doi:10.1007/978-3-642-27645-3_19 · Cited by 19
Cross-domain knowledge transfer using structured representations
Swarup, S., & Ray, S. R. (2006) · Cited by 19
Understanding Consciousness as Data Compression
Maguire, P., Maguire, R., & Moser, P. (2016) · Journal of Cognitive Science · doi:10.17791/jcs.2016.17.1.63 · Cited by 19
ORNSTEIN, L. (1965) · PubMed · Cited by 19
Applications of Kolmogorov Complexity in the Theory of Computation
Li, M., & Vitanyi, P. M. B. (1990) · Springer eBooks · doi:10.1007/978-1-4612-4478-3_8 · Cited by 19
Wolff, J. G. (2003) · arXiv (Cornell University) · doi:10.3217/jucs-005-07-0418 · Cited by 19
An Approximation of the Universal Intelligence MeasurePreprint
Legg, S., & Veness, J. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.5951 · Cited by 19
Natural Induction: Spontaneous Adaptive Organisation without Natural Selection
Buckley, C. L., Lewens, T., Levin, M. G., Millidge, B., Tschantz, A., & Watson, R. A. R. (2024) · Entropy · doi:10.3390/e26090765 · Cited by 22
Cognitive synergy: A universal principle for feasible general intelligence
Goertzel, B. (2009) · IEEE International Conference on Cognitive Informatics · doi:10.1109/coginf.2009.5250694 · Cited by 18
How well do practical information measures estimate the Shannon entropy
Speidel, U., Titchener, M. R., & Jia, Y. (2006) · Cited by 18
The structure of epistemic probabilities
Climenhaga, N. (2019) · Philosophical Studies · doi:10.1007/s11098-019-01367-0 · Cited by 18
Pitch Sequence Complexity and Long-Term Pitcher Performance
Bock, J. (2015) · Sports · doi:10.3390/sports3010040 · Cited by 20
Pinho, A. J., Garcia, S. P., Pratas, D., & Ferreira, P. J. S. G. (2013) · PLoS ONE · doi:10.1371/journal.pone.0079922 · Cited by 18
Efficient computing budget allocation for finding simplest good designs
Jia, Q., Zhou, E., & Chen, C. (2013) · IIE Transactions · doi:10.1080/0740817x.2012.705454 · Cited by 18
Solomonoff, R. J. (1975) · Cited by 18
Self-citationLi, M., Longpré, L., & Vitanyi, P. M. B. (1992) · SIAM Journal on Computing · doi:10.1137/0221042 · Cited by 18
A Computable Economist’s Perspective on Computational Complexity
Velupillai, K. V. (2009) · Edward Elgar Publishing eBooks · doi:10.4337/9781781952665.00009 · Cited by 18
Complexity and Entropy: An Introduction to the Theory of Kolmogorov Complexity
Uspensky, V. (1992) · Springer eBooks · doi:10.1007/978-3-642-77735-6_6 · Cited by 18
Metadata
- Authors
- Solomonoff, R. J.
- Corresponding author
- Solomonoff, R.J.
- Venue
- Information and Control
- Publisher
- Elsevier BV
- Published
- 1964-06
- Volume
- 7
- Issue
- 2
- Pages
- 224-254
- ISSN
- 0019-9958 (ISSN-L)
- OpenAlex
- W2135625884
- Cited by
- 1,758
- References
- 6
- Citations by year
- 2026: 43 · 2025: 16 · 2024: 18 · 2023: 22 · 2022: 35 · 2021: 52 · 2020: 60 · 2019: 40 · 2018: 60 · 2017: 67 · 2016: 64 · 2015: 75 · 2014: 59 · 2013: 94 · 2012: 88
- FWCI
- 1.52
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Information and Control (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Algorithms
- Keywords
- inductive reasoning, universal Turing machine, phrase structure grammar, prediction accuracy
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review