Catalog · Theory of Computation Lecture 5 of 25 Lecture 5: CF Pumping Lemma, Turing Machines ← Previous Lecture 4: Pushdown Automata, CFG ↔ PDA Next → Lecture 6: TM Variants, Church-Turing Thesis ✓ Mark complete Materials Transcript (PDF) ↗ transcript