MATH573
Download as PDF
MATH573 - Theory of Computation
Course Description
Chomsky hierarchy, undecidability; general recursive functions; recursion theory; computational complexity theory, NP-complete and provably intractable problems.
Min Units
3
Max Units
3
Repeatable for Credit
No
Grading Basis
GRD - Regular Grades A, B, C, D, E
Career
Graduate
Course Attributes
CE - CL (Cross Listed), GIDP - COGS (Cognitive Science)
Cross Listed Courses
May be convened with
Name
Lecture
Workload Hours
3
Optional Component
No
Typically Offered Main Campus
Spring