Year: 2020
Type: article
Abstract: 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.
Source: Entropy
DOI: 10.3390/e22040408
Author: Paul M.B. Vitányi
Institutions: Centrum Wiskunde & Informatica, University of Amsterdam
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,690
OpenAlex ID: W3005820693