Turing machine Computation
The "total state" of the Turing machine: tape contents, tape head position,
initial tape contents are the input.
The tape head
position - e.g. on the leftmost non-blank (or anywhere if the tape is
an Instruction: At each step, any instruction that matches the current
state and currently read symbol can be executed. Executing an instruction
leads to a new configuration.
If no instruction applies, then the Turing machine halts.
The contents of the tape in the halting configuration
CS1104 Main Page
Last Updated 01/05/2000
© L.Heath, 2000