Course Search

Use the filters below to find courses by subject area, general education attribute, or course level. You may also use the search bar to find courses by entering words in the subject area, title, or other criteria.

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.