Write a Turing machine that adds two to a non-negative binary number?
So for example the binary representation for 5,
. . . b 1 0 1 b . . . .
becomes
. . . b 1 1 1 b . . . .
By writing a turing machine I mean a set of instructions, where each possible instruction is in the form of (a,b,c,d,e) where a is current state, b is the current item being viewed (0,1 or b) , c is what the current item is to be changed to (1,0 or b), d is the next state to be assumed and e is the next direction to move along the tape (r or l)