| Class Date | Material | Homework | Comments |
| 1/23 | Mendelson 1.1, 1.2, 2.1, 2.2 | Homework 1, Solutions | |
| 1/30 | Mendelson 1.1, 1.2, 2.1, 2.2 | Homework 2, Solutions | |
| 2/6 | Mendelson 1.4, 1.6, 2.3-2.7 | Homework 3 | Study for Test 1 Test 1 Review Review Solutions, Solutions to #5 |
| 2/13 | Test 1 | Notes on Induction | Office hours Tues Feb 12, 4-6p |
| 2/20 | Induction Computability/Turing machines - Epstein Ch. 9 |
Homework 4 | |
| 2/27 | Paradoxes Peano Arithmetic - Mendelson 3.1 Infinity - Epstein Ch. 6 |
Homework 5, Solutions | |
| 3/6 | Decidability | No Homework Test 2 Review, Solutions |
Fun Stuff: A proof, in the style of Dr. Seuss, that the halting problem is undecidable. Fetishes |
| 3/13 | --- | --- | Spring recess, no class. |
| 3/20 | Test 2 | Test 2 Solutions | Office Hours: Mon 3/18 4p |
| 3/27 | Codes | Homework 6, Solutions | |
| 4/3 | Error-correcting codes | Homework 7, Solutions Read xkcd on the number of Twitter messages |
Friday - last day for P/F or withdraw |
| 4/10 | Information Theory | Homework 8, Solutions | |
| 4/17 | Test 3 Shannon's Source Coding Theorem |
Test 3 Review, Solutions Homework 9 Test 3 Solutions |
Notes (not mine) |
| 4/24 | Review | Last class | |
| 5/1 | --- | --- | No class, but office hours during class time. |
| 5/8 | Final Exam ("in class") Wed 5/8 5:00p in LS 243 |