Turing machine examples

The following are examples to supplement the article Turing machine. The following are examples to supplement the article Turing machine. The following table is Turing's very first example (Alan Turing 1937): With regard to what actions the machine actually does, Turing (1936) (Undecidable p. 121) states the following: He makes this very clear when he reduces the above table to a single instruction called 'b' (Undecidable p. 120), but his instruction consists of 3 lines. Instruction 'b' has three different symbol possibilities {None, 0, 1}. Each possibility is followed by a sequence of actions until we arrive at the rightmost column, where the final m-configuration is 'b': As observed by a number of commentators including Turing (1937) himself, (e.g., Post (1936), Post (1947), Kleene (1952), Wang (1954)) the Turing instructions are not atomic — further simplifications of the model can be made without reducing its computational power; see more at Post–Turing machine. As stated in the article Turing machine, Turing proposed that his table be further atomized by allowing only a single print/erase followed by a single tape movement L/R/N. He gives us this example of the first little table converted (Undecidable, p. 127):