Acceptance for Turing Machines is Undecidable, but Recognizable
8:08
Decidable iff Recognizable and co-Recognizable Proof
2:49:40
Turing Machines + Decidability in 3 Hours (TM, Variants, Church-Turing, Decidability)
9:00
Emptiness for Turing Machines is Undecidable
4:14
The Halting Problem: The Unsolvable Problem
1:17:02
8. Undecidability
1:45:01
Undecidability in 2 Hours (A_TM, Rice's Theorem, LBAs, EQ_CFG)
1:14:49
6. TM Variants, Church-Turing Thesis
1:25:25