How incomputable is Kolmogorov complexity?
Entropy , Volume 22 - Issue 4 p. 408
Kolmogorov complexity is the length of the ultimately compressed version of a file (i.e., 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 incomputability of Kolmogorov complexity, which formal loopholes this leaves us with, recent approaches to compute or approximate Kolmogorov complexity, which approaches are problematic, and which approaches are viable.
|Organisation||Centrum Wiskunde & Informatica, Amsterdam, The Netherlands|
Vitányi, P.M.B. (2020). How incomputable is Kolmogorov complexity?. Entropy (Vol. 22). doi:10.3390/E22040408