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
On the concept of a random sequence
Church, A. (1940) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1940-07154-x · Cited by 390
Foundations of Information Theory
Feinstein, A., & Weiss, G. (1958) · Physics Today · doi:10.1063/1.3062338 · Cited by 308
A Universal Turing Machine with Two Internal States
Shannon, C. E. (1956) · Automata Studies. (AM-34) · doi:10.1515/9781400882618-007 · Cited by 184
Probability, Statistics and Truth.
White, M., & Mises, R. V. (1941) · The Philosophical Review · doi:10.2307/2181018 · Cited by 112
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
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.