COSC 4200
Computability and Complexity
University of Wyoming · UGRD · Fall 2026
1 section
Catalog description
Introduction to theoretical study of computability and efficient computation. Finite-state and pushdown automata; turing machines and the Church-Turing thesis; undecidability, computational complexity; NP-completeness.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #wyoming-1023Fall 2026UGRD3 credits
- 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?