Library

TM · Recursively enumerable

binary increment

@thethinkmachine·version 1·CC BY 4.0·added 28 Sept 2026

The textbook Deterministic Turing Machine example.

Open in AutomataStudio
More
Open in the desktop app Download the .automaton file Source on GitHub
rightincacc
The machine as drawn — 3 states, 6 transitions.

Behaviour

The first steps from a blank tape: one row per step, time running down; the outlined cell is the head.

Halts from a blank tape after 2 steps, leaving 1 non-blank cells.