Demonstration of adding 3 on a Turing machine
The alphabet for my Turing machine consists of the symbols 0,1 and *, and the states of that are START, ADD, DOUBLE_CARRY, CARRY, DOUBLE_OVERFLOW, OVERFLOW, RETURN, and HALT.
All of the instructions are listed below.
START * * L ADD
ADD 1 0 L DOUBLE_CARRY
ADD 0 1 L CARRY
DOUBLE_CARRY 1 1 L CARRY
DOUBLE_CARRY 0 0 L CARRY
DOUBLE_CARRY * 0 DOUBLE_OVERFLOW
CARRY 1 0 L CARRY
CARRY 0 1 R RETURN
CARRY * 1 L OVERFLOW
DOUBLE_OVERFLOW (ignored) 1 L OVERFLOW
OVERFLOW (ignored) * R RETURN<