Library

ITM · Recursively enumerable

BB(2,4) champion

Two states, four symbols: 3,932,964 steps and 2,050 non-blank cells.

ABhalt
The machine as drawn — 3 states, 8 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 3,932,964 steps, leaving 2,050 non-blank cells.

Standard format1RB2LA1RA1RA_1LB1LA3RB1RZView on bbchallenge.org ↗

Notes

Standard format: 1RB2LA1RA1RA_1LB1LA3RB1RZ