Founded in 1966

CS 2110: Theory of Computation

Description

This course deals with computability theory, automata theory and formal languages. Various models of computation will be examined, their relations to each other and their properties will be studied. Topics include models for computable functions and Church's thesis, models for recognizers and their relation to formal grammars, algorithmically solvable and insolvable problems, and the complexity of computations.

Suggested Course

CS 1511 or its equivalent.

You are using an older browser that does not support current Web standards. Although this site is viewable in all browsers, it will look much better in a browser that supports Web standards.