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 401–500 of 1,001
What is Information? A multidimensional concern
Nafría, J. M. D. (2010) · tripleC Communication Capitalism & Critique Open Access Journal for a Global Sustainable Information Society · doi:10.31269/triplec.v8i1.76 · Cited by 34
Machine learning for information extraction
Neri, F., & Saitta, L. (1997) · Lecture notes in computer science · doi:10.1007/3-540-63438-x_9 · Cited by 34
Deterministic Complexity and Entropy
Titchener, M. R., Nicolescu, R., Ludwig Staiger, B., Gulliver, A., & Speidel, U. (2004) · ResearchSpace (University of Auckland) · doi:10.5555/1227085.1227122 · Cited by 34
Self-Modification and Mortality in Artificial Agents
Orseau, L., & Ring, M. B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22887-2_1 · Cited by 33
Zipf’s Law, unbounded complexity and open-ended evolution
Corominas‐Murtra, B., Seoane, L. F., & Solé, R. V. (2018) · Journal of The Royal Society Interface · doi:10.1098/rsif.2018.0395 · Cited by 33
Lombardi, O., Holik, F., & Vanni, L. (2016) · Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics · doi:10.1016/j.shpsb.2016.10.001 · Cited by 33
On the Computability of Conditional Probability
Ackerman, N., Freer, C. E., & Roy, D. M. (2019) · Journal of the ACM · doi:10.1145/3321699 · Cited by 33
Quantifying loss of information in network-based dimensionality reduction techniques
Zenil, H., Kiani, N. A., & Tegner, J. N. (2015) · Journal of Complex Networks · doi:10.1093/comnet/cnv025 · Cited by 33
Algorithmic Probability: Theory and Applications
Solomonoff, R. J. (2008) · Information Theory and Statistical Learning · doi:10.1007/978-0-387-84816-7_1 · Cited by 33
Self-citationHow Incomputable Is Kolmogorov Complexity?
Vitanyi, P. M. B. (2020) · Entropy · doi:10.3390/e22040408 · Cited by 33
Kolmogorov Complexity, Data Compression, and Inference
Cover, T. M. (1985) · Springer eBooks · doi:10.1007/978-94-009-5113-6_2 · Cited by 33
Model discrimination using an algorithmic information criterion
Maciejowski, J. M. (1979) · Automatica · doi:10.1016/0005-1098(79)90006-2 · Cited by 33
Minimum message length encoding and the comparison of macromolecules
Allison, L., & Yee, C. N. (1990) · Bulletin of Mathematical Biology · doi:10.1007/bf02458580 · Cited by 33
Complexity and viability in service ecosystems
Gummesson, E., Mele, C., & Polese, F. (2018) · Marketing Theory · doi:10.1177/1470593118774201 · Cited by 33
Algorithmic Pseudorandomness in Quantum Setups
Bendersky, A., de la Torre, G., Senno, G., Figueira, S. D., & Acín, A. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.230402 · Cited by 32
The Kernel Adaptive Autoregressive-Moving-Average Algorithm
Li, K., & Príncipe, J. C. (2015) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2015.2418323 · Cited by 32
Replacing Causal Faithfulness with Algorithmic Independence of Conditionals
Lemeire, J., & Janzing, D. (2012) · Minds and Machines · doi:10.1007/s11023-012-9283-1 · Cited by 32
Using general-purpose compression algorithms for music analysis
Louboutin, C., & Meredith, D. (2016) · Journal of New Music Research · doi:10.1080/09298215.2015.1133656 · Cited by 32
Pietsch, W. (2021) · Cambridge University Press eBooks · doi:10.1017/9781108588676 · Cited by 35
Some theorems on the algorithmic approach to probability theory and information theory
Levin, L. A. (2010) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2010.09.007 · Cited by 32
An almost machine-independent theory of program-length complexity, sophistication, and induction
Koppel, M., & Atlan, H. (1991) · Information Sciences · doi:10.1016/0020-0255(91)90021-l · Cited by 32
Kiani, N. A., Zenil, H., Olczak, J., & Tegner, J. N. (2016) · Seminars in Cell and Developmental Biology · doi:10.1016/j.semcdb.2016.01.012 · Cited by 32
Compression, The Fermi Paradox and Artificial Super-Intelligence
Bennett, M. T. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-93758-4_5 · Cited by 31
“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.”
BackgroundUniversal MAP estimation in compressed sensing
Baron, D., & Duarte, M. F. (2011) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2011.6120245 · Cited by 31
Modularity, reuse, and hierarchy: Measuring complexity by measuring structure and organization
Hornby, G. S. (2007) · Complexity · doi:10.1002/cplx.20202 · Cited by 31
On the Complexity of Learning Minimum Time-Bounded Turing Machines
Ko, K. (1991) · SIAM Journal on Computing · doi:10.1137/0220059 · Cited by 31
Diffusion Variational Autoencoders
Rey, L. A. P., Menkovski, V., & Portegies, J. (2020) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2020/375 · Cited by 31
Studying software evolution using artefacts’ shared information content
Arbuckle, T. (2010) · Science of Computer Programming · doi:10.1016/j.scico.2010.11.005 · Cited by 31
The SP Theory of Intelligence: Benefits and Applications
Wolff, J. (2013) · Information · doi:10.3390/info5010001 · Cited by 31
Self-replication and Evolution of DNA Crystals
Schulman, R., & Winfree, E. (2005) · Lecture notes in computer science · doi:10.1007/11553090_74 · Cited by 31
New Error Bounds for Solomonoff Prediction
Hütter, M. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1743 · Cited by 31
Point estimation using the Kullback-Leibler loss function and MML
Dowe, D. L., Baxter, R. A., Oliver, J., & Wallace, C. S. (1998) · Lecture notes in computer science · doi:10.1007/3-540-64383-4_8 · Cited by 31
Monotonic and dual monotonic language learning
Lange, S., Zeugmann, T., & Kapur, S. (1996) · Theoretical Computer Science · doi:10.1016/0304-3975(95)00284-7 · Cited by 31
ON KOLMOGOROV MACHINES AND RELATED ISSUES
Gurevich, Y. G. (1993) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812794499_0017 · Cited by 31
No Free Lunch versus Occam’s Razor in Supervised Learning
Lattimore, T., & Hütter, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-44958-1_17 · Cited by 30
Natural scene statistics mediate the perception of image complexity
Gauvrit, N., Toscano, F. S., & Zenil, H. (2014) · Visual Cognition · doi:10.1080/13506285.2014.950365 · Cited by 30
A Primer on Pseudorandom Generators
Goldreich, O. (2010) · University lecture series · doi:10.1090/ulect/055 · Cited by 30
Entropy and compression: two measures of complexity
Henriques, T. S., Gonçalves, H. M. D. S. L. M., Antunes, L. F., Matias, M., Bernardes, J., & Santos, C. (2013) · Journal of Evaluation in Clinical Practice · doi:10.1111/jep.12068 · Cited by 30
The New AI: General & Sound & Relevant for Physics
Schmidhuber, J. (2007) · Cognitive technologies · doi:10.1007/978-3-540-68677-4_6 · Cited by 30
Quantum Algorithmic Complexities and Entropy
Benatti, F. (2009) · Open Systems & Information Dynamics · doi:10.1142/s1230161209000025 · Cited by 30
Complexity and its measures in cognitive and other complex systems
Kinsner, W. (2008) · IEEE International Conference on Cognitive Informatics · doi:10.1109/coginf.2008.4639147 · Cited by 30
Entropy and complexity of finite sequences as fluctuating quantities
Jiménez-Montaño, M. A., Ebeling, W., Pohl, T., & Rapp, P. E. (2002) · Biosystems · doi:10.1016/s0303-2647(01)00171-x · Cited by 30
The Limits of Inference with Theory: A Review of Wolpin (2013)
Rust, J. P. (2014) · Journal of Economic Literature · doi:10.1257/jel.52.3.820 · Cited by 30
Baez, J. C., & Stay, M. (2012) · Mathematical Structures in Computer Science · doi:10.1017/s0960129511000521 · Cited by 30
Lathrop, J. I., & Lutz, J. H. (1999) · Information and Computation · doi:10.1006/inco.1999.2794 · Cited by 30
Psychological complexity and the cost of information processing
Aksentijevic, A., & Gibson, K. (2012) · Theory & Psychology · doi:10.1177/0959354311423435 · Cited by 29
Bayesian Models of Perceptual Organization
Feldman, J. (2014) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780199686858.013.007 · Cited by 29
The Problem with Evolutionary Art Is ...
Galanter, P. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-12242-2_33 · Cited by 29
Algorithm selection for sorting and probabilistic inference: a machine learning-based approach
Guo, H., & Hsu, W. H. (2003) · Cited by 29
New Millennium AI and the Convergence of History
Schmidhuber, J. (2007) · Studies in computational intelligence · doi:10.1007/978-3-540-71984-7_2 · Cited by 33
Guidelines for Artificial Intelligence Containment
Babcock, J. F., Kramár, J., & Yampolskiy, R. V. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108616188.008 · Cited by 31
Learning Graph Models of Shape
Segen, J. (1988) · Elsevier eBooks · doi:10.1016/b978-0-934613-64-4.50008-6 · Cited by 29
Model learning and recognition of nonrigid objects
Segen, J. (2003) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr.1989.37907 · Cited by 29
Basic Elements and Problems of Probability TheoryPreprint
Primas, H. (1999) · PhilSci-Archive (University of Pittsburgh) · Cited by 29
Smart Paradigms and the Predictability and Complexity of Inflectional Morphology
Détrez, G., & Ranta, A. (2012) · Cited by 28
‘The concept of information in physics’: an interdisciplinary topical lecture
Dittrich, T. (2014) · European Journal of Physics · doi:10.1088/0143-0807/36/1/015010 · Cited by 29
Evolutionary induction of stochastic context free grammars
Keller, B., & Lutz, R. (2005) · Pattern Recognition · doi:10.1016/j.patcog.2004.03.022 · Cited by 28
Data compression to define information content of hydrological time series
Weijs, S. V., van de Giesen, N., & Parlange, M. B. (2013) · Hydrology and earth system sciences · doi:10.5194/hess-17-3171-2013 · Cited by 28
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
Kieffer, J. C., & Yang, E. (1996) · IEEE Transactions on Information Theory · doi:10.1109/18.481775 · Cited by 28
Xu, L. (2011) · Frontiers of Electrical and Electronic Engineering in China · doi:10.1007/s11460-011-0135-1 · Cited by 28
Asymptotics of Discrete MDL for Online Prediction
Poland, J., & Hütter, M. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.856956 · Cited by 28
Information Measure for Modularity in Engineering Design
Wang, B., & Antonsson, E. K. (2004) · ASME International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (IDETC/CIE) · doi:10.1115/detc2004-57515 · Cited by 28
Extrapolation when very little is known about the source
Fine, T. L. (1970) · Information and Control · doi:10.1016/s0019-9958(70)90177-4 · Cited by 28
Simplicity in Perceptual Organization
van der Helm, P. A. (2014) · Oxford University Press eBooks · doi:10.1093/oxfordhb/9780199686858.013.052 · Cited by 27
East-West paths to unconventional computing
Adamatzky, A., Akl, S. G., Burgin, M., Calude, C. S., Costa, J. F., Dehshibi, M. M., Gunji, Y., Konkoli, Z., MacLennan, B. J., Marchal, B., et al. (2017) · Progress in Biophysics and Molecular Biology · doi:10.1016/j.pbiomolbio.2017.08.004 · Cited by 27
Evaluating a Reinforcement Learning Algorithm with a General Intelligence Test
Insa-Cabrera, J., Dowe, D. L., & Hernández‐Orallo, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25274-7_1 · Cited by 27
On More Realistic Environment Distributions for Defining, Evaluating and Developing Intelligence
Hernández‐Orallo, J., Dowe, D. L., España, S., Hernández‐Lloreda, M. V., & Insa-Cabrera, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22887-2_9 · Cited by 27
Entropy, Information and Complexity or Which Aims the Arrow of Time?
Mikhailovsky, G. E., & Левич, А. П. (2015) · Entropy · doi:10.3390/e17074863 · Cited by 28
Justifying Additive Noise Model-Based Causal Discovery via Algorithmic Information Theory
Janzing, D., & Steudel, B. (2010) · Open Systems & Information Dynamics · doi:10.1142/s1230161210000126 · Cited by 27
Algorithmic Simplicity and Relevance
Dessalles, J.-L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-44958-1_9 · Cited by 27
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. M. (2019) · ACM eBooks · doi:10.1145/3335741.3335752 · Cited by 27
Unsupervised Learning of Correlated Multivariate Gaussian Mixture Models Using MML
Agusta, Y., & Dowe, D. L. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-24581-0_40 · Cited by 27
Weissman, T., Merhav, N., & Somekh-Baruch, A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.930923 · Cited by 27
What are the gains of the theory of algorithms
Uspensky, V., & Semenov, A. L. (1981) · Lecture notes in computer science · doi:10.1007/3-540-11157-3_27 · Cited by 27
Grammar enumeration and inference
Wharton, R. M. (1977) · Information and Control · doi:10.1016/s0019-9958(77)80005-3 · Cited by 27
Schurz, G., & Thorn, P. D. (2015) · Minds and Machines · doi:10.1007/s11023-015-9369-7 · Cited by 26
Computational Complexity, Random Sequences, and Probability
Fine, T. L. (1973) · Elsevier eBooks · doi:10.1016/b978-0-12-256450-5.50008-x · Cited by 26
Aksentijevic, A., & Gibson, K. (2011) · Cognitive Systems Research · doi:10.1016/j.cogsys.2011.01.002 · Cited by 26
Bayesian confusions surrounding simplicity and likelihood in perceptual organization
van der Helm, P. A. (2011) · Acta Psychologica · doi:10.1016/j.actpsy.2011.09.007 · Cited by 26
On Macrostates in Complex Multi-Scale Systems
Harald Atmanspacher, A. (2016) · Entropy · doi:10.3390/e18120426 · Cited by 26
Introduction: Machine Learning as Philosophy of Science
Korb, K. B. (2004) · Minds and Machines · doi:10.1023/b:mind.0000045986.90956.7f · Cited by 26
Planning multi-paths using speciation in genetic algorithms
Hocaoglu, C., & Sanderson, A. C. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1996.542393 · Cited by 26
Two Kinds of Probabilistic Induction
Solomonoff, R. J. (1999) · The Computer Journal · doi:10.1093/comjnl/42.4.256 · Cited by 26
Self-citationComplexity of algorithms and computations
Marchenkov, S. S., & Матросов, В. Л. (1981) · Journal of Mathematical Sciences · doi:10.1007/bf01084283 · Cited by 26
Knowing one's limits: logical analysis of inductive inference
Gierasimczuk, N. (2010) · UvA-DARE (University of Amsterdam) · Cited by 26
Quantum Algorithmic Information TheoryPreprint
Svozil, K. (1995) · arXiv (Cornell University) · doi:10.3217/jucs-002-05-0311 · Cited by 26
Veisi, H. (2023) · Industrial and applied mathematics · doi:10.1007/978-981-19-6553-1_1 · Cited by 26
Generalized multiscale Lempel–Ziv complexity of cyclic alternating pattern during sleep
Yeh, C.-H., & Shi, W. (2018) · Nonlinear Dynamics · doi:10.1007/s11071-018-4296-9 · Cited by 25
The Optimal Choice of Hypothesis Is the Weakest, Not the Shortest
Bennett, M. T. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-33469-6_5 · Cited by 26
AN ALGORITHMIC INFORMATION THEORETIC APPROACH TO THE BEHAVIOUR OF FINANCIAL MARKETS
Zenil, H., & Delahaye, J.-P. (2011) · Journal of Economic Surveys · doi:10.1111/j.1467-6419.2010.00666.x · Cited by 25
Algorithmic complexity of recursive and inductive algorithms
Burgin, M. (2004) · Theoretical Computer Science · doi:10.1016/j.tcs.2003.12.003 · Cited by 25
Iantovics, L. B., Rotar, C., & Niazi, M. A. (2017) · International Journal of Intelligent Systems · doi:10.1002/int.21903 · Cited by 25
Analogical proportions: From equality to inequality
Prade, H. M., & Richard, G. (2018) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2018.07.005 · Cited by 25
Some recent work in artificial intelligence
Solomonoff, R. J. (1966) · Proceedings of the IEEE · doi:10.1109/proc.1966.5250 · Cited by 25
Self-citationGraph Clustering and Model Learning by Data Compression
Segen, J. (1990) · Elsevier eBooks · doi:10.1016/b978-1-55860-141-3.50015-8 · Cited by 25
Information, Knowledge and Control
MacFarlane, A. G. J. (1993) · Birkhäuser Boston eBooks · doi:10.1007/978-1-4612-0313-1_1 · Cited by 25
Quantum computation by local measurementPreprint
Raussendorf, R., & Wei, T.-C. (2014) · Cited by 25
Schmidhuber, J. (2003) · arXiv · doi:10.48550/arxiv.cs/0309048 · Cited by 24
Complexism and the Role of Evolutionary Art
Galanter, P. (2007) · Natural computing series · doi:10.1007/978-3-540-72877-1_15 · Cited by 24
Image similarity using the normalized compression distance based on finite context models
Pinho, A. J., & Ferreira, P. J. S. G. (2011) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2011.6115866 · Cited by 24
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
