The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
An Introduction to Kolmogorov Complexity and Its Applications
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Both concepts are concerned with the minimum resources needed to create a single, specific artifact.”
From Understanding Agent Complexity Through Affordances (2025) · cites this paper as Li & Vitányi, 2008
In the citing paper
“In a loose sense, FunSearch attempts to find solutions that have low Kolmogorov complexity48–50 (which is the length of the shortest computer program that produces a given object as output), whereas traditional search procedures have a very different inductive bias.”
From Mathematical discoveries from program search with large language models (2024) · cites this paper as [49]
Citations
Cites
Hütter, M. (2008) · Scholarpedia · doi:10.4249/scholarpedia.2573 · Cited by 9
Li, M., & Vitanyi, P. M. B. (1993) · Springer eBooks · doi:10.1007/978-1-4757-3860-5_4 · Cited by 5
Self-citationJiang, T., Li, M., & Vitanyi, P. M. B. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44411-4_3 · Cited by 2
Self-citationLi, M., & Vitanyi, P. M. B. (2008) · Texts in computer science · doi:10.1007/978-0-387-49820-1_7 · Cited by 1
Self-citationLi, M., & Vitanyi, P. M. B. (2008) · Texts in computer science · doi:10.1007/978-0-387-49820-1_3 · Cited by 1
Self-citation
Cited by
A theoretically based index of consciousness independent of sensory processing and behavior
Casali, A. G., Gosseries, O., Rosanova, M., Boly, M., Sarasso, S., Casali, K. R., Casarotto, S., Bruno, M.-A., Laureys, S., Tononi, G., et al. (2013) · Science Translational Medicine · doi:10.1126/scitranslmed.3006294 · Cited by 1,246
Zipf’s word frequency law in natural language: A critical review and future directions
Piantadosi, S. T. (2014) · Psychonomic Bulletin & Review · doi:10.3758/s13423-014-0585-6 · Cited by 889
Quantum random number generators
Herrero-Collantes, M., & Garcia-Escartin, J. C. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.015004 · Cited by 791
(2011) · Cited by 675
Complexity in engineering design and manufacturing
ElMaraghy, W., ElMaraghy, H., Tomiyama, T., & Monostori, L. (2012) · CIRP Annals · doi:10.1016/j.cirp.2012.05.001 · Cited by 650
Metadata
- Authors
- Li, M., & Vitányi, P.
- Affiliations
- University of Waterloo (CA)
- ORCID
- Li, Ming
- Venue
- Texts in Computer Science
- Publisher
- Springer New York
- Published
- 2008
- ISSN
- 1868-0941 (ISSN-L)
- 1868-095X
- OpenAlex
- W2582697902
- Cited by
- 1,424
- References
- 5
- Citations by year
- 2026: 50 · 2025: 57 · 2024: 44 · 2023: 68 · 2022: 101 · 2021: 54 · 2020: 68 · 2019: 57 · 2018: 61 · 2017: 87 · 2016: 79 · 2015: 87 · 2014: 78 · 2013: 100 · 2012: 60
- FWCI
- 19.73
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Texts in computer science (publishedVersion)
- UvA-DARE (University of Amsterdam) (submittedVersion)
- DIAL (Catholic University of Leuven) (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory
- Keywords
- Kolmogorov complexity, algorithmic information theory, randomness, incompressibility, information theory, probability theory, computer science
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Introduction to Kolmogorov Complexity and Its Applications. https://app.cochat.ai/papers/10.1007/978-0-387-49820-1
- The paper
- Li, M., & Vitányi, P. (2008). An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science. https://doi.org/10.1007/978-0-387-49820-1
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.