Turing Machine

Turing Machine

1. Definition

seven-tuple: $P=(Q,\Sigma,\Gamma,\delta,q_0,B,F)$
states, input symbols, tape symbols, transition fuctions, start state, blank symbol, final state

2. Language

The language accepted by TM is called recursively enumerable(RE) language.

3. Halt

We say a TM halts if it enters a state q, scanning a tape symbol X, and there is no move in this situation .