3502. Theory of Computation
3.00 credits
Prerequisites:
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:
To view current class enrollment click the refresh icon next to the enrollment numbers.
| Term | Class Number | Campus | Instruction Mode | Instructor | Section | Session | Schedule | Enrollment | Location | Credits | Grading Basis | Notes |
|---|