Cited by 1,758Computability, Logic, AI Algorithmssemigroups and automata theoryMachine Learning and Algorithms

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 access

Solomonoff, R.J.·1964·Information and Control

DOI 10.1016/s0019-9958(64)90131-7

Open this paper in CoChat — free account Open PDF

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

Crossref · 10.1016/s0019-9958(64)90131-7

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

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
Games and Decisions
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
A Treatise on Probability
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

Show all 6 references

Sorted by citations

Items 201–300 of 1,001

Low-Complexity Art
Schmidhuber, J. (1997) · Leonardo · doi:10.2307/1576418 · Cited by 80
Interpreting neurodynamics: concepts and facts
Harald Atmanspacher, A., & Rotter, S. (2008) · Cognitive Neurodynamics · doi:10.1007/s11571-008-9067-8 · Cited by 79
An information-theoretic approach to time bounds for on-line computation
Paul, W. J., Seiferas, J., & Šimon, J. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90009-x · Cited by 79
Complexity measures and cellular automata
Lindgren, K. A., & Nordahl, M. G. (1988) · Chalmers Publication Library (Chalmers University of Technology) · doi:10.5555/56123.56125 · Cited by 78
A formalist perspective on language acquisition
Yang, C. D. (2018) · Linguistic Approaches to Bilingualism · doi:10.1075/lab.18014.yan · Cited by 77
The Frame Problem: An AI Fairy Tale
Korb, K. B. (1998) · Minds and Machines · doi:10.1023/a:1008286921835 · Cited by 77
Learning Simple Algorithms from ExamplesPreprint
Zaremba, W., Mikolov, T., Joulin, A., & Fergus, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.07275 · Cited by 79
Input–output maps are strongly biased towards simple outputs
Dingle, K., Camargo, C. Q., & Louis, A. A. (2018) · Nature Communications · doi:10.1038/s41467-018-03101-6 · Cited by 76
Time series anomaly discovery with grammar-based compression
Senin, P., Lin, J., Wang, X., Oates, T., Gandhi, S., Boedihardjo, A. P., Chen, C., & Frankenstein, S. (2015) · Movebank · doi:10.5441/002/edbt.2015.42 · Cited by 76
A Novel Hyperparameter-Free Approach to Decision Tree Construction That Avoids Overfitting by Design
Leiva, R. A. G., Anta, A. F., Mancuso, V., & Casari, P. (2019) · IEEE Access · doi:10.1109/access.2019.2930235 · Cited by 75
Bayesian grammar induction for language modeling
Chen, S. F. (1995) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981658.981689 · Cited by 75
Entropy, information, and computation
Machta, J. L. (1999) · American Journal of Physics · doi:10.1119/1.19085 · Cited by 74
Randomness and reducibility
Downey, R. G., Hirschfeldt, D. R., & Laforte, G. (2003) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2003.07.004 · Cited by 74
On initial segment complexity and degrees of randomness
Miller, J. S., & Yu, L. (2008) · Transactions of the American Mathematical Society · doi:10.1090/s0002-9947-08-04395-x · Cited by 73
Recursively enumerable reals and Chaitin Ω numbers
Calude, C. S., Hertling, P. H., Khoussainov, B., & Wang, Y. (2001) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00159-0 · Cited by 73
A generalization of Chaitin's halting probability $\Omega$ and halting self-similar sets
Tadaki, K. (2002) · Hokkaido Mathematical Journal · doi:10.14492/hokmj/1350911778 · Cited by 72
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility
Zenil, H., Toscano, F. S., Delahaye, J.-P., & Gauvrit, N. (2015) · PeerJ Computer Science · doi:10.7717/peerj-cs.23 · Cited by 72
Relations Between Varieties of Kolmogorov Complexities
Uspensky, V., & Shen', A. K. (1996) · Theory of Computing Systems · doi:10.1007/bf01201280 · Cited by 72
Learning of Context-Free Languages: A Survey of the Literature
Lee, L. (1996) · Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Cited by 72
Unsupervised Learning of Word Boundary with Description Length Gain
Kit, C., & Wilks, Y. A. (1999) · Cited by 71
Inductive reasoning and kolmogorov complexity
Li, M., & Vitanyi, P. M. B. (1992) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(92)90026-f · Cited by 71
Universal Artificial Intelligence
Everitt, T., & Hütter, M. (2018) · Studies in systems, decision and control · doi:10.1007/978-3-319-64816-3_2 · Cited by 70
On Learning to Think: Algorithmic Information Theory for Novel Combinations of Reinforcement Learning Controllers and Recurrent Neural World ModelsPreprint
Schmidhuber, J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.09249 · Cited by 120
Predicting perceived visual complexity of abstract patterns using computational measures: The influence of mirror symmetry on complexity perception
Gartus, A., & Leder, H. (2017) · PLoS ONE · doi:10.1371/journal.pone.0185276 · Cited by 69
A catalog of Boolean concepts
Feldman, J. (2003) · Journal of Mathematical Psychology · doi:10.1016/s0022-2496(02)00025-1 · Cited by 75
Pixon‐based multiresolution image reconstruction and the quantification of picture information content
Puetter, R. C. (1995) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.1850060405 · Cited by 69
Learning Simple Concepts under Simple Distributions
Li, M., & Vitanyi, P. M. B. (1991) · SIAM Journal on Computing · doi:10.1137/0220056 · Cited by 69
Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks
Zenil, H., Toscano, F. S., Dingle, K., & Louis, A. A. (2014) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2014.02.060 · Cited by 68
The Child as Hacker
Rule, J., Tenenbaum, J. B., & Piantadosi, S. T. (2020) · Trends in Cognitive Sciences · doi:10.1016/j.tics.2020.07.005 · Cited by 86
Kolmogorov and mathematical logic
Uspensky, V. (1992) · Journal of Symbolic Logic · doi:10.2307/2275276 · Cited by 68
Grammatical Inference: Introduction and Survey-Part I
Fu, K., & Booth, T. L. (1986) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1986.4767796 · Cited by 68
Behaviour/structure transformations under uncertainty
Gaines, B. R. (1976) · International Journal of Man-Machine Studies · doi:10.1016/s0020-7373(76)80005-3 · Cited by 68
Does the universe in fact contain almost no informationPreprint
Tegmark, M. (1996) · Cited by 68
Gales and the Constructive Dimension of Individual Sequences
Lutz, J. H. (2000) · Lecture notes in computer science · doi:10.1007/3-540-45022-x_76 · Cited by 67
A global compositional complexity measure for biological sequences: AT-rich and GC-rich genomes encode less complex proteins
Wan, H., & Wootton, J. C. (2000) · Computers & Chemistry · doi:10.1016/s0097-8485(00)80008-x · Cited by 67
Finite-state models in the alignment of macromolecules
Allison, L., Wallace, C. S., & Yee, C. N. (1992) · Journal of Molecular Evolution · doi:10.1007/bf00160262 · Cited by 65
A Theory of Universal Artificial Intelligence based on Algorithmic ComplexityPreprint
Hütter, M. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0004001 · Cited by 65
Exploring the predictable
Schmidhuber, J. (2003) · Natural Computing Series · doi:10.1007/978-3-642-18965-4_23 · Cited by 65
Deep learning in structural bioinformatics: current applications and future perspectives
Kumar, N., & Srivastava, R. K. (2024) · Briefings in Bioinformatics · doi:10.1093/bib/bbae042 · Cited by 67
Sampling Assumptions in Inductive Generalization
Navarro, D., Dry, M. J., & Lee, M. D. (2011) · Cognitive Science · doi:10.1111/j.1551-6709.2011.01212.x · Cited by 65
On the Procedures of Generation of Numerical Features over Partitions of Sets of Objects in the Problem of Predicting Numerical Target Variables
Torshin, I. Y., & Владимирович, Р. К. (2019) · Pattern Recognition and Image Analysis · doi:10.1134/s1054661819040175 · Cited by 64
Monotonic versus non-monotonic language learning
Lange, S., & Zeugmann, T. (2006) · Springer eBooks · doi:10.1007/bfb0030397 · Cited by 64
A SYSTEM FOR INCREMENTAL LEARNING BASED ON ALGORITHMIC PROBABILITY
Solomonofi, R. J. (1989) · Cited by 63
On the relation between descriptional complexity and algorithmic probability
Gács, P. (1983) · Theoretical Computer Science · doi:10.1016/0304-3975(83)90139-1 · Cited by 63
Reinforcement Learning with Self-Modifying Policies
Schmidhuber, J., Zhao, J., & Schraudolph, N. N. (1998) · Springer eBooks · doi:10.1007/978-1-4615-5529-2_12 · Cited by 63
The Computational Origin of Representation
Piantadosi, S. T. (2020) · Minds and Machines · doi:10.1007/s11023-020-09540-9 · Cited by 71
Linear Complexity and Random Sequences
Rueppel, R. A. (2007) · Springer eBooks · doi:10.1007/3-540-39805-8_21 · Cited by 62
Complexity and Emergence
(2002) · doi:10.1142/5095 · Cited by 62
Algorithmic complexity for psychology: a user-friendly implementation of the coding theorem method
Gauvrit, N., Singmann, H., Toscano, F. S., & Zenil, H. (2015) · Behavior Research Methods · doi:10.3758/s13428-015-0574-3 · Cited by 61
THE FASTEST AND SHORTEST ALGORITHM FOR ALL WELL-DEFINED PROBLEMS
Hütter, M. (2002) · International Journal of Foundations of Computer Science · doi:10.1142/s0129054102001199 · Cited by 63
Learning theory and natural language
Osherson, D. N. (1984) · Cognition · doi:10.1016/0010-0277(84)90040-4 · Cited by 61
On the syntactic structure of protein sequences and the concept of grammar complexity
Jiménez-Montaño, M. A. (1984) · Bulletin of Mathematical Biology · doi:10.1007/bf02459508 · Cited by 60
THE VELOCITY DISTRIBUTION OF NEARBY STARS FROMHIPPARCOSDATA. I. THE SIGNIFICANCE OF THE MOVING GROUPS
Bovy, J., Hogg, D. W., & Roweis, S. T. (2009) · The Astrophysical Journal · doi:10.1088/0004-637x/700/2/1794 · Cited by 60
Cognitive high level information fusion
PERLOVSKY, L. I. (2007) · Information Sciences · doi:10.1016/j.ins.2006.12.026 · Cited by 59
Ultimate Cognition à la Gödel
Schmidhuber, J. (2009) · Cognitive Computation · doi:10.1007/s12559-009-9014-y · Cited by 62
Medical diagnosis as pattern recognition in a framework of information compression by multiple alignment, unification and search
Wolff, J. G. (2005) · Decision Support Systems · doi:10.1016/j.dss.2005.02.005 · Cited by 59
The Application of Algorithmic Probability to Problems in Artificial Intelligence
Solomonoff, R. J. (1986) · Machine intelligence and pattern recognition · doi:10.1016/b978-0-444-70058-2.50040-1 · Cited by 59
Self-citation
Statistical Inference through Data Compression
Cilibrasi, R. (2006) · Data Archiving and Networked Services (DANS) · Cited by 59
Foreword re C. S. Wallace
Dowe, D. L. (2008) · The Computer Journal · doi:10.1093/comjnl/bxm117 · Cited by 58
An Introduction to Design Arguments
Jantzen, B. C. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9780511793882 · Cited by 58
Problem Solving as Probabilistic Inference with Subgoaling: Explaining Human Successes and Pitfalls in the Tower of Hanoi
Donnarumma, F., Maisto, D., & Pezzulo, G. (2016) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1004864 · Cited by 63
Agent Foundations for Aligning Machine Intelligence with Human Interests: A Technical Research Agenda
Soares, N., & Fallenstein, B. (2017) · The frontiers collection · doi:10.1007/978-3-662-54033-6_5 · Cited by 58
Gambling using a finite state machine
Feder, M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.133269 · Cited by 58
Blind source separation using algorithmic information theory
Pajunen, P. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00048-4 · Cited by 58
MML, Hybrid Bayesian Network Graphical Models, Statistical Consistency, Invariance and Uniqueness
Dowe, D. L. (2011) · Elsevier eBooks · doi:10.1016/b978-0-444-51862-0.50030-7 · Cited by 57
Variational Learning and Bits-Back Coding: An Information-Theoretic View to Bayesian Learning
Honkela, A., & Harri Valpola, B. (2004) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.828762 · Cited by 59
Compression, Significance and Accuracy
Muggleton, S., Srinivasan, A., & Bain, M. (1992) · Elsevier eBooks · doi:10.1016/b978-1-55860-247-2.50048-6 · Cited by 57
IQ tests are not for machines, yet
Dowe, D. L., & Hernández‐Orallo, J. (2012) · Intelligence · doi:10.1016/j.intell.2011.12.001 · Cited by 57
Rationality and Intelligence: A Brief Update
Russell, S. (2016) · Synthese Library/Synthese library · doi:10.1007/978-3-319-26485-1_2 · Cited by 61
Simplicity and informativeness in semantic category systems
Carr, J. W., Smith, K., Culbertson, J., & Kirby, S. (2020) · Cognition · doi:10.1016/j.cognition.2020.104289 · Cited by 56
On hausdorff and topological dimensions of the kolmogorov complexity of the real line
Cai, J., & Hartmanis, J. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80073-x · Cited by 56
Average case complexity under the universal distribution equals worst-case complexity
Li, M., & Vitanyi, P. M. B. (1992) · Information Processing Letters · doi:10.1016/0020-0190(92)90138-l · Cited by 56
Approximate language identification
Wharton, R. M. (1974) · Information and Control · doi:10.1016/s0019-9958(74)91369-2 · Cited by 56
On Entropy-Based Data Mining
Holzinger, A., Hörtenhuber, M., Mayer, C. C., Bachler, M., Wassertheurer, S., Pinho, A. J., & Koslicki, D. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-43968-5_12 · Cited by 58
Methods of information theory and algorithmic complexity for network biology
Zenil, H., Kiani, N. A., & Tegner, J. N. (2016) · Seminars in Cell and Developmental Biology · doi:10.1016/j.semcdb.2016.01.011 · Cited by 57
Comprehenders model the nature of noise in the environment
Ryskin, R. A., Futrell, R., Kiran, S., & Gibson, E. A. F. (2018) · Cognition · doi:10.1016/j.cognition.2018.08.018 · Cited by 55
Ignoring data may be the only way to learn efficiently
Wiehagen, R., & Zeugmann, T. (1994) · Journal of Experimental & Theoretical Artificial Intelligence · doi:10.1080/09528139408953785 · Cited by 55
Comparing Humans and AI Agents
Insa-Cabrera, J., Dowe, D. L., España, S., Hernández‐Lloreda, M. V., & Hernández‐Orallo, J. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-22887-2_13 · Cited by 54
An Approximation of the Universal Intelligence Measure
Legg, S., & Veness, J. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-44958-1_18 · Cited by 54
Towards a Universal Theory of Artificial Intelligence Based on Algorithmic Probability and Sequential Decisions
Hütter, M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44795-4_20 · Cited by 54
Image Similarity Using Sparse Representation and Compression Distance
Guha, T., & Ward, R. K. (2014) · IEEE Transactions on Multimedia · doi:10.1109/tmm.2014.2306175 · Cited by 54
A geometric approach to complexity
Ay, N., Olbrich, E., Bertschinger, N., & Jost, J. (2011) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.3638446 · Cited by 55
Entropy Measures vs. Kolmogorov Complexity
Teixeira, A., Matos, A. B., Souto, A., & Antunes, L. F. (2011) · Entropy · doi:10.3390/e13030595 · Cited by 54
Computational depth and reducibility
Juedes, D. W., Lathrop, J. I., & Lutz, J. H. (1994) · Theoretical Computer Science · doi:10.1016/0304-3975(94)00014-x · Cited by 54
Approaches to Automatic Programming
Biermann, A. W. (1976) · Advances in computers · doi:10.1016/s0065-2458(08)60519-7 · Cited by 54
On the difficulty of computations
Chaitin, G. J. (1970) · IEEE Transactions on Information Theory · doi:10.1109/tit.1970.1054390 · Cited by 53
Metabolic biomarkers for chronic kidney disease
Breit, M., & Weinberger, K. M. (2015) · Archives of Biochemistry and Biophysics · doi:10.1016/j.abb.2015.07.018 · Cited by 54
Noncomputable Conditional Distributions
Ackerman, N., Freer, C. E., & Roy, D. M. (2011) · ACM/IEEE Symposium on Logic in Computer Science (LICS) · doi:10.1109/lics.2011.49 · Cited by 52
Biological Information as Set-Based Complexity
Galas, D. J., Nykter, M., Carter, G. W., Price, N. D., & Shmulevich, I. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2009.2037046 · Cited by 52
Power prediction in mobile communication systems using an optimal neural-network structure
Gao, X., Gao, X. Z., Tanskanen, J. M. A., & Ovaska, S. J. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.641467 · Cited by 52
Permissive Rationality and Sensitivity
Levinstein, B. A. (2015) · Philosophy and Phenomenological Research · doi:10.1111/phpr.12225 · Cited by 51
Big Data and the SP Theory of Intelligence
Wolff, J. G. (2014) · IEEE Access · doi:10.1109/access.2014.2315297 · Cited by 51
Case-based medical informatics
Pantazi, S. V., Arocha, J. F., & Moehr, J. R. (2004) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-4-19 · Cited by 51
Simple Algorithmic Theory of Subjective Beauty, Novelty, Surprise, Interestingness, Attention, Curiosity, Creativity, Art, Science, Music, Jokes
Schmidhuber, J. (2009) · Cited by 51
Applying MDL to learn best model granularity
Gao, Q., Li, M., & Vitanyi, P. M. B. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00034-5 · Cited by 51
Measuring sets in infinite groups
Borovik, A. V., Myasnikov, A., & Shpilrain, V. (2002) · Contemporary mathematics - American Mathematical Society · doi:10.1090/conm/298/05112 · Cited by 51
One model for the learning of language
Yang, Y., & Piantadosi, S. T. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2021865119 · Cited by 50
Learning recursive functions: A survey
Zeugmann, T., & Zilles, S. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2008.02.021 · Cited by 50
Communication Capacity of Quantum Computation
Bose, S., Rallan, L., & Vedral, V. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.5448 · Cited by 50
Simple Algorithmic Principles of Discovery, Subjective Beauty, Selective Attention, Curiosity & Creativity
Schmidhuber, J. (2007) · Springer eBooks · doi:10.1007/978-3-540-75488-6_3 · Cited by 50

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)
DOI: 10.1016/s0019-9958(64)90131-7
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: www.elsevier.com/tdm/userlicense/1.0/ (tdm)
www.elsevier.com/open-access/userlicense/1.0/ (vor, 18245 d)
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

A formal theory of inductive inference. Part II

Overview

Integrity signals

Verification

Claims the paper makes

Claims other papers make about this one

Self-check

Citations

Cites

Cited by

Related

Metadata

Record

About these checks