CSCE 540 - Principles of the Theory of Computation

3 Credit Hour(s)

3 Lecture Hour(s) 0 Lab Hour(s)
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 440G and CSCE 500 or permission of instructor required