Syllabus (Fall 2009)

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 25 T CDM: The Idea      Misc      
2 Aug 27 H Register Machines    Cmp      
3 Sep 1 T Computability and Decidability    Cmp  
4 Sep 3 H More Models of Computation    Cmp      
5 Sep 8 T Complexity and Tractability      Cmp  
6 Sep 10 H Iteration and Orbits      Ind        
7 Sep 15 T Iteration and Computation      Ind          
8 Sep 17 H Finite State Machines      FSM         
9 Sep 22 T Constructing Machines      FSM    
10 Sep 24 H Minimization      FSM        
11 Sep 29 T Pattern Matching      FSM    
12 Oct 1 H Automata and Logic      FSM        
13 Oct 6 T Infinite Words      FSM    
14 Oct 8 H Cellular Automata      CA    
15 Oct 13 T Midterm (in house)            
16 Oct 15 H Infinite Words II      Comb        
17 Oct 20 T Generating Functions      Comb      
18 Oct 22 H Algebraic Structures      Alg      
19 Oct 27 T Semigroups and Groups      Comb    
20 Oct 29 H More Groups      Comb        
21 Nov 3 T Actions      Comb    
22 Nov 5 H Burnside and Polya  Alg       
23 Nov 10 T Finite Fields      Alg    
24 Nov 13 H Finite Fields II      CA       
25 Nov 17 T Feedback Shift Registers      Alg   
26 Nov 19 H Feedback Shift Registers, II      Log         
27 Nov 24 T Codes      Log        
28 Dec 1 T Codes II    Log    
29 Dec 3 H Computation and Physics      Log    
30 Dec - - Final    


The syllabus is globally stable but may change locally.


Staff