Course ID
009906
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)
Course Requisites
CSC 473.
Cross Listed Courses
May be convened with
Component
Lecture
Optional Component
No