Approximating Kolmogorov complexity
- DOI
- 10.3233/com-200302
- Published
- 2023-09-21
- Container
- Computability
- Publisher
- SAGE Publications
- Open access
- unknown
Credibility signals
uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.
Show all credibility signals
- supportingDOI registered: A matching record was returned by Crossref.
- supportingDOI resolves: A matching record was returned by Crossref.
- not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility.
- not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made.
- not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made.
- not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made.
- not scoredROR affiliation: Not checked or no result supplied; no credibility inference made.
- not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete.
- not scoredOpen access status: Not checked or no result supplied; no credibility inference made.
- not scoredPublication license: Not checked or no result supplied; no credibility inference made.
- not scoredPublication version: A publication version was supplied but is not scored.
- supportingMetadata completeness: All 6 scored descriptive metadata groups are present.
Cite this work
BibTeX
@article{allodium:10.3233/com-200302,
title = {Approximating Kolmogorov complexity},
author = {Ruslan Ishkuvatov and Daniil Musatov and Alexander Shen},
year = {2023},
journal = {Computability},
doi = {10.3233/com-200302},
url = {https://doi.org/10.3233/com-200302}
}RIS
TY - JOUR TI - Approximating Kolmogorov complexity AU - Ruslan Ishkuvatov AU - Daniil Musatov AU - Alexander Shen PY - 2023 JO - Computability DO - 10.3233/com-200302 UR - https://doi.org/10.3233/com-200302 ER -
APA
Ishkuvatov, R., Musatov, D., & Shen, A. (2023). Approximating Kolmogorov complexity. Computability. https://doi.org/10.3233/com-200302
Source records
- crossref · retrieved 2026-11-10T05:35:15.018Z