CSE 3502

Theory of Computation

University of Connecticut-Hartford Campus · UGRD · Fall 2026

1 section

Catalog description

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.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 7 hours ago

001

Availability not recently verified

Class #connecticut_hartford_campus-1142Fall 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?