MATH 114CComputability 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
- Winter 2026
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
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.
MATH 114C
- MATH 110AAlgebra
- MATH 115ALinear Algebra
- MATH 131AAnalysis
- PHILOS 135Introduction to Metalogic
- MATH 33ALinear Algebra and Applications
- PHILOS 31Logic, First Course
- PHILOS 132Logic, Second Course
3 direct requisites. Showing 18 courses over 3 levels; the branches marked with a count carry on past it. Every course here opens its own tree.
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.