|
| Date
| Topic
| Reading
|
| 1 |
9/3 |
Administrativia & Introduction |
Ch 0 |
| 2 |
9/8 |
Finite automata |
§1.1 |
| 3 |
9/10 |
Regular languages |
§1.3 |
| 4 |
9/15 |
Nondeterministic finite automata |
§1.2 |
| 5 |
9/17 |
Regular languages vs finite automata |
§1.2-3 |
| 6 |
9/22 |
Nonregular languages |
§1.4 |
| 7 |
9/24 |
State reduction |
handout |
| 8 |
9/29 |
State minimization |
handout |
| 9 |
10/1 |
Turing machines |
§3.1 |
| 10 |
10/6 |
Church-Turing Thesis |
§3.2-3 |
| 11 |
10/8 |
Decidability |
§4.1 |
| 12 |
10/13 |
Halting problem |
§4.2 |
| 13 |
10/15 |
Reducibility |
§5.3, 6.3 |
| 14 |
10/20 |
Undecidable problems |
§5.1 |
| 15 |
10/22 |
Post's correspondence problem |
§5.2 |
| 16 |
10/27 |
Time complexity and the class P |
§7.1-2 |
| 17 |
10/29 |
The class NP |
§7.3 |
| 18 |
11/5 |
NP-completeness |
§7.4 |
| 19 |
11/10 |
Satisfiability |
§7.4,9.3 |
| 20 |
11/12 |
More on Satisfiability |
§7.4,9.3 |
| 21 |
11/17 |
Other NP-complete problems |
§7.5 |
| 22 |
11/19 |
Space complexity |
§8.1 |
| 23 |
11/24 |
The class PSPACE |
§8.2-3 |
| 24 |
12/1 |
The classes L and NL |
§8.4-6 |
| 25 |
12/3 |
Uses of randomness in computation |
§10.2 |
| 26 |
12/8 |
Interactive proof systems
| handout |
| 27 |
12/10 |
Zero-knowledge proof systems |
handout |
| 28 |
12/15 |
Wrap-up |
|
