MATH 5270 - Mathematical Theory of Computation

3 hours

Mathematical models of computation and algorithms, Church-Turing thesis, recursive functions, complexity measures, algorithm analysis, complexity classes and hierarchies, the P versus NP problem, NP-completeness.

Prerequisite(s): Consent of department.

Course specific fees (in addition to tuition and mandatory):
Academic (AF) per hour: $33.10