ITM · Recursively enumerable
A binary counter that never stops
It counts in binary on its tape, so its blocks double in width and its run never repeats — the classic shape no cycle detector can settle. The finite automata reduction proves it: it finds a regular language that contains every configuration from which the machine could halt and is closed under stepping backwards, and the blank tape is not in it.
Behaviour
Never halts from a blank tape. Proven: finite automata reduction — an automaton recognises every way to halt, and not the start.