Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Paul Vitányi (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: