Models of Computation

Catalog description

A variety of models of computation, including variations on Turing machines, recursive and recursively enumerable sets, Markov algorithms, and vector machines. Explores a number of computational complexity classes as well as bounds on computability, including NP-completeness. Automata and generative grammars for the Chomsky hierarchy of language classes are also considered.