CSC 554 Theory of Computation (4045) (3 credits)

Formal languages, formal grammars, abstract machines; models of computation (e.g. Turing machines); computational complexity (NP completeness); undecideability and uncomputability.

Prerequisite: CSC 500 Discrete Structures.