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

1 
Apr 6th 00: Can computers solve all problems? Set theory and the limits of computingRead: Syllabus, Course Information Sheet, Notes Ch. 1

Apr 8th 01: How can we prove results with certainty?Read: Notes Ch. 2

Apr 10th 02: How do we prove something without directly proving it?Read: Notes Ch. 2

2 
Apr 13th 03: How can we formalize our reasoning?Read: related handout

Apr 15th 04: How can we reason about collections of objects?Read: related handout 
Apr 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 28th 21: Turing Machines IIRead: Sipser 3.1
Slides 

9  
10 
Mar 13th No classRead: Study for the final


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