factual

Kolmogorov complexity is uncomputable

Kolmogorov complexity — the length of the shortest program that outputs a given string — is formally uncomputable because cycling through candidate programs runs into Turing's halting problem (one cannot generally tell whether a long-running program will ever halt), though it remains estimable in practice via compression algorithms like gzip.

factualpending

Speaker

Sean Carroll

Evidence Quote

“Komolgorov complexity is uncomputable for cool computer science reasons that go back to the halting problem of Alan Turing”

Source

320 | Solo: Complexity and the Universe— Sean Carroll's Mindscape
Created: 6/13/2026, 12:13:02 AM

Your notes

Loading notes...