TM · Recursively enumerable
Copy a string: w ↦ w#w
Each symbol of w is marked as copied (a becomes X, b becomes Y), carried to the end of the tape and written there; the separator is laid down by the first trip. At the end the marks are turned back into letters. Every copy costs a round trip, so the whole job takes time proportional to n².
The author’s examples, run
ε → acceptaabba → accepta → acceptaaaaaabba → accept
Behaviour
Halts from a blank tape after 1 steps, leaving 1 non-blank cells.