CSE 6321
Computability and Complexity
Ohio State University-Lima Campus · UGRD · Fall 2026
1 section
Catalog description
Turing machines, decidability, recursive enumerability; many-to-one and polynomial-time reductions; NP-completeness, Cook-Levin Theorem; Recursion Theorem. Prereq: 3321 (625) or 5321. Not open to students with credit for 725.
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #ohio_lima_campus-CSE6321Fall 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?