1,009
edits
Changes
Jump to navigation
Jump to search
Line 39:
Line 39: + +
Activities/Turtle Art/Tutorials/Turtle Art Turing Machine (view source)
Revision as of 23:19, 30 June 2011
, 23:19, 30 June 2011→The Structure of a Turing Machine: Origins 0 and 1
|3 ||2 ||6
|3 ||2 ||6
|}
|}
This table starts counting at 1. In programming it is often more convenient to start counting at 0. You will see examples of this practice if you examine the code for this Turing Machine.
In operation, the starting point is a given tape with a finite sequence of symbols prewritten on it, a given program, and the Turing Machine head over the leftmost symbol on the tape in state 1. At each step, the head reads the symbol in the current cell, then follows the instruction in the row corresponding to that symbol and the current state. There are three parts to the instruction:
In operation, the starting point is a given tape with a finite sequence of symbols prewritten on it, a given program, and the Turing Machine head over the leftmost symbol on the tape in state 1. At each step, the head reads the symbol in the current cell, then follows the instruction in the row corresponding to that symbol and the current state. There are three parts to the instruction: