Turing Machine

Natural & Formal Sciences Dictionary
Definition
An abstract model of computation consisting of an infinite (or unbounded) tape divided into cells, a read/write head that moves left or right, a finite set of states, and a transition function that maps (current state, current symbol) to (next state, symbol to write, head move).