CSE 555 Spring 2013 
Theory of Computation

CSE 555 is an advanced (second) course in the theory of computation. It assumes knowledge of a standard first course covering finite automata, regular expressions, and regular languages; pushdown automata, context-free grammars, and context-free languages; Turing machines, Turing-recognizable (recursively enumerable) languages, and Turing-decidable (recursive) languages; the Church-Turing thesis; and undecidability. With this background, CSE 555 covers reducibility for computable problems; the recursion theorem; time complexity (including P, NP, NP-complete, PSPACE, PSPACE-complete, EXPTIME); and space complexity.

Students are expected to have formal (mathematical) background in the introduction to the theory of computation (CSE 355 at ASU).

Course
Information:
CSE 555:  Theory of Computation  
http://www.public.asu.edu/~ccolbou/src/cse555s13.html
Class Meeting Time:
    T Th 12:00-1:15 

    BY M1-09

Instructor: 
 

Office Hours:

TA: 
 

Office Hours:

    Mike Bartholomew
    Office:  Brickyard 511 (for office hour) 
    mjbartho@asu.edu
    W 2:00-3:00, F 2:00-3:00
Prerequisites:
Introduction to the Theory of Computation.
Special Needs: If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course. 
Academic Honesty: Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While you are welcome to discuss problems with others, it is not acceptable to discuss solutions with them. If in doubt about anything related to academic integrity, see the instructor.
TextBooks:
Required Text: Michael Sipser, Introduction to the Theory of Computation, Third Edition, Thomson, 2012.