MATH 114C: Computability Theory
Lecture, three hours; discussion, one hour. Requisite: course 110A or 131A or Philosophy 135. 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.
Units unknown, upper division
Offered Winter quarters
- Predicted GPA
- 3.03
- A or A minus
- 33%
- D, F or withdrew
- 2%
- Sections
- Sections not published yet.
- By instructor
- Winter 2023 to Winter 2025
- All instructors
- 3.03 GPA
- 33% A
- 2% DFW
- 55 grades
- ARANT
- 2.99 GPA
- 33% A
- 2% DFW
- 55 grades
- Prerequisites
- Requisite: course 110A or 131A or Philosophy 135.
- Restrictions
- Not read yet
- Grading
- Not read yet
- Final exam
- Final time not published
What past students say
Read from 3 reviews, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Recommend
- 1 recommends it
- Teaching
- 2 say clear
- Exams
- 2 say hard
Each figure counts the reviews that say so. Most reviews skip most topics.