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 701–800 of 1,001
Measure software - and its evolution - using information content
Arbuckle, T. (2009) · International Workshop on Principles of Software Evolution · doi:10.1145/1595808.1595831 · Cited by 13
A method for the inference of non-recursive context-free grammars
Chirathamjaree, C., & Ackroyd, M. H. (1980) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(80)80022-8 · Cited by 13
Homogeneous measures and polynomial time invariants
Levin, L. A. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21919 · Cited by 13
On the Foundations of Universal Sequence Prediction
Hütter, M. (2006) · Lecture notes in computer science · doi:10.1007/11750321_39 · Cited by 13
Novamente: An Integrative Architecture for General Intelligence.
Looks, M., Goertzel, B., & Pennachin, C. L. (2004) · Cited by 13
The discovery of algorithmic probability: A guide for the programming of true creativity
Solomonoff, R. J. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59119-2_165 · Cited by 13
Self-citationOn prediction by data compression
Vitanyi, P. M. B., & Li, M. (1997) · Lecture notes in computer science · doi:10.1007/3-540-62858-4_69 · Cited by 13
Learning Stochastic Motifs from Genetic Sequences
Yamanishi, K., & Konagaya, A. (1991) · Elsevier eBooks · doi:10.1016/b978-1-55860-200-7.50096-9 · Cited by 13
Topics in Statistical Pattern Recognition
Cover, T. M., & Wagner, T. J. (1980) · Communication and cybernetics · doi:10.1007/978-3-642-67740-3_2 · Cited by 13
Is there an Elegant Universal Theory of Prediction?Preprint
Legg, S. (2006) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0606070 · Cited by 13
One Big Net For EverythingPreprint
Schmidhuber, J. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.08864 · Cited by 36
Information theory and learning: a physical approachPreprint
Nemenman, I. M. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.physics/0009032 · Cited by 15
Learning SCFGs from Corpora by a Genetic Algorithm
Keller, B., & Lutz, R. (1998) · Artificial Neural Nets and Genetic Algorithms · doi:10.1007/978-3-7091-6492-1_46 · Cited by 12
Measuring structural similarity of semistructured data based on information-theoretic approaches
Helmer, S., Augsten, N., & Böhlen, M. H. (2012) · The VLDB Journal · doi:10.1007/s00778-012-0263-0 · Cited by 12
Searching for Minimal Neural Networks in Fourier Space
Koutník, J., Gomez, F. J., & Schmidhuber, J. (2010) · Artificial General Intelligence · doi:10.2991/agi.2010.28 · Cited by 12
Complexity, Neuroaesthetics, and Computational Aesthetic Evaluation
Galanter, P. (2010) · Cited by 12
Minimum Description Length Recurrent Neural Networks
Lan, N., Geyer, M., Chemla, E., & Katzir, R. (2022) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00489 · Cited by 15
Is Consciousness Computable? Quantifying Integrated Information Using Algorithmic Information Theory
Maguire, P., Moser, P., Maguire, R., & Griffith, V. (2014) · Maynooth University ePrints and eTheses Archive (Maynooth University) · doi:10.48550/arxiv.1405.0126 · Cited by 12
Introduction to Ray Solomonoff 85th Memorial Conference
Dowe, D. L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-44958-1_1 · Cited by 12
$LT^2C^2$ : A language of thought with Turing-computable Kolmogorov complexity
Romano, S., Sigman, M., & Figueira, S. D. (2013) · Papers in Physics · doi:10.4279/pip.050001 · Cited by 12
On the computability of a construction of Brownian motion
DAVIE, G., & Fouché, W. L. (2013) · Mathematical Structures in Computer Science · doi:10.1017/s0960129513000157 · Cited by 12
From Bayesian Classifiers to Possibilistic Classifiers for Numerical Data
Bounhas, M., Mellouli, K., Prade, H. M., & Serrurier, M. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15951-0_15 · Cited by 12
New Millennium AI and the Convergence of History: Update of 2012
Schmidhuber, J. (2012) · The frontiers collection · doi:10.1007/978-3-642-32560-1_4 · Cited by 12
Algorithmic complexity of financial motions
Brandouy, O., Delahaye, J.-P., Ma, L., & Zenil, H. (2012) · Research in International Business and Finance · doi:10.1016/j.ribaf.2012.08.001 · Cited by 12
Simplicity, Language-Dependency and the Best System Account of Laws
Wheeler, B. (2016) · THEORIA An International Journal for Theory History and Foundations of Science · doi:10.1387/theoria.14558 · Cited by 12
Cognitive Augmentation Metrics Using Representational Information Theory
Fulbright, R. (2017) · Lecture notes in computer science · doi:10.1007/978-3-319-58625-0_3 · Cited by 13
Belot, G. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.09.013 · Cited by 12
Halting probability amplitude of quantum computers
Svozil, K. (1996) · Springer eBooks · doi:10.1007/978-3-642-80350-5_18 · Cited by 12
Sequential predictions based on algorithmic complexity
Hütter, M. (2005) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2005.07.001 · Cited by 12
The evolution of human communication and the information revolution — A mathematical perspective
Benczúr, A. A. (2003) · Mathematical and Computer Modelling · doi:10.1016/s0895-7177(03)90055-0 · Cited by 12
A GENERAL FRAMEWORK FOR BICLUSTERING GENE EXPRESSION DATA
Li, H., CHEN, X., Zhang, K., & Jiang, T. (2006) · Journal of Bioinformatics and Computational Biology · doi:10.1142/s021972000600217x · Cited by 12
Minimum Message Length Clustering of Spatially-Correlated Data with Varying Inter-Class Penalties
Visser, G., & Dowe, D. L. (2007) · IEEE/ACIS International Conference on Computer and Information Science (ICIS) · doi:10.1109/icis.2007.134 · Cited by 12
On the spontaneous generation of complexity in the universe
Lloyd, S. (2013) · Cambridge University Press eBooks · doi:10.1017/cbo9781139225700.007 · Cited by 12
Complexity: the organizing principle at the interface of biological (dis)order
Bhat, R., & Pally, D. (2017) · Journal of Genetics · doi:10.1007/s12041-017-0793-8 · Cited by 12
No communication without manipulation: A causal-deflationary view of information
López, C., & Lombardi, O. (2018) · Studies in History and Philosophy of Science Part A · doi:10.1016/j.shpsa.2018.06.003 · Cited by 14
Hertling, P. H., & Weihrauch, K. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055103 · Cited by 12
A Formal Definition of Intelligence Based on an Intensional Variant of Algorithmic Complexity
Hernández‐Orallo, J., & Minaya-collado, N. (1998) · Cited by 12
Dowe, D. L. (2008) · Social Epistemology · doi:10.1080/02691720802576291 · Cited by 12
An Example of Information and Computation Resource Trade-Off
Daley, R. (1973) · Journal of the ACM · doi:10.1145/321784.321794 · Cited by 12
On the behavioral diversity of random programs
Looks, M. (2007) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1276958.1277283 · Cited by 12
Model-based multisensor data fusion: a minimal representation approach
Joshi, R., & Sanderson, A. C. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351252 · Cited by 12
Diagnosis of semiconductor manufacturing equipment and processes
Saxena, S., & Unruh, A. (1994) · IEEE Transactions on Semiconductor Manufacturing · doi:10.1109/66.286857 · Cited by 12
Stochastic Clustering for Organizing Distributed Information Sources
Shyu, M., Chen, S.-C., & Rubin, S. H. (2004) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2004.833599 · Cited by 12
A Comparative Study of String Dissimilarity Measures in Structural Clustering
Fred, A. L. N., & Leitão, J. M. N. (1999) · International Conference on Advances in Pattern Recognition · doi:10.1007/978-1-4471-0833-7_39 · Cited by 12
Complexity and Unpredictable Scaling of Hierarchical Structures
Badii, R. (1992) · NATO ASI series. Series B : Physics · doi:10.1007/978-1-4615-3464-8_1 · Cited by 12
Li, M., Longpré, L., & Vitanyi, P. M. B. (1986) · Lecture notes in computer science · doi:10.1007/3-540-16486-3_101 · Cited by 12
An upward measure separation theorem
Lutz, J. H. (1991) · Theoretical Computer Science · doi:10.1016/0304-3975(91)90320-2 · Cited by 12
Sets Have Simple MembersPreprint
Epstein, S., & Levin, L. A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1107.1458 · Cited by 12
Extensions and Limitations of the Neural GPUPreprint
Price, E., Zaremba, W., & Sutskever, I. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1611.00736 · Cited by 21
A Direct Sum Result for the Information Complexity of LearningPreprint
Nachum, I., Shafer, J., & Yehudayoff, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1804.05474 · Cited by 12
Gaming security by obscurityPreprint
Pavlović, D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1109.5542 · Cited by 12
IAE performance based signal complexity measure
Liu, J., Cui, C., Meng, Q., Shen, Y., & Fang, F. (2015) · Measurement · doi:10.1016/j.measurement.2015.07.038 · Cited by 11
Naval Intelligent Authentication and Support Through Randomization and Transformative Search
Rubin, S. H., & Bouabana‐Tebibel, T. (2016) · Intelligent systems reference library · doi:10.1007/978-3-319-32168-4_3 · Cited by 11
Real patterns and indispensability
Suñé, A., & Martínez, M. (2019) · Synthese · doi:10.1007/s11229-019-02343-1 · Cited by 11
Learning in Pessiland via Inductive Inference
Hirahara, S., & Nanashima, M. (2023) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs57990.2023.00033 · Cited by 11
Information Theory for Risk-based Water System Operation
Weijs, S. V. (2011) · Research Repository (Delft University of Technology) · doi:10.4233/uuid:8d7290d3-a903-4cfe-8c12-0387b94a192e · Cited by 11
Elementary differences between the degrees of unsolvability and degrees of compressibility
Barmpalias, G. (2009) · Annals of Pure and Applied Logic · doi:10.1016/j.apal.2009.11.004 · Cited by 11
Popkin, G. (2017) · The New Scientist · doi:10.1016/s0262-4079(17)30321-4 · Cited by 11
Soloveychik, I., Xiang, Y., & Tarokh, V. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2777464 · Cited by 11
Symmetric Pseudo-Random Matrices
Soloveychik, I., Xiang, Y., & Tarokh, V. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2018.2800004 · Cited by 11
Identification of probabilities
Vitanyi, P. M. B., & Chater, N. (2016) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2016.11.004 · Cited by 11
Zenil, H., Kiani, N. A., & Tegner, J. N. (2019) · Entropy · doi:10.3390/e21060560 · Cited by 11
Bizopoulos, P. A., & Koutsouris, D. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.2984514 · Cited by 12
Huang, C., Jiang, Y., & Yeh, W. (2021) · Journal of Sensors · doi:10.1155/2021/7833641 · Cited by 11
Ortner, R., & Leitgeb, H. (2011) · Handbook of the history of logic · doi:10.1016/b978-0-444-52936-7.50018-5 · Cited by 11
Thou Shalt Not Take Sides: Cognition, Logic and the Need for Changing How We Believe
Martins, A. C. R. (2016) · Frontiers in Physics · doi:10.3389/fphy.2016.00007 · Cited by 11
An Operational Characterization of Mutual Information in Algorithmic Information Theory
Romashchenko, A., & Zimand, M. (2019) · Journal of the ACM · doi:10.1145/3356867 · Cited by 11
Zenil, H. (2020) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789811200076_0011 · Cited by 11
MML Clustering of Continuous-Valued Data Using Gaussian and t Distributions
Agusta, Y., & Dowe, D. L. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36187-1_13 · Cited by 11
Sequential fuzzy system identification
Gaines, B. R. (1979) · Fuzzy Sets and Systems · doi:10.1016/0165-0114(79)90012-5 · Cited by 11
Predictive stochastic complexity and model estimation for finite-state processes
Weinberger, M. J., & Feder, M. (1994) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(94)90092-2 · Cited by 11
Characterization of language learning front informant under various monotonicity constraints
Lange, S., & Zeugmann, T. (1994) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139408953782 · Cited by 11
GENERATING AND MEASURING AESTHETIC FORMS
Stiny, G. (1978) · Elsevier eBooks · doi:10.1016/b978-0-12-161910-7.50013-8 · Cited by 11
FIVE LECTURES ON ALGORITHMIC RANDOMNESS
Downey, R. G. (2008) · Lecture notes series, Institute For Mathematical Sciences · doi:10.1142/9789812794055_0001 · Cited by 11
Levelt, W. J. M. (1975) · MPG.PuRe (Max Planck Society) · Cited by 11
Succinct representation random strings, and complexity classes
Peterson, G. L. (1980) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1980.42 · Cited by 11
Inductive inference: A recursion theoretic approach
Blum, L., & Blum, M. (1973) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1973.12 · Cited by 11
Completeness and Weak Completeness under Polynomial-Size Circuits
Juedes, D. W., & Lutz, J. H. (1996) · Information and Computation · doi:10.1006/inco.1996.0017 · Cited by 11
Cao, M. D., Ganesamoorthy, D., Elliott, A. G., Zhang, H., Cooper, M. A., & Coin, L. (2015) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/019356 · Cited by 11
C-Tests Revisited: Back and Forth with Complexity
Hernández‐Orallo, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21365-1_28 · Cited by 10
Enhancing metagenomic classification with compression-based features
Silva, J. M., & Almeida, J. R. (2024) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2024.102948 · Cited by 10
Inferring Human Values for Safe AGI Design
Sezener, C. E. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21365-1_16 · Cited by 10
Information Theory and Computational Thermodynamics: Lessons for Biology from Physics
Zenil, H. (2012) · Information · doi:10.3390/info3040739 · Cited by 10
Toward a Standard Metric of Machine Intelligence
Yonck, R. (2012) · World Futures Review · doi:10.1177/194675671200400210 · Cited by 10
Visually Summarising Software Change
Arbuckle, T. (2008) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2008.58 · Cited by 10
NNCS: Randomization and Informed Search for Novel Naval Cyber Strategies
Rubin, S. H., & Bouabana‐Tebibel, T. (2015) · Studies in computational intelligence · doi:10.1007/978-3-319-26450-9_8 · Cited by 10
Assumptions of Decision-Making Models in AGI
Wang, P., & Hammer, P. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-21365-1_21 · Cited by 10
Complexity analysis to explore the structure of ancient stromatolites
Storrie‐Lombardi, M. C., Corsetti, F. A., Grigolini, P., Ignaccolo, M., Allegrini, P., Galatolo, S., & Tinetti, G. (2003) · Chaos Solitons & Fractals · doi:10.1016/s0960-0779(03)00436-3 · Cited by 10
The representation and manipulation of the algorithmic probability measure for problem solving
Gammerman, A. (1991) · Annals of Mathematics and Artificial Intelligence · doi:10.1007/bf01531061 · Cited by 10
Algorithmic Cross-Complexity and Relative Complexity
Cerra, D., & Datcu, M. P. (2009) · DCC · doi:10.1109/dcc.2009.6 · Cited by 10
Artificial Scientists a Artists Based on the Formal Theory of Creativity
Schmidhuber, J. (2010) · Artificial General Intelligence · doi:10.2991/agi.2010.32 · Cited by 10
Measuring complexity by measuring structure and organization
Hornby, G. S. (2007) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2007.4424721 · Cited by 10
Mathematical definition of"intelligence"(and consequences)
Smith, W. D. (2006) · Cited by 10
Artificial Curiosity for Autonomous Space Exploration
Futura, A. (2011) · Cited by 10
The Cortical Conductor Theory: Towards Addressing Consciousness in AI Models
Bach, J. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-99316-4_3 · Cited by 11
A sideways view of stromatolites: complexity metrics for stromatolite laminae
Storrie‐Lombardi, M. C., & Awramik, S. M. (2006) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.679869 · Cited by 10
Stochastic complexity in learning
Rissanen, J. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59119-2_178 · Cited by 10
Efficient mixed-order hidden Markov model inference
Schwardt, L. C., & du Preez, J. A. (2000) · International Conference on Spoken Language Processing (ICSLP) · doi:10.21437/icslp.2000-253 · Cited by 10
A Network of Autoregressive Processing Units for Time Series Modeling
Lehtokangas, M. I., Saarinen, J. P. P., Kaski, K. K., & Huuhtanen, P. (1996) · Applied Mathematics and Computation · doi:10.1016/0096-3003(95)00122-0 · Cited by 10
Information, knowledge and the future of machines
MacFarlane, A. G. J. (2003) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2003.1226 · Cited by 10
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
