The Halting Problem

Automata as a warm-up, then Turing machines and the first great impossibility theorem of computation.

Topics on this path

1. Finite Automata (DFA & NFA)
2. Regular Expressions & Languages
3. Turing Machines
4. Church-Turing Thesis
5. Decidability & the Halting Problem