CS 5663
Computability and Decidability
Oklahoma State University · UGRD · Fall 2026
1 section
Catalog description
Description: Primitive and partial recursive functions. Equivalence of models of computation. The Halting problem and undecidability. Reducing one problem to another or representation change. Tractability and the P-NP problem. Complexity hierarchies.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #oklahoma_state-1908Fall 2026UGRD
- Days & times
- No scheduled meeting time
- Meeting dates
- —
- Location
- —
- Instructor
- Staff
Class numbers and section codes come from the registrar.
Spot missing or incorrect course data?