Steam-powered Turing Machine University of Washington Computer Science & Engineering
 Syllabus for CSE531: Computability and Complexity
  CSE Home   About Us    Search    Contact Info 

CSE531: Computability and Complexity

Credits
3
Catalog description
Computational models including deterministic and nondeterministic Turing machines, and techniques for analyzing them. Fundamentals of computability theory and undecidability. Fundamentals of computational complexity theory and NP-completeness. .
Prerequisites
CSE majors only; CSE 322 or equivalent.
Textbook(s) and/or other required material
none
Course objectives
none
Topics covered
none
Course structure
none
Last edited by
none
Last modified
(never)

CSE logo Computer Science & Engineering
University of Washington
Box 352350
Seattle, WA  98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX
[comments to webmaint]