CECS 519 - Theory of Computation

(3 units)

Prerequisite: CECS 528 .
Advanced topics in computability theory and computational complexity theory. Topics include Turing Machines, coverage of the standard complexity classes P, NP, IP, and PSPACE, hierarchy, decidability, and recognizability theorems. Additional projects required for CECS 519.

Letter grade only (A-F). (Lecture-problems 3 hours). Double Numbered with: CECS 419