The "Notes" readings refer to our course reader, available here:
This schedule updates each week. For an overview of the whole quarter, refer to the Syllabus Handout:
The schedule is subject to change by the course staff at any time.
| Week | Monday | Wednesday | Friday |
|---|---|---|---|
| 1 |
June 22nd 00: Introduction, Set TheoryRead: Syllabus, Notes Ch. 1
Slides
|
June 26th 02: Indirect ProofsRead: Notes Ch. 2
Slides PSet 0 due Thursday at 11:59PM PSet 1 out |
|
| 2 |
July 1st 04: First-Order Logic I |
||
| 3 |
July 8th 06: Binary Relations IRead: Notes Ch. 5
Slides |
July 10th 07: Binary Relations IIRead: Handouts, Notes Ch. 6 PSet 2 due Thursday at 11:59PM PSet 3 out |
|
| 4 |
July 17th 10: Induction IRead: Notes Ch. 3
Slides |
||
| 5 |
July 22nd 12: Finite Automata IExam tomorrow: released at 9:30AM with a 24 hour start window and 3 hour time limit. |
July 24th 13: Finite Automata II |
|
| 6 |
July 27th 14: Regular Expressions |
July 29th 15: Non-Regular Languages |
July 31st 16: CFGs
Slides |
| 7 |
August 3rd 17: Turing Machines I |
August 5th 18: Turing Machines II |
August 7th 19: Unsolvable Problems
Slides
|
| 8 |
August 10th Review Session |
August 12th 20: Complexity Theory |
August 14th FINAL EXAM!
24 hour window to start opens at 8:30AM. 3 hour limit once started.
|