MTM · Recursively enumerable
3-tape adder — one pass
Adds two binary numbers (written LSB-first) in a single sweep: three synchronized heads, and the carry bit is the only state. The same job costs the 1-tape TM a lap per unit.
The author’s examples, run
1101,111,ε → accept11,11,ε → accept1,111,ε → accept