CPSC 4200 - Automata, Complexity, and Computability

(3) Credit Hours

An introduction to the classical and contemporary theory of computation including automata, formal languages, Turing machines, recursive functions, computability and in computability, complexity, and the classes of P and NP. Prerequisites: CPSC 1110 and MATH 2030 or MATH 3030 with minimum grades of C or department head approval. Differential course fee will be assessed.