CS 3200
Theoretical Foundations of Computing
Wright State University-Main Campus · UGRD · Fall 2026
1 section
Catalog description
Introduction to the theory of formal languages and automata with an emphasis on the classes of languages commonly encountered by computer scientists. Computability examines the solution of decision problems; the Church-Turing thesis; the undecidability of the Halting Problem; and problem reduction and undecidability. Prerequisite(s): Undergraduate level CS 3100 Minimum Grade of C
Sections
Current meeting, instructor, credit, and enrollment details
001
Availability not recently verifiedClass #wright_main_campus-CS3200Fall 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?