Turing-Machine

Mathematical model of computation which is build on Finite Automaton. It's more capable than the Push-Down Automaton.

Structure

Q: States
\Sigma: Input Alphabet
\Gamma: Symbols used on the storage medium (storage tape), which includes \Sigma
\delta: State transitions
q_0: Starting state
q_{reject}: Set of invalid states
q_{accept}: Set of accepting states