Alan Turing · Mathematics
Turing’s proof that some problems can never be solved by any computer - the unsolvability of the Halting Problem - and how it settled a great question in the foundations of mathematics and revealed a permanent boundary to the mechanical.
You learned how Turing proved that some problems are uncomputable - the Halting Problem cannot be solved by any algorithm. Explain what the Halting Problem is, the idea of Turing’s proof, and why it shows a permanent limit to computation.
Leads to Russell.
Begin this lesson →epoché — a humanities education that remembers you.