The schedule is subject to change by the management at any time.
Week  Monday  Wednesday  Friday 

1 
Jan 6th 00: Can computers solve all problems? Set theory and the limits of computingRead: Syllabus, Course Information Sheet, Notes Ch. 1 
Jan 8th 01: How can we prove results with certainty?Read: Notes Ch. 2
Slides

Jan 10th 02: How do we prove something without directly proving it?Read: Notes Ch. 2
Slides 
2 
Jan 13th 03: How can we formalize our reasoning?Read: related handout 
Jan 15th 04: How can we reason about collections of objects?Read: related handout 
Jan 17th 05: How do we rigorously define key terms?Read: (see handouts from Mon and Wed) 
3 
Jan 20th MLK Jr. Holiday
No class Monday 
Jan 24th 07: What does it mean to compare two objects?Read: Handouts, Notes Ch. 6
Slides 

4 
Jan 29th 09: How do we reason about infinity?Read: Handout, Notes Ch. 6 

5 
Feb 7th 13: Induction Pt. 2Read: Notes Ch. 3, Handout
Slides 

6 
Feb 14th 16: Automata III: Equivalence, ClosureRead: Sipser 1.2 Slides Parts 1, 2, 3. Review Session Slides. 

7 
Feb 17th President's Day Holiday
No class Monday 

8 
Feb 24th 19: CFGsRead: Sipser 2.1

Feb 26th 20: Turing MachinesRead: Sipser 3.1

Feb 28th 21: Turing Machines IIRead: Sipser 3.1

9 
Mar 2nd 22: Turing Machines IIIRead: Sipser 4.14.2, 6.1

Mar 4th 23: Unsolvable ProblemsRead: Sipser 4.14.2, 6.1

Mar 6th 24: Unsolvable Problems IIRead: n/a

10 
Mar 9th 25: Complexity Theory IRead: Sipser 7.2, 7.3

Mar 11th 26: Complexity Theory IIRead: Sipser 7.4

Mar 13th No classRead: Study for the final

Mar 17th FINAL TUES MAR 17th 8:3011:30AM 