The Turing Machine is a mathematical model of computation.

It is made on one hand of an infiniteReStRiCtEdAcCeSsdiscrete cell tape and on the other hand of a head that can read and write one tape cell at each time step. Each cell C has a number N. The head content an "internal state" S (SReStRiCtEdAcCeSs()/ApPaRtIeNt/{A,B,...}). For this visualization, only 2 symbols {0,1} are used in order to define the content of each cell. Let's assume that at time T the head is in state S(T) and is located over the cell C(N). Then S(T) and the symbol B=C(N) are defining S(T+1), the new content of C(N) (that can be unchanged) and at last the elementary translation of the head on the Right (N --> N+1) or on the Left (N --> N-1). At last there exists a special state "Halt" that means the end of the computation.

On this picture the vertical axis displays the time T (from T=0 -bottom- to T=NombreIterations -top-) and each time step uses 2 horizontal lines : the first one for the current tape content (dark grey : C(N)=0, light grey : C(N)=1) and the second one for the state S(T). On the bottom left corner, the NombreEtats+1 color squares display the code used for each possible state (S /ApPaRtIeNt/ {A,B,...} from left to right), the right one -white- being for the "Halt" state (both bold below).

At T=0, the "Current State" is 'A' and the "Bit Read" is 0 (bold below).