You are on page 1of 1

A nondeterministic Turing machine can be formally defined

as a 6-tuple , where

 Q is a finite set of states


 Σ is a finite set of symbols (the tape alphabet)
 is the initial state
 is the blank symbol
 is the set of accepting states
 is a relation on states and
symbols called the transition relation.