CMPS 260 - Theoretical Foundations of Computer Science

3 cr.

(Prerequisite: CMPS 240)

An examination of the fundamental models and concepts of computation – automata, formal languages, and grammars – and how they are related. Church-Turing thesis; recursive and recursively enumerable sets; unsolvable problems; complexity of algorithms; Chomsky hierarchy.