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 44O(G) and 5OO or permission of the instructor. Same as EECE 540.