Q9Theory of Computation

A Turing Machine (TM) is a mathematical model consisting of an infinite tape, a tape head, and a finite control. It can read, write, and move the head in both directions. It is the recognizer for recursively enumerable languages.