CSCE 540 - Principles of the Theory of Computation

3 Credit(s). 0 Hour(s) Lab. 3 Hour(s) Lecture.

Classes of computable functions and recursion theory. Unsolvable and intractable problems. Deterministic and nondeterministic polynomial bounds on complexity; NP completeness. Abstract complexity theory.

Prereq: CMPS 440(G) and CSCE 500 or permission of instructor required