MATH 114C
Computability Theory
Mathematics · 4 units · Undergraduate upper division (100-199)
Effectively calculable, Turing computable, and recursive functions; Church/Turing thesis. Normal form theorem; universal functions; unsolvability and undecidability results. Recursive and recursively enumerable sets; relative recursiveness, polynomial-time computability. Arithmetical hierarchy.
P/NP or letter grading.
When it runs
Checking the Schedule of Classes…
Requisites
Official UCLA wording
Requisite: course 110A or 131A or Philosophy 135.
BruinTree reads · Prerequisite
confidence 1.00 · from textRequires
Everything that has to come before this course, not just the courses named in the requisite above.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
No course in the catalog lists this as a requisite.