Edit page
Graduate & Extended Learning
Course Listings

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
  • Students cannot elect the Satisfactory/Unsatisfactory grade option for this course

Prerequisites

  • Computer Science MS Prelim 1

Back to course list