CS 6160
Theory of Computation
Course Description
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.
Instructors
No instructors this semester
This course isn't being taught this semester. Try viewing the last 5 years.