Calendar
FALL 2008
August
26 Introduction, Chapter 0
28 Finite Automata and Regular Languages, Chapter 1
September
2
4 *
9
11 *
16 Push Down Automata and Context-Free Grammars, Chapter 2
18
23 *
25
30
October
2 *
FALL BREAK
14 Turing Machines and Unrestricted Languages, Chapter 3
16
21 The Halting Problem and Diagonalization, Chapter 4
23
28 Presentations
30
November
4 Reducibility and Advanced Topics in Computability, Chapters 5 & 6
6
11 Time Complexity, Chapter 7
13 *
18 Lambda Calculus - Barendregt
20
THANKSGIVING BREAK
December
2 *
4 Presentations
9 Last Day of Class
11-14 Reading Period
15 All work due by noon.