Lectures

Lectures most closely follow the book Models of Computation by John E. Savage (JES). Another helpful resource may be Introduction to the Theory of Computation (Second Edition) by Michael Sipser (MS).

Date # Topic Chapters
Sep 7 1 Course Overview ---
Sep 12 2 Functions and Circuits I // Video JES: 1.4, 2
MS: 0.2
Sep 14 3 Circuits II // Video JES: 2
MS:
Sep 19 4 Finite-State Machines JES: 1.4, 3.1, 3.2
MS: 1.1
Sep 21 5 The Random-Access Machine (RAM) // Video JES: 3.4, 3.5, 3.6
MS:
Sep 26 6 The Turing Machine // Video JES: 3.7, 3.8, 3.9
MS: 3.1, 3.2
Extra Practice Problems
Sep 28 7 Nondeterminism // Video JES: 3.7
MS: 1.2, 3.2
Extra Practice Problems
Oct 3 8 Turing Machine Language Recognition // Video JES: 3.7, 5.1
MS: 3.1
Oct 5 9 Complexity Classes // Video JES: 3.9
MS: 7.2, 7.3, 7.4
Oct 10 10 First NP-Complete Language // Video JES: 3.8
MS: 7.4
Oct 12 11 Proving Problems NP-Complete JES: 3.9, 5.8
MS: 7.5
Extra Practice Problems
Extra Practice Problems
Oct 17 12 Equivalence Between FSMs and NFSMs JES: 4.2
MS: 1.2
Oct 19 13 In-Class Midterm ---
Oct 24 14 Regular Expressions JES: 4.3, 4.4
MS: 1.3
Extra Practice Problems
Oct 26 15 FSM Languages are Regular JES: 4.4
MS: 1.3
Oct 31 16 Chomsky Hierarchy JES: 4.9
MS: 2.1
Nov 2 17 Parsing Context-Free Languages JES: 4.11, 4.12, 4.13
MS: 2.1
Nov 7 18 Context-Free and Phrase Structure Languages JES: 4.9
MS: 2.1
Extra Practice Problems
Nov 9 19 Limits to Language Recognition JES: 5.7
MS: 4.1, 5.1
Extra Practice Problems
Extra Practice Problems
Nov 14 20 Computationally Hard Languages JES: 5.8
MS: 4.1, 4.2, 5.1, 5.2
Nov 16 21 Approximation Algorithms JES:
MS:
Extra Practice Problems
Nov 21 22 Space-Time Tradeoffs JES:
MS:
Nov 23 --- Thanksgiving ---
Nov 28 23 Memory Hierarchies JES:
MS:
Nov 30 24 P-Complete Problems JES:
MS:
Dec 5 25 Cryptography I JES:
MS:
Dec 7 26 Cryptography II JES:
MS:
Dec 14 --- Final (2pm, BioMed Center 291) ---