Note that assignments are not submitted, but rather students will regularly take turns in class demonstrating problems or theorems from the assignment. You should come prepared to class to present any part of the assignment on the day the assignment is listed.
Paul's H2P Cheat Sheet and CCT Cheat Sheet for easy reference.
| Class | Date | Reading | Topic | Assignment |
|---|---|---|---|---|
| 1 | Aug 24 | Syllabus | Syllabus, policies, business | Read the Syllabus |
| 2 | Aug 26 | H2P 1 | Sentential Logic | 1.1.7; 1.2.8,18; 1.3.6,8; 1.4.5,9; 1.5.3,9 |
| 3 | Aug 31 | H2P 2 | Quantificational Logic | 2.1.3,6; 2.2.2,3,7,9,10; 2.3.2,9,10,12,15 Proof Paper #1 Topic |
| 4 | Sep 2 | H2P 3.1-3.2 | Proofs | 3.1.2,15,16; 3.2.2,7,12 |
| 5 | Sep 7 | H2P 3.3-3.5 | More Proofs | 3.3.6,15,21; 3.4.6,13,22; 3.5.8,9,17,27,31 |
| 6 | Sep 9 | H2P 3.6-3.7 | More Proofs | 3.6.3,5,12; 3.7.5 |
| 7 | Sep 14 | CC 1-1.6 | Preliminaries | hw1.1,hw1.4,hw1.5,thm1.4*,thm1.5 |
| 8 | Sep 16 | CC 2-2.4 | Turing Machines | hw2.1,hw2.3(2-adic),thm2.1,thm2.2,thm2.3 |
| 9 | Sep 21 | CC 3.1-3.2 | Decision Problems | prop3.1, thm3.1 Proof Paper #1 |
| 10 | Sep 23 | CC 3.3-3.4 | Enumerable Sets | hw3.2,hw3.3,hw3.4,hw3.5,hw3.6,thm3.2,thm3.3,thm3.4 |
| 11 | Sep 28 | CC 3.5-3.6 | Halting Problem and S-m-n Theorem | thm3.5,lem3.2,thm3.6, hw3.7,hw3.8,thm3.7,thm3.9,hw3.9 |
| 12 | Sep 30 | CC 3.7 | Recursion | thm3.10,cor3.5,cor3.6,thm3.11,hw3.11,hw3.12 |
| 13 | Oct 5 | CC 3.8 | Rice's Theorems | thm3.12,cor3.7 Proof Paper #1 critique |
| 14 | Oct 7 | CC 3.9 | Reductions and Oracles | hw3.13,thm3.13,thm3.14,prop3.2,thm3.15 |
| 15 | Oct 12 | CC 3.9 | More Reductions and Oracles | def3.11,thm3.16,thm3.17,hw3.14 |
| 16 | Oct 14 | CC 4 | Complexity Intro | |
| 17 | Oct 19 | CC 5-5.1 | Linear Compression | hw5.1,thm5.1,cor5.1,thm5.2,cor5.2,cor5.3,thm5.3,cor5.4 |
| 18 | Oct 21 | CC 5.2 | Constructible Functions | hw5.2,hw5.3,hw5.4 Proof Paper #2 theorem statement |
| 19 | Oct 26 | CC 5.3 | Tape Reduction | hw5.5,hw5.6,thm5.5,thm5.7 |
| 20 | Oct 28 | CC 5.4 | Inclusion Relationships | thm5.8,thm5.9,cor5.6,thm5.10,cor5.7,thm5.11 |
| 21 | Nov 2 | CC 5.4 | More Inclusion Relationships | thm5.12,cor5.8,thm5.13,cor5.9,cor5.10 |
| 22 | Nov 4 | CC 5.5 | Separation Results | thm5.15,cor5.13,cor5.14,thm5.16,cor5.15,cor5.16 |
| Nov 9 | NO CLASS | |||
| Nov 11 | NO CLASS | Proof Paper #2 rough draft | ||
| 23 | Nov 16 | CC 5.6 | Translation and Padding | lem5.2,thm5.17,thm5.18,cor5.17,hw5.9,hw5.10 |
| 24 | Nov 18 | CC 5.7 | More Class Relationships | lem5.3,thm5.19,hw5.11 |
| Nov 23 | FALL RECESS | |||
| Nov 25 | FALL RECESS | |||
| 25 | Nov 30 | CC 6-6.3 | P and NP | hw6.1,thm6.1,cor6.1,hw6.2,thm6.2,thm6.3 |
| 26 | Dec 2 | CC 6.4-6.5 | NP-Completeness | hw6.3,thm6.4,hw6.5,thm6.5,hw6.6,thm6.6,hw6.7,hw6.8,thm6.8 Proof Paper #2 critique |
| 27 | Dec 7 | CC 6.6 | More NP-Completeness | hw6.11,hw6.12,thm6.10,thm6.11,thm6.12,hw6.14 |
| 28 | Dec 9 | CC 7-7.2 | NP-Hardness | hw7.2,hw7.3,thm7.1,thm7.2,thm7.3,cor7.1,thm7.4,prop7.2,thm7.5,cor7.2,cor7.3 |
| Dec 17 | 10:00 a.m.-12:00 p.m. | Proof Paper #2 Final Draft |
* When a theorem is listed under assignments, you should prepare to be able to teach that theorem to the class. Your goal should be to communicate to the class what the theorem says, some kind of intuition for it, why it is important, and why it is true. Note that we have a nice framework (logic and proof strategies) that will often be useful when doing this and you may use this framework and (obviously) the material in the CC text (as well as anything else you might find useful).
The schedule is subject to change. The final is Friday, Dec 17, 10:00 a.m.-12:00 p.m.
