TM · Recursively enumerable
Say every letter twice
ab becomes aabb. There is no room to insert a letter in place, so the machine builds the answer beyond a # at the right: for each letter, mark it, carry it to the end and write it twice. Then it wipes out the original and the # — what is left is the doubled word.
The author’s examples, run
ε → acceptaabba → accepta → acceptaaaaaabba → accept
Behaviour
Halts from a blank tape after 1 steps, leaving 0 non-blank cells.