TM · Recursively enumerable
Unary multiplication
Input 1ᵐ*1ⁿ; output 1ᵐ*1ⁿ#1ᵐⁿ. For each 1 of the first number the machine copies the whole second number to the end of the tape, one 1 per trip, marking what it has used with X and Y and restoring them afterwards. Multiplication as repeated addition, at walking pace.
The author’s examples, run
* → accept1*11 → accept*1 → accept111*11111 → accept1 → reject**11 → reject11 → reject*11*11111 → reject
Behaviour
Halts from a blank tape after 1 steps, leaving 0 non-blank cells.