Turing Machines, Recursively Enumerable Languages and Type 0 Grammars
We have seen that a pushdown automaton can carry out computations which are beyond the capability of a finite automaton, which is perhaps the simplest sort of machine able to accept an infinite set of strings. At the other end of the scale of computational power is the Turing machine (after the English mathematician A. M. Turing, who devised them), which can carry out any set of operations which could reasonably be called a computation.
KeywordsTuring Machine Input String Empty String Input Tape Alphabet Symbol
Unable to display preview. Download preview PDF.