Introduction to Theory of Computing

Catalog description

This course presents various models of computation and the relationships between these models and various classes of languages. Topics include: finite automata, regular languages, context-free languages, Turing machines, complexity and limits of algorithmic computation, new computation paradigms. These topics are used as a basis for exploring computability, complexity, and more advanced areas of theory.