Library

ITM · Recursively enumerable

BB(3) champion — most ones

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

Three states, 6 ones: Σ(3). A different machine from the one that runs longest.

Open in AutomataStudio
More
Open in the desktop app Download the .automaton file Source on GitHub
ABChalt
The machine as drawn — 4 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 14 steps, leaving 6 non-blank cells.

Standard format1RB1RZ_0RC1RB_1LC1LAView on bbchallenge.org ↗

Notes

Standard format: 1RB1RZ_0RC1RB_1LC1LA