The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Open accessAbstract
An attempt is made to carry out a program (outlined in a previous paper) for defining the concept of a random or patternless, finite binary sequence, and for subsequently defining a random or patternless, infinite binary sequence to be a sequence whose initial segments are all random or patternless finite binary sequences. A definition based on the bounded-transfer Turing machine is given detailed study, but insufficient understanding of this computing machine precludes a complete treatment. A computing machine is introduced which avoids these difficulties.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
An introduction to probability theory and its applications
(1958) · Journal of the Franklin Institute · doi:10.1016/0016-0032(58)90688-4 · Cited by 29,269
Theory of games and economic behavior
(2019) · 100 Years of Math Milestones · doi:10.1090/mbk/121/32 · Cited by 16,632
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
The Logic of Scientific Discovery
(2013) · A Realist Theory of Science · doi:10.4324/9780203090732-9 · Cited by 7,731
B., T. A. A. (1946) · The Mathematical Gazette · doi:10.1017/s0025557200071461 · Cited by 7,129
An introduction to the theory of numbers
(1960) · Journal of the Franklin Institute · doi:10.1016/0016-0032(60)90676-1 · Cited by 3,574
The definition of random sequences
Martin-Löf, P. (1966) · Information and Control · doi:10.1016/s0019-9958(66)80018-9 · Cited by 1,220
Computability and Unsolvability.
Elgot, C., & Davis, M. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002808 · Cited by 980
Probability, Statistics and Truth.
N., E., & von Mises, R. (1939) · The Journal of Philosophy · doi:10.2307/2018923 · Cited by 637
Cited by
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
An Introduction to Econophysics: Correlations and Complexity in Finance
Mantegna, R. N., Stanley, H. E., & Chriss, N. A. (2000) · Physics Today · doi:10.1063/1.1341926 · Cited by 2,297
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
Pappu, R., Recht, B., Taylor, J., & Gershenfeld, N. (2002) · Science · doi:10.1126/science.1074376 · Cited by 2,018
Computation at the edge of chaos: Phase transitions and emergent computation
Langton, C. G. (1990) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(90)90064-v · Cited by 1,527
Bayesian Artificial Intelligence
Korb, K. B., & Nicholson, A. E. (2003) · Chapman & Hall/CRC eBooks · doi:10.1201/9780203491294 · Cited by 1,014
Algorithmic Information Theory
Chaitin, G. J. (1977) · IBM Journal of Research and Development · doi:10.1147/rd.214.0350 · Cited by 982
Self-citationInformation Science and Statistics
Andersen, E. B. (1986) · COMPSTAT · doi:10.1007/978-3-642-46890-2_1 · Cited by 899
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
Self-citationQuasi-Monte Carlo methods and pseudo-random numbers
Niederreiter, H. (1978) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1978-14532-7 · Cited by 806
The calculi of emergence: computation, dynamics and induction
Crutchfield, J. P. (1994) · Physica D: Nonlinear Phenomena · doi:10.1016/0167-2789(94)90273-9 · Cited by 754
Zvonkin, A. K., & Levin, L. A. (1970) · Russian Mathematical Surveys · doi:10.1070/rm1970v025n06abeh001269 · Cited by 665
Consistent interpretations of quantum mechanics
Omnès, R. (1992) · Reviews of Modern Physics · doi:10.1103/revmodphys.64.339 · Cited by 648
Logical basis for information theory and probability theory
Kolmogorov, A. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054210 · Cited by 592
Estimation and Inference by Compact Coding
Wallace, C. S., & Freeman, P. R. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01695.x · Cited by 523
Minimum complexity density estimation
Barron, A. R., & Cover, T. M. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.86996 · Cited by 497
Random sequence generation by cellular automata
Wolfram, S. (1986) · Advances in Applied Mathematics · doi:10.1016/0196-8858(86)90028-x · Cited by 494
Minimization of Boolean complexity in human concept learning
Feldman, J. (2000) · Nature · doi:10.1038/35036586 · Cited by 478
A complexity theoretic approach to randomness
Sipser, M. (1983) · Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83 · doi:10.1145/800061.808762 · Cited by 460
Crutchfield, J. P. (2012) · Nature Physics · doi:10.1038/nphys2190 · Cited by 446
Applying Occam’s razor in modeling cognition: A Bayesian approach
Myung, I. J., & Pitt, M. A. (1997) · Psychonomic Bulletin & Review · doi:10.3758/bf03210778 · Cited by 415
Introduction To Artificial Life
Adami, C. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.1998.738989 · Cited by 402
Generalized statistical complexity measures: Geometrical and analytical properties
Martin, M. T., Plastino, A., & Rosso, O. A. (2006) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2005.11.053 · Cited by 392
Predictability: a way to characterize complexity
Boffetta, G. (2002) · Physics Reports · doi:10.1016/s0370-1573(01)00025-4 · Cited by 391
Minimum Message Length and Kolmogorov Complexity
Wallace, C. S. (1999) · The Computer Journal · doi:10.1093/comjnl/42.4.270 · Cited by 347
The Search for Simplicity: A Fundamental Cognitive Principle?
Chater, N. (1999) · The Quarterly Journal of Experimental Psychology A · doi:10.1080/027249899391070 · Cited by 327
Entropy estimation of symbol sequences
Schürmann, T., & Grassberger, P. (1996) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.166191 · Cited by 319
Verdu, S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720531 · Cited by 316
The induction of dynamical recognizers
Pollack, J. B. (1991) · Machine Learning · doi:10.1007/bf00114845 · Cited by 294
A tutorial introduction to the minimum description length principle
Grunwald, P. (2004) · arXiv · doi:10.48550/arxiv.math/0406077 · Cited by 293
Thermodynamic cost of computation, algorithmic complexity and the information metric
Zurek, W. H. (1989) · Nature · doi:10.1038/341119a0 · Cited by 279
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
Trakhtenbrot, B. A. (1984) · IEEE Annals of the History of Computing · doi:10.1109/mahc.1984.10036 · Cited by 260
Randomness conservation inequalities; information and independence in mathematical theories
Levin, L. A. (1984) · Information and Control · doi:10.1016/s0019-9958(84)80060-1 · Cited by 256
Almost everywhere high nonuniform complexity
Lutz, J. H. (1992) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(92)90020-j · Cited by 254
On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural Numbers
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321526.321530 · Cited by 99
“Computers similar to them have been used in Solomono [11], Kolmogorov [12], and in [13].”
MethodSelf-citationDieguez, S., Wagner-Egger, P., & Gauvrit, N. (2015) · Psychological Science · doi:10.1177/0956797615598740 · Cited by 87
Schmidhuber, J. (2003) · Natural Computing Series · doi:10.1007/978-3-642-18965-4_23 · Cited by 65
Self-assembly, modularity, and physical complexity
Ahnert, S. E., Johnston, I. G., Fink, T. M. A., Doye, J. P. K., & Louis, A. A. (2010) · Physical Review E · doi:10.1103/physreve.82.026117 · Cited by 62
The nomological argument for the existence of God
Hildebrand, T., & Metcalf, T. (2022) · Noûs · doi:10.1111/nous.12364 · Cited by 38
On the improbability of algorithmic specified complexity
Ewert, W., Marks, R. J., & Dembski, W. A. (2013) · 45th Southeastern Symposium on System Theory · doi:10.1109/ssst.2013.6524962 · Cited by 11
Metadata
- Authors
- Chaitin, G. J.
- Venue
- Journal of the ACM
- Published
- 1969-01
- Volume
- 16
- Issue
- 1
- Pages
- 145-159
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2154462988
- Cited by
- 918
- References
- 14
- FWCI
- 10.00
- Type
- journal article
- Language
- en
- Open access
- bronze
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.