Library

ITM · Recursively enumerable

one step left

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

The textbook Two-Way Infinite Turing Machine example.

Open in AutomataStudio
More
Open in the desktop app Download the .automaton file Source on GitHub
leftacc
The machine as drawn — 2 states, 3 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 1 steps, leaving 0 non-blank cells.