Logical basis for information theory and probability theory
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
A new logical basis for information theory as well as probability theory is proposed, based on computing complexity.
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
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
A formal theory of inductive inference. Part I
Solomonoff, R. J. (1964) · Information and Control · doi:10.1016/s0019-9958(64)90223-2 · Cited by 1,192
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321495.321506 · Cited by 918
On the Length of Programs for Computing Finite Binary Sequences
Chaitin, G. J. (1966) · Journal of the ACM · doi:10.1145/321356.321363 · Cited by 913
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
Kolmogorov, A. N. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(98)00075-9 · Cited by 362
Self-citation
Cited by
Some Computer Organizations and Their Effectiveness
Flynn, M. J. (1972) · IEEE Transactions on Computers · doi:10.1109/tc.1972.5009071 · Cited by 1,713
Ullman, S. (1984) · Cognition · doi:10.1016/0010-0277(84)90023-4 · Cited by 1,027
Algorithmic Information Theory
Chaitin, G. J. (1977) · IBM Journal of Research and Development · doi:10.1147/rd.214.0350 · Cited by 982
Ladyman, J., Lambert, J., & Wiesner, K. (2013) · European Journal for Philosophy of Science · doi:10.1007/s13194-012-0056-8 · Cited by 846
Fractals and the analysis of waveforms
Katz, M. J. (1988) · Computers in Biology and Medicine · doi:10.1016/0010-4825(88)90041-8 · Cited by 826
The mutual information: detecting and evaluating dependencies between variables
Steuer, R., Kurths, J., Daub, C. O., Weise, J., & Selbig, J. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_2.s231 · Cited by 815
Model Selection and the Principle of Minimum Description Length
Hansen, M. H., & Yu, B. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753168398 · Cited by 788
Conformal Prediction: A Gentle Introduction
Angelopoulos, A. N., & Bates, S. (2023) · Foundations and Trends in Machine Learning · doi:10.1561/2200000101 · Cited by 740
Zvonkin, A. K., & Levin, L. A. (1970) · Russian Mathematical Surveys · doi:10.1070/rm1970v025n06abeh001269 · Cited by 665
A First Course in Information Theory
Yeung, R. W. (2002) · Information Technology: Transmission, Processing and Storage · doi:10.1007/978-1-4419-8608-5 · Cited by 533
The Importance of Complexity in Model Selection
Myung, I. J. (2000) · Journal of Mathematical Psychology · doi:10.1006/jmps.1999.1283 · Cited by 518
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
Complexity-based induction systems: Comparisons and convergence theorems
Solomonoff, R. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055913 · Cited by 388
Algorithmic randomness and physical entropy
Zurek, W. H. (1989) · Physical Review A · doi:10.1103/physreva.40.4731 · Cited by 364
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
Thermodynamic cost of computation, algorithmic complexity and the information metric
Zurek, W. H. (1989) · Nature · doi:10.1038/341119a0 · Cited by 279
E-values: Calibration, combination and applications
Vovk, V., & Wang, R. (2021) · The Annals of Statistics · doi:10.1214/20-aos2020 · Cited by 172
Untangling Brain-Wide Dynamics in Consciousness by Cross-Embedding
Tajima, S., Yanagawa, T., Fujii, N., & Toyoizumi, T. (2015) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1004537 · Cited by 76
Compression ensembles quantify aesthetic complexity and the evolution of visual art
Karjus, A., Canet Solà, M., Ohm, T., Ahnert, S. E., & Schich, M. (2023) · EPJ Data Science · doi:10.1140/epjds/s13688-023-00397-3 · Cited by 32
“Algorithmic complexity is best understood through the lens of algorithmic information theory (Kolmogorov 1968; Chaitin 1977) which defines the complexity of a dataset in terms of the shortest algorithm that reproduces the data.”
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
“Using conditional Kolmogorov complexity [6] we define algorithmic specified complexity (ASC) [5] as”
Method
Metadata
- Authors
- Kolmogorov, A.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1968-09
- Volume
- 14
- Issue
- 5
- Pages
- 662-664
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1978909760
- Cited by
- 592
- References
- 6
- FWCI
- 4.01
- Type
- journal article
- Language
- en
- Open access
- closed
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.