The Science of Information: From Language to Black Holes Season 1 Episode 20 Uncomputable Functions and Incompleteness
- TV-PG
- December 11, 2015
- 30 min
Algorithmic information is plagued by a strange impossibility that shakes the very foundations of logic and mathematics. Investigate this drama in four acts, starting with a famous conundrum called the Berry Paradox and including Turing's surprising proof that no single computer program can determine whether other programs will ever halt.