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 801–900 of 1,001
Almost everywhere high nonuniform complexity
Lutz, J. H. (2003) · Structure in Complexity Theory Annual Conference · doi:10.1109/sct.1989.41813 · Cited by 10
Stochastic Complexity and Statistical Inference
Rissanen, J. (1986) · Lecture notes in control and information sciences · doi:10.1007/bfb0007575 · Cited by 10
The architecture of complexity: A new blueprint
Turney, P. D. (1989) · Synthese · doi:10.1007/bf00869285 · Cited by 10
Multisensor fusion and model selection using a minimal representation size framework
Joshi, R., & Sanderson, A. C. (2002) · IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI) · doi:10.1109/mfi.1996.568495 · Cited by 10
Wolff, J. G. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0311045 · Cited by 10
Florêncio, C. C. (2003) · Utrecht University Repository (Utrecht University) · Cited by 10
The complexity and distribution of computationally useful problems
Juedes, D. W. (1994) · doi:10.31274/rtd-180813-11836 · Cited by 10
The Optimal Choice of Hypothesis Is the Weakest, Not the ShortestPreprint
Bennett, M. T. (2023) · doi:10.36227/techrxiv.21965675 · Cited by 10
Machine Learning | Past and Future
Solomonofi, R. J. (2009) · Cited by 9
Fiorini, R. A. (2017) · Advances in knowledge acquisition, transfer, and management book series/Advances in knowledge acquisition, transfer and management book series · doi:10.4018/978-1-5225-2443-4.ch011 · Cited by 9
Quantum collapse and the second law of thermodynamics
Hormoz, S. (2013) · Physical Review E · doi:10.1103/physreve.87.022129 · Cited by 9
Explanatory and Creative Alternatives to the MDL priciple
Hernández‐Orallo, J., & García-Varea, I. (2000) · Foundations of Science · doi:10.1023/a:1011350914776 · Cited by 9
Universality probability of a prefix-free machine
Barmpalias, G., & Dowe, D. L. (2012) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2011.0319 · Cited by 9
Algorithmic No-Cloning Theorem
Epstein, S. (2019) · IEEE Transactions on Information Theory · doi:10.1109/tit.2019.2910562 · Cited by 9
Turing machines and recursive Turing Tests
Hernández‐Orallo, J., Insa-Cabrera, J., Dowe, D. L., & Hibbard, B. (2012) · Cited by 9
Approaching explanatory adequacy in phonology using Minimum Description Length
Rasin, E., Berger, I., Lan, N., Shefi, I., & Katzir, R. (2021) · Journal of Language Modelling · doi:10.15398/jlm.v9i1.266 · Cited by 9
Information: Concept Clarification and Theoretical Representation
Burgin, M. (2011) · tripleC Communication Capitalism & Critique Open Access Journal for a Global Sustainable Information Society · doi:10.31269/triplec.v9i2.284 · Cited by 9
Brighton, H., & Todd, P. M. (2001) · Cambridge University Press eBooks · doi:10.1017/cbo9780511816826.017 · Cited by 9
Reflective Oracles: A Foundation for Game Theory in Artificial Intelligence
Fallenstein, B., Taylor, J., & Christiano, P. F. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-48561-3_34 · Cited by 9
Devine, S. D. (2015) · Biosystems · doi:10.1016/j.biosystems.2015.11.008 · Cited by 9
Similarity, kernels, and the fundamental constraints on cognition
Shahbazi, R., Raizada, R. D. S., & Edelman, S. (2016) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2015.11.004 · Cited by 9
General System Identification — Fundamentals and Results
Gaines, B. R. (1978) · Springer eBooks · doi:10.1007/978-1-4757-0555-3_7 · Cited by 9
Prediction of Infinite Words with Automata
Smith, T. (2016) · Theory of Computing Systems · doi:10.1007/s00224-016-9739-4 · Cited by 9
Lee, J., & Dewhurst, J. (2021) · European Journal for Philosophy of Science · doi:10.1007/s13194-020-00341-6 · Cited by 9
A Kolmogorov complexity-based Genetic Programming tool for string compression
Falco, I. D., Iazzetta, A., Tarantino, E., Cioppa, A. D., & Trautteur, G. (2000) · Cited by 9
Computing and Information Compression: A Reply
Wolff, J. G. (1994) · AI Communications · doi:10.3233/aic-1994-73-404 · Cited by 9
Cryptographic Security of Individual Instances
Antunes, L. F., Laplante, S., Pinto, A., & Salvador, L. C. M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10230-1_17 · Cited by 9
Incompleteness, Complexity, Randomness and Beyond
Calude, C. S. (2002) · Minds and Machines · doi:10.1023/a:1021132605507 · Cited by 9
Neural Predictors for Detecting and Removing Redundant Information
Schmidhuber, J. (2000) · Studies in cognitive systems · doi:10.1007/978-94-010-0870-9_73 · Cited by 9
A NON-PARAMETRIC APPROACH TO SIMPLICITY CLUSTERING
Hines, P., Pothos, E. M., & Nick Chater, A. (2007) · Applied Artificial Intelligence · doi:10.1080/08839510701526541 · Cited by 9
Mori, N., McKay, B., Hoài, N. X., Essam, D., & Takeuchi, S. (2009) · Journal of Advanced Computational Intelligence and Intelligent Informatics · doi:10.20965/jaciii.2009.p0237 · Cited by 9
Binary Sequences and Redundancy
Kak, S. C. (1974) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/tsmc.1974.5408465 · Cited by 9
Learning criterion and inductive behaviour
Coulon, D., & Kayser, D. (1978) · Pattern Recognition · doi:10.1016/0031-3203(78)90044-4 · Cited by 9
Towards a computational theory of statistical tests
Blum, M., & Goldreich, O. (1992) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1992.267749 · Cited by 9
Saxena, S. (2002) · Conference on Artificial Intelligence for Applications · doi:10.1109/caia.1993.366594 · Cited by 9
Optimal Ordered Problem SolverPreprint
Schmidhuber, J. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0207097 · Cited by 9
Informed parsimonious inference of prototypical genetic sequences
Milosavljević, A., Haussler, D. H., & Jurka, J. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50010-6 · Cited by 9
Model-Based Cooperative System Engineering and Integration
Landauer, C. A., & Bellman, K. L. (2016) · IEEE International Conference on Autonomic Computing (ICAC) · doi:10.1109/icac.2016.30 · Cited by 8
When and why metaheuristics researchers can ignore “No Free Lunch” theorems
McDermott, J. (2019) · Metaheuristics · doi:10.1007/s42257-019-00002-6 · Cited by 8
A theory of incremental compression
Franz, A., Antonenko, O., & Soletskyi, R. (2020) · Information Sciences · doi:10.1016/j.ins.2020.08.035 · Cited by 8
Machine Learning: When and Where the Horses Went Astray?
Diamant, E. (2010) · InTech eBooks · doi:10.5772/9156 · Cited by 8
Linear Bayes policy for learning in contextual-bandits
José Antonio Martín, H., & Pérez, A. M. V. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.07.041 · Cited by 8
On calibration error of randomized forecasting algorithms
V'yugin, V. V. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.01.010 · Cited by 8
The intrinsic probability of theism
Miller, C. (2018) · Philosophy Compass · doi:10.1111/phc3.12523 · Cited by 8
A novel nonlinear bispectrum analysis for dynamical complex oscillations
Hu, Y., Shi, W., & Yeh, C.-H. (2023) · Cognitive Neurodynamics · doi:10.1007/s11571-023-09953-z · Cited by 8
What Is Artificial General Intelligence?
Bennett, M. T. (2025) · Lecture notes in computer science · doi:10.1007/978-3-032-00686-8_4 · Cited by 9
Transfer Learning Using the Minimum Description Length Principle with a Decision Tree Application
Hlynsson, H. (2007) · Cited by 8
Kolmogorov complexity and games
Vereshchagin, N. (2008) · Cited by 8
Delahaye, J.-P. (1993) · Springer eBooks · doi:10.1007/978-94-015-8208-7_8 · Cited by 8
Natural Versus "universal" Probability, Complexity, And Entropy
Denker, J. S., & LeCun, Y. (2005) · Workshop on Physics and Computation (PhysComp) · doi:10.1109/phycmp.1992.615508 · Cited by 8
Velupillai, K. V., & Kao, Y. (2013) · Cognitive Systems Research · doi:10.1016/j.cogsys.2013.07.005 · Cited by 10
Beyond Physics? On the Prospects of Finding a Meaningful Oracle
Edis, T., & Boudry, M. (2014) · Foundations of Science · doi:10.1007/s10699-014-9349-z · Cited by 8
Finding Unknown Repeated Patterns In Images
Ferreira, P. J. S. G., & Pinho, A. J. (2011) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.42555 · Cited by 8
Invariance as a Tool for Ontology of Information
Schroeder, M. J. (2016) · Information · doi:10.3390/info7010011 · Cited by 8
Algorithmic Information Theory for Physicists and Natural Scientists
Devine, S. D. (2020) · Institute of Physics eBooks · doi:10.1088/978-0-7503-2640-7 · Cited by 10
Artificial Intelligence and Visual Art
Wilson, S., & Kugel, P. (1982) · Leonardo · doi:10.2307/1574391 · Cited by 8
Barmpalias, G. (2020) · Cambridge University Press eBooks · doi:10.1017/9781108781718.007 · Cited by 8
A Formal Approach to the Problem of Logical Non-Omniscience
Garrabrant, S., Benson-Tilsen, T., Critch, A., Soares, N., & Taylor, J. (2017) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.251.16 · Cited by 8
A Roadmap for the Development of the ‘SP Machine’ for Artificial Intelligence
Palade, V., & Wolff, J. G. (2018) · The Computer Journal · doi:10.1093/comjnl/bxy126 · Cited by 8
Mathematics as Information Compression via the Matching and Unification of Patterns
Wolff, J. G. (2019) · Complexity · doi:10.1155/2019/6427493 · Cited by 8
Tate, S. R. (2003) · Elsevier eBooks · doi:10.1016/b978-012620861-0/50003-6 · Cited by 8
Depth-Bounded Statistical PCFG Induction as a Model of Human Grammar Acquisition
Jin, L., Schwartz, L., Doshi‐Velez, F., Miller, T., & Schuler, W. (2021) · Computational Linguistics · doi:10.1162/coli_a_00399 · Cited by 8
Improving the Scalability of Generative Representations for Openended Design
Hornby, G. S. (2007) · Springer eBooks · doi:10.1007/978-0-387-76308-8_8 · Cited by 8
Modeling Complexity for Interactive Art Works on the Internet
Sommerer, C., & Mignonneau, L. (2003) · Elsevier eBooks · doi:10.1016/b978-044450944-4/50010-4 · Cited by 8
Entropy and algorithmic complexity in quantum information theory
Benatti, F. (2006) · Natural Computing · doi:10.1007/s11047-006-9017-5 · Cited by 8
Infotropism as the underlying principle of perceptual organization
Thornton, C. (2014) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2014.08.002 · Cited by 8
Noise-Induced Order — Complexity Theoretical Digression
Tsuda, I., & Matsumoto, K. (1984) · Springer series in synergetics · doi:10.1007/978-3-642-69559-9_14 · Cited by 8
Schmidt, J. C. (2003) · Journal for General Philosophy of Science · doi:10.1023/a:1023296302464 · Cited by 8
Scaling behaviour of entropy estimates
Schürmann, T. (2002) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/35/7/308 · Cited by 8
Comparing descriptional and computational complexity of infinite words
Hromkovic̆, J., Karhumäki, J., & Lepistö, A. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58131-6_46 · Cited by 8
Algorithmic complexity bounds on future prediction errors
Chernov, A., Hütter, M., & Schmidhuber, J. (2006) · Information and Computation · doi:10.1016/j.ic.2006.10.004 · Cited by 8
Some Basic Problems with Complex Systems
Harald Atmanspacher, A., & Wiedenmann, G. (1998) · IFAC Proceedings Volumes · doi:10.1016/s1474-6670(17)41939-2 · Cited by 8
Kolmogorov Complexity, Complexity Cores, and the Distribution of Hardness
Juedes, D. W., & Lutz, J. H. (1992) · Springer eBooks · doi:10.1007/978-3-642-77735-6_4 · Cited by 8
Consistent Polynomial Identification in the Limit
Stein, W. (1998) · Lecture notes in computer science · doi:10.1007/3-540-49730-7_30 · Cited by 8
Is there a physically universal cellular automaton or Hamiltonian?Preprint
Janzing, D. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1009.1720 · Cited by 8
Inference for regular bilanguages
Berger, J., & Pair, C. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90052-1 · Cited by 8
Wolff, J. G. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0302015 · Cited by 8
Jorge, A. (1999) · Cited by 8
Universal Compressed Sensing of Markov Sources.Preprint
Jalali, S., & Poor, H. V. (2014) · arXiv (Cornell University) · Cited by 8
Learning with Stochastic Automata and Stochastic Languages
Fu, K. S. (1976) · Springer eBooks · doi:10.1007/978-94-010-1545-5_3 · Cited by 8
Convergence and Error Bounds for Universal Prediction of Nonbinary SequencesPreprint
Hütter, M. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0106036 · Cited by 8
Topics in Statistical Pattern Recognition
Cover, T. M., & Wagner, T. J. (1976) · Communication and cybernetics · doi:10.1007/978-3-642-96303-2_2 · Cited by 8
Algorithmic Information of Images
Martinoli, O., Masulli, F., & Riani, M. (1988) · Springer eBooks · doi:10.1007/978-1-4613-1007-5_31 · Cited by 8
Complexity and Information Theory
de Luca, A. (1975) · Springer eBooks · doi:10.1007/978-3-7091-3008-7_7 · Cited by 8
Information Compression, Intelligence, Computing, and MathematicsPreprint
Wolff, J. G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.8599 · Cited by 8
INDUCTIVE INFERENCE RESEARCH STATUS, SPRING 1967
Solomonofi, R. J. (1967) · Cited by 7
Zimmermann, J., & Cremers, A. B. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19391-0_20 · Cited by 7
Streaming generalized cross entropy
Angelelli, M., Ciavolino, E., & Pasca, P. (2019) · Soft Computing · doi:10.1007/s00500-019-04632-w · Cited by 7
A computational approximation to the AIXI model
Pankov, S. (2008) · Artificial General Intelligence · Cited by 7
All Sampling Methods Produce Outliers
Epstein, S. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3109779 · Cited by 7
Experimental implications of the reinterpretation of quantum mechanics
Werbos, P. J. (1975) · Il Nuovo cimento della Società italiana di fisica. B/Il Nuovo cimento B · doi:10.1007/bf02732237 · Cited by 8
Analysing Music with Point-Set Compression Algorithms
Meredith, D. (2015) · Springer eBooks · doi:10.1007/978-3-319-25931-4_13 · Cited by 7
Shallow Reductionism and the Problem of Complexity in Psychology
Brattico, P. (2008) · Theory & Psychology · doi:10.1177/0959354308091840 · Cited by 7
Monod's conception of chance: Its diversity and relevance today
Merlin, F. (2015) · Comptes Rendus Biologies · doi:10.1016/j.crvi.2015.03.004 · Cited by 7
Luckiness and Regret in Minimum Description Length Inference
de Rooij, S., & Grünwald, P. (2011) · Elsevier eBooks · doi:10.1016/b978-0-444-51862-0.50029-0 · Cited by 7
Analogies and theories: The role of simplicity and the emergence of norms
Gayer, G., & Gilboa, I. (2013) · Games and Economic Behavior · doi:10.1016/j.geb.2013.11.003 · Cited by 7
Objectivity, Information, and Maxwell's Demon
Weinstein, S. (2003) · Philosophy of Science · doi:10.1086/377404 · Cited by 7
Music analysis and Kolmogorov complexity
Meredith, D. (2012) · VBN Forskningsportal (Aalborg Universitet) · Cited by 7
On Bayesian Simplicity in Human Visual Perceptual Organization
van der Helm, P. A. (2017) · Perception · doi:10.1177/0301006617719604 · Cited by 7
Calculating Cognitive Augmentation – A Case Study
Fulbright, R. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-22419-6_38 · Cited by 7
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
