[MathJax on]

5 State

A turing state determines how a turing Machine acts upon reading a Symbol from the Tape.

There are two kinds of state: Regular states and Halting states. Halting states signal that the turing machine has halted.

gap> LoadPackage("turing");;
gap> q := TmState(1);
q1
gap> h := TmHalt(1);
h1
gap> IsTuringHaltState(q);
false
gap> IsTuringState(h);
true
gap> q = h;
false

5.1 Constructor

5.1-1 TmState

Returns: a turing state

This retuns a turing state that can be used in a Program.

5.1-2 TmHalt

Returns: a turing halting state

This retuns a turing state that can be used in a Program and signifies that the machine has halted..

generated by GAPDoc2HTML