On approximate uncomputability of the Kolmogorov complexity function

DOI10.1007/978-3-030-22996-2_20zbMATH Open1434.68209OpenAlexW2955446419MaRDI QIDQ2179366FDOQ2179366

Daniil Musatov, Ruslan Ishkuvatov

Publication date: 12 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22996-2_20

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cited In (3)

• Asymptotic density and the coarse computability bound
• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• Approximating Kolmogorov complexity

This page was built for publication: On approximate uncomputability of the Kolmogorov complexity function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2179366)