HuskyScheduler
Open the scheduler
CSE 3502: Theory of Computation
Formal models of computation, such as finite state automata, pushdown automata, and Turing machines, and their corresponding elements in formal languages (regular, context-free, recursively enumerable). The complexity hierarchy. Church's thesis and undecidability. NP completeness. Theoretical basis of design and compiler construction.
- Credits
- 3
- Offered
- Spring 2027
- Campuses
- Storrs
- Requirements
- CSE 2050 or CSE 2100; CSE 2500; open only to students in the College of Engineering, Cognitive Science majors, and declared Computer Science or Cognitive Science minors.
Spring 2027 sections
Taught by Alexander Russell.
| Section | Type | Meets | Instructor | Campus | Room | Seats |
|---|---|---|---|---|---|---|
| 001 | LEC | 11:00AM - 12:15PM / TuTh | Alexander Russell | Storrs | ITE 336 | 5 of 35 open |
Seats as of Nov 12, 2026. HuskyScheduler shows live seats when you search.
More courses
All CSE courses (Computer Science and Engineering) ยท All UConn subjects