Catalog · Theory of Computation Lecture 12 of 25 Lecture 12: Time Complexity ← Previous Lecture 11: Recursion Theorem and Logic Next → Lecture 14: P and NP, SAT, Poly-Time Reducibility ✓ Mark complete Materials Transcript (PDF) ↗ transcript