|CSE Home||About Us||Search||Contact Info|
W 6:30-9:20 p.m. EE1 037
Grading: There will be weekly homework assignments and a final exam. Course grades will be based on roughly 2/3 on homework and 1/3 on the final exam although this could vary up to 5-7%.
Mailing List: There is a class mailing list, firstname.lastname@example.org. Follow the link in the left column on this page to sign up. Everyone is expected to be reading csep590tu e-mail to keep up-to-date on the course.
Final Exam TIME CHANGE:
Two hours on the evening of Wed Dec 10, 7:00-8:50 pm. Note that this is
different from the official exam schedule and has been agreed to without
objection by the class.
Suggestions or Comments? You can send comments to the instructor or TA using this anonymous feedback form
Catalog Description: Survey of the theory of computation including Turing Machines, Church's Thesis, computability, incompleteness, undecidability, complexity classes, problem reductions, Cook's theorem, NP-completeness, randomized computation, cryptography, parallel computation, and space complexity. Some emphasis will be placed on historical and philosophical aspects of the theory of computation.
Portions of the CSEP590TU Web may be reprinted or adapted for academic nonprofit purposes, providing the source is accurately quoted and duly credited. The CSEP590TU Web: © 1993-2003, Department of Computer Science and Engineering, University of Washington.