L15: Proof by Diagonalization that ATM (Halting Problem) is Not Decidable
53:51
L17: Using Reductions to Prove Language Undecidable
1:21:10
L19: Uncomputable Functions, and Introduction to Complexity
1:13:16
L13: Diagonalization, Countability and Uncountability
40:08
L16: Unrecognizable Languages and Reductions
51:46
Linear-time pattern matching. Z-values and Z-algorithm
6:14
Turing & The Halting Problem - Computerphile
1:19:07
L12: Universal Turing Machines; The Halting Problem is Recognizable but Not Decidable
7:58