Syllabus (Fall 2008)

Home Syllabus Notes Computation Miscellany Gallery
cdm logo

CDM






Note that more information on many of the topics touched upon here can be found in the Notes section. It's probably a good idea to take a preemptive look.

L M D W Topic Slides Notes HW
1 Aug 26 T CDM: The Idea pdf  6up   Misc      
2 Aug 28 H Register Machines pdf  6up  Cmp hw1      
3 Sep 2 T Computability and Decidability pdf  6up  Cmp  
4 Sep 4 H More Models of Computation    Cmp      
5 Sep 9 T Complexity and Tractability      Cmp  
6 Sep 11 H Iteration and Orbits      Ind        
7 Sep 16 T Fixed Points      Ind          
8 Sep 18 H Finite State Machines      FSM           
9 Sep 23 T Minimization      FSM    
10 Sep 25 H Nondeterministic Machines      FSM        
11 Sep 30 T Pattern Matching      FSM    
12 Oct 2 H Infinite Words      FSM        
13 Oct 7 T Infinite Words II      FSM    
14 Oct 9 H Cellular Automata          CA    
15 Oct 14 T Midterm (in house)          
16 Oct 16 H Ranking and Unranking      Comb        
17 Oct 21 T Generating Functions      Comb      
18 Oct 23 H Semigroups and Groups      Alg      
19 Oct 28 T Moebius Inversion      Comb    
20 Oct 30 H Actions      Comb          
21 Nov 4 T Burnside and Polya      Comb    
22 Nov 6 H Finite Fields      Alg       
23 Nov 11 T Finite Fields II      Alg    
24 Nov 13 H Feedback Shift Registers      CA        
25 Nov 18 T Codes      Alg   
26 Nov 20 H Logic      Log         
27 Nov 25 T DPLL and Resolution      Log        
28 Dec 2 T Equational Reasoning      Log    
29 Dec 4 H Model Checking      Log    
30 Dec - - Final      


The syllabus is globally stable but may change locally.


Staff