Alan Turing Solves the Halting Problem
In the 1930's, before the invention of the
general purpose digital computer, Alan
Turing proved by contradiction that halts? could not exist.
- Assume halts? exists.
- Then it must return #t or #f for any procedure
given it as an argument.