ITM · Recursively enumerable
Unary remainder: a mod b
Input 1ᵃ#1ᵇ; output 1^(a mod b). Each round crosses off b ones of a, pairing them one at a time with the ones of b; a completed round is subtraction, and b is restored for the next. When a runs out in the middle of a round, the ones crossed in that round are the remainder.
The author’s examples, run
#1 → accept1#11 → accept#11 → accept1#1111111 → accept11 → reject##11 → reject111 → reject##1111111 → reject
Behaviour
Halts from a blank tape after 1 steps, leaving 0 non-blank cells.