MATH 773
COMPUTABILITY THEORY
Turing degree and jump, strong reducibilities, arithmetic hierarchy, index sets, simple and (hyper)hypersimple sets, easy forcing arguments in computability theory, finite and infinite injury, Friedberg-Muchnik and Sacks Splitting Theorem, Sacks Jump and Sacks Density Theorems, computable ordinals. Familiarity with the topics in a basic Foundations course such as MATH 770 is strongly recommended.
Prerequisites & course information
Requisites: Graduate/professional standing or member of the Pre-Masters Mathematics (Visiting International) Program Course Designation: Grad 50% - Counts toward 50% graduate coursework requirement Repeatable for Credit: No Last Taught: Spring 2026
Sources
- Course catalogue ↗2026-2027