Formal Definition
A Turing Machine is a 3-tuple,
? is a finite set of states,
? is a finite tape alphabet, and
? is a transition function that specifies, for each ? ? ? and ? ? ?, a new tape symbol ?', a new state ?', and an action (one of Left, Right, Halt, Accept, or Reject).