| September 29 |
Introduction and Propositional Logic
Rosen 1.1
|
| October 1 |
Translation and Circuits
Rosen 11.3
|
| October 4 |
Equivalences
Rosen 1.2
|
| October 6 |
Boolean Algebra
Rosen 11.1
|
| October 8 |
Canonical Forms
Rosen 11.2
|
| October 11 |
Predicate Logic
Rosen 1.3-1.4
|
| October 13 |
Proofs for Propositional Logic
Rosen 1.5
|
| October 15 |
Proofs for Predicate Logic
Rosen 1.5
|
| October 18 |
English Proofs
Rosen 1.6-1.7
|
| October 20 |
Set Theory
Rosen 2.1-2.3
|
| October 22 |
Sets and Modular Arithmetic
Rosen 3.4
|
| October 25 |
Modular Arithmetic and Applications
Rosen 3.4
|
| October 27 |
Primes and GCD
Rosen 3.5
|
| October 29 |
Euclidian Algorithm and Modular Equations
Rosen p.277-9, p.231-5, p.226-7
|
| November 1 |
Modular Exponentiation and Induction
Rosen 4.1
|
| November 3 |
Strong Induction
Rosen 4.2
|
| November 5 |
Recursively Defined Functions
Rosen 4.3
|
| November 8 |
Recursively Defined Sets and Structural Induction
Rosen 4.3
|
| November 10 |
More Structural Induction
Rosen 4.3
|
| November 15 |
Regular Expressions (REs)
Rosen p.817-819
|
| November 17 |
Context-Free Grammars (CFGs)
Rosen 8.1, p.541-548
|
| November 19 |
Relations and Directed Graphs
Rosen 8.1, p.541-548
|
| November 22 |
Finite State Machines (FSMs)
|
| November 29 |
FSM Minimization and NFAs
|
| December 1 |
Relating DFAs, NFAs, and REs
|
| December 3 |
Limitations of DFAs, NFAs, and REs
|
| December 6 |
Cardinality and Uncomputability
|
| December 8 |
Undecidability of the Halting Problem
|
| December 10 |
Reductions and Turing Machines
|