|
|
CSCI (Math) 361
|
During the course of the term we will be covering 8 chapters from Jones as well as most of Chapters 1 through 3 (and a bit more) from Lewis and Papadimitriou. Because we are experimenting with a new approach, the schedule presented at the beginning of the term is likely to be only an approximation to the actual schedule. I will continue to update the schedule during the term to reflect our actual progress. "J: nn" refers to sections from Jones, while "L-P nn" refers to sections from Lewis and Papadimitriou.
| Date | Topic | Reading | Exams |
| Sept. 6 | Overview, computability | J: 1.1-1.3, L-P: 1.1-1.3 | |
| Sept. 9 | Countable sets | J: 1.4-1.6, L-P 1.4 | |
| Sept. 11 | diagonalization, Undecidability preview | L-P: 1.5 | |
| Sept. 13 | While language | J: 2.1 | |
| Sept. 16 | More While language | J: 2.2 | |
| Sept. 18 | While language semantics | J: 2.2 | |
| Sept. 20 | Case and equality | J: 2.3-2.4 | |
| Sept. 23 | Programs as data: compilers | J: 3.1-3.3 | |
| Sept. 25 | Compilers and interpreters | J: 3.4, 3.5, 3.7 | |
| Sept. 27 | Self-interpretation: universal programs | J: 4 | |
| Sept. 30 | Computability | J: 5.1, 5.3 | |
| Oct. 2 | Rice's Theorem | J: 5.4 | |
| Oct. 4 | No class | ||
| Oct. 7 | Decidable and semi-decidable sets | J: 5.5-5.7 | |
| Oct. 9 | Catch-up | ||
| Oct. 11 | Alphabets, & Languages | L-P: 1.7 | |
| Oct. 14 | Reading Period | ||
| Oct. 16 | Languages and Regular Expressions | L-P: 1.8 | |
| Oct. 18 | Mountain Day | ||
| Oct. 21 | Deterministic Finite Automata | L-P: 2.1 | Midterm 1 out |
| Oct. 23 | Nondeterministic Finite Automata | L-P: 2.2 | |
| Oct. 25 | Equivalence of DFAs & NDFAs | L-P: 2.2 | |
| Oct. 28 | Closure properties of finite automata | L-P: 2.3 | |
| Oct. 30 | Finite Automata & Regular Expressions | L-P: 2.3 | |
| Nov. 1 | Pumping Lemma for Finite Automata | L-P: 2.4 | |
| Nov. 4 | Minimization & Simplification | L-P: 2.5 | |
| Nov. 6 | Context-Free Grammars | L-P: 3.1 | |
| Nov. 8 | Parse trees | L-P: 3.2 | |
| Nov. 11 | Catch-up and Review for Exam | ||
| Nov. 13 | Pushdown Automata | L-P: 3.3 | Midterm 2 out |
| Nov. 15 | Properties of CFG's | L-P: 3.5 | |
| Nov. 18 | PDAs & CFGs | L-P: 3.4 | |
| Nov. 20 | Parsing & CFG’s | L-P: 3.7 | |
| Nov. 22 | Other models of computation | J: 7, L-P: 4 | |
| Nov. 25 | Church-Turing thesis | J: 8, L-P: 5.1 | |
| Dec. 2 | Unsolvable Problems about grammars | L-P: 5.5 | |
| Dec. 4 | More unsolvable grammar problems | L-P: 5.5 |