Course Search
To filter and search by keywords in course titles, see the Course Search.
Courses by Subject Area
Click on the links below for a list of courses in that subject area. You may then click “View Classes” to see scheduled classes for individual courses.
3502. Theory of Computation
3.00 credits
Prerequisites: CSE 2050 or 2100; and 2500; open only to students in the School of Engineering, Cognitive Science majors, and declared Computer Science or Cognitive Science minors.
Grading Basis: Graded
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.
Last Refreshed: 26-APR-24 05.20.16.357506 AM
Term | Campus | Instruction Mode | Instructor | Section | Session | Schedule | Location | Enrollment | Notes | |
---|---|---|---|---|---|---|---|---|---|---|
1243 7232 1 001 | Spring 2024 | Storrs | In Person | Goldin, Dina | 001 | Reg | TuTh 5:00pm‑6:15pm |
MCHU 305 | 29/50 |