Lecture Videos | Theory of Computation | Mathematics | MIT OpenCourseWare

Course Info

Instructor

Prof. Michael Sipser

Departments

As Taught In

Fall 2020

Level

Undergraduate
Graduate

Topics

Learning Resource Types

Lecture Videos

Problem Sets

Exams

Lecture Notes

Instructor Insights

Download Course

Lecture Videos

Lecture 1: Introduction, Finite Automata, Regular Expressions

Lecture 2: Nondeterminism, Closure Properties, Regular Expressions → Finite Automata

Lecture 3: Regular Pumping Lemma, Finite Automata → Regular Expressions, CFGs

Lecture 4: Pushdown Automata, CFG ↔ PDA

Lecture 5: CF Pumping Lemma, Turing Machines

Lecture 6: TM Variants, Church-Turing Thesis

Lecture 7: Decision Problems for Automata and Grammars

Lecture 8: Undecidability

Lecture 9: Reducibility

Lecture 10: Computation History Method

Lecture 11: Recursion Theorem and Logic

Lecture 12: Time Complexity

Lecture 14: P and NP, SAT, Poly-Time Reducibility

Lecture 15: NP-Completeness

Lecture 16: Cook-Levin Theorem

Lecture 17: Space Complexity, PSPACE, Savitch's Theorem

Lecture 18: PSPACE-Completeness

Lecture 19: Games, Generalized Geography

Lecture 20: L and NL, NL = coNL

Lecture 21: Hierarchy Theorems

Lecture 22: Provably Intractable Problems, Oracles

Lecture 23: Probabilistic Computation, BPP

Lecture 24: Probabilistic Computation (cont.)

Lecture 25: Interactive Proof Systems, IP

Lecture 26: coNP ⊆ IP

Course Info

Instructor

Prof. Michael Sipser

Departments

As Taught In

Fall 2020

Level

Undergraduate
Graduate

Topics

Learning Resource Types

Lecture Videos

Problem Sets

Exams

Lecture Notes

Instructor Insights

Download Course

MIT Open Learning

Over 2,500 courses & materials

Freely sharing knowledge with learners and educators around the world. Learn more

© 2001–2024 Massachusetts Institute of Technology

Accessibility

Creative Commons License

Terms and Conditions

Proud member of:

© 2001–2024 Massachusetts Institute of Technology