How incomputable is Kolmogorov complexity?
Information Theory
2020-04-22 v2 Computational Complexity
math.IT
Abstract
Kolmogorov complexity is the length of the ultimately compressed version of a file (that is, anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the incomputabilty of Kolmogorov complexity, which formal loopholes this leaves us, recent approaches to compute or approximate Kolmogorov complexity, which approaches are problematic and which approaches are viable.
Cite
@article{arxiv.2002.07674,
title = {How incomputable is Kolmogorov complexity?},
author = {Paul Vitanyi},
journal= {arXiv preprint arXiv:2002.07674},
year = {2020}
}
Comments
9 pages LaTeX