CSC I2200
Theory of Computability
CUNY City College · UGRD · Fall 2026
1 section
Catalog description
Formulations of effective computability: Sheperdson-Sturgis machines. Turing type models, recursive functions, and semi-Thue systems. The equivalence of the various formulations. ChurchÆs Thesis. Fundamental theorems of computability: universal machines, S-M-N, and recursion theorem. Unsolvable problems. Recursive and r.e. sets.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #cuny_city-CSCI2200Fall 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?