Course Descriptions
CPS532 Theory of Computation
Computability by Turing machines, grammars, and recursive functions. Uncomputability and computational complexity.
Credits
- 3
Attributes
- Liberal Arts
Restrictions
- Must be enrolled in the following level: Graduate
Prerequisites
- Computer Science MS Prelim 1
