Sep 8 
1 
Course Overview 

Sep 13 
2 
Deterministic Finite Automata 
1.1 
Sep 15 
3 
Nondeterministic Finite Automata 
1.2 
Sep 20 
4 
Regular Expressions 
1.21.4 
Sep 22 
5 
The Pumping Lemma 
1.21.4 
Sep 27 
6 
ContextFree Grammars 
2.1; 2.3 
Sep 29 
7 
The Pumping Lemma for CFLs 
2.1; 2.3 
Oct 4 
8 
Turing Machines 
3.13.2 
Oct 6 
9 
Turing Machine Variations 
3.23.3 
Oct 11 
10 
Decidability 
4.14.2 
Oct 13 
11 
Rice's Theorem 
5.3; problem 5.28 
Oct 18 
12 
Mapping Reductions 
5.15.3 
Oct 20 
13 
More Decidability 
5.15.3 
Oct 25 
14 
Time Complexity 
7.47.5 
Oct 27 
15 
The Class NP 
7.4 
Nov 1 
16 
NPCompleteness 
7.47.5 
Nov 3 
17 
More NPCompleteness 
7.47.5 
Nov 8 
18 
Time Complexity Wrapup 
7.3 
Nov 10 
19 
Space Complexity 
8.18.6 
Nov 15 
20 
PSPACE 
8.18.6 
Nov 17 
21 
PSPACECompleteness 
8.18.6 
Nov 22 
 
No Class 

Nov 24 
 
No Class — Happy Thanksgiving! 

Nov 29 
22 
Approximation Algorithms 
10.2 
Dec 1 
23 
More Approximation Algorithms 
10.2 
Dec 6 
24 
Interactive Proofs 
10.1 
Dec 8 
25 
ZeroKnowledge Proofs 

Dec 15 
 
Final Exam 
