CSCE 540 - Principles of the Theory of Computation

Credit Hours: 3
Lecture Contact Hours: 3 Lab Contact Hours: 0

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

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