CoChat

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

Li, Ming, Vitányi, Paul · 2008 · Texts in Computer Science

Overview

Integrity signals

Registry

Crossref · 10.1007/978-0-387-49820-1

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 5 references

Cited by

See all 1,424

Metadata

Authors
Li, M., & Vitányi, P.
Affiliations
University of Waterloo (CA)
Venue
Texts in Computer Science
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
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.