CS 6160
Theory of Computation
Course Description
Pre-Requisite(s):
CS 3102 or equivalent
Analyzes formal languages, the Chomsky hierarchy, formal computation and machine models, finite automata, pushdown automata, Turing machines, Church's thesis, reductions, decidability and undecidability, and NP-completeness.
Looks like this course isn't being taught this semester.
Sort by "All" in the top right to see previous semesters.
