Introduction to the
theory of Computation

CSE237, Fall 2007

 
 

CSE 237: Introduction to the Theory of Computation


  1. •Instructor

  2. •Alexander Russell

  3. •Office: ITEB 241

  4. •Office Hours: Monday 3:15-4:45pm and by appointment

  5. •Course meeting time & place

  6. •Course meeting time: Tuesday and Thursday 2-3:15pm

  7. •Course meeting location: ITEB 127

  8. •Textbook Introduction to the Theory of Computation, by Michael Sipser

Course Syllabus


  1. •Part I: Automata Theory

  2. •Regular languages and finite automata

  3. •Context-free languages and pushdown automata

  4. •Part II: Computability Theory

  5. •Turing machines

  6. •Recursive and recursively enumerable languages

  7. •Diagonalization and simulation

  8. •Many-one reductions and completeness

  9. •Part III: Complexity Theory

  10. •Time-bounded computation

  11. •The classes P and NP

  12. •Reductions and NP-completeness