Turing Machine Example 2
Compute the function f(n) = n + 1.
To make this easy, let’s assume that n is represented on the tape in unary notation.
Tape alphabet = { 1, Blank }, States = { S0 }.
Transition function: “If the current tape symbol is 1, move right, leaving the symbol unchanged. If the current tape symbol is Blank, write a 1 and halt.”