CS 581: Theory of Computation
3 credits
Text:
Sipser, Michael, Introduction to the Theory of Computation, second edition, PWS, 2005.
(The first edition is now out of print.)
Course Objectives:
 Introduce students to the classic results in theoretical computer science that classify problems according to the machines that can solve them and the resources required by those machines. This includes basic results relating to computable functions, decidability, and complexity theory.
 Master basic proof techniques used in these results including induction, diagonalization, and reduction.
 Illuminate the relationship between logic and computation.
Assumptions:
 Students have been exposed to the concepts of regular expressions, context free grammars, and programming in a general purpose language. They have applied these concepts to solve problems such as lexical analysis, parsing, and code generation.
 Students are familiar with discrete mathematics, including sets, sequences, induction and elementary graph theory.
Lectures: Subject to Change
 Course Overview & Mechanics (9/27) [Brian Huffman lecture]
 Review notation, set theory, proof, diagonalization
 Assignments 0 and 1 are given at the first lecture
 Regular Languages 1 (9/29) [Brian Huffman lecture]
 Definition, Closure properties, nondeterminism, regular expressions
 Regular Languages 2 (10/4)
 Equivalence of regular expressions and NFAs,
 Regular Languages 3 (10/6)
 Nonregular languages, Distinguishability
 Context Free Languages 1 (10/11)
 Myhill Nerode
 Context Free Languages
 CFL 2 (10/13)
 Equivalence of PDAs/CFGs
 Pumping lemma, applications
 Turing Machines 1 (10/18)
 PL for CFLs
 Introduction to Turing machines
 ChurchTuring hypothesis
 Multitape Turing machines
 Turing Machines 2 (10/20)
 Nondeterministic Turing machines
 Language Problems
 Undecidable problems exist
 Reduction 1 (10/25)
 Reduction
 Examples of reductions
 Midterm review
 Midterm (10/27)
 Reduction 2 (11/1)
 Computation Histories
 Post correspondence problem
 Relationship to logic
 Reduction 3 (11/3)
 Rice's theorem
 Primitive Recursive functions
 Recursion Theory 1 (11/8)
 Partial Recursive functions
 Equivilence of partial recursive functions and Turing machines
 Lambda calculus
 Recursion Theory 2 (11/10)
 Fixed points and recursion
 General recursion
 Programming systems
 Recursion Theory 3 (11/15)
 Pairing functions
 Smn theorem
 Recursion theorem for acceptable programming systems
 Recursion Theory 4 (11/17)
 Recursion theorem applications
 Recursion theorem corolaries (alternate formations)
 Logic: formulas, terms, sentences
 Logical theories
 Logic (11/22)
 Logic 2 (11/24)
 Representability
 Incompleteness
 Goedel's theorem
 Complexity 1 (11/29)
 Time and Space complexity
 The classes P and NP
 Ptime reduction
 Complexity 1 (12/1)
 NPcompleteness
 CookLevin theorem
 Final Exam
(12/6)
 Topics: Comprehensive, inclass exam.
1730  1920

