3-state Busy Beaver (most steps) (by T.Rado)

Comment: This TM produces 5 ones in 21 steps.
Comment: Taken (cited) from P.Michel

Constructed by $Id: hmBBsimu.awk,v 1.12 2010/07/06 19:46:42 heiner Exp $
State on
0
on
1
on 0 on 1
Print Move Goto Print Move Goto
A 1RB 1RH 1 right B 1 right H
B 1LB 0RC 1 left B 0 right C
C 1LC 1LA 1 left C 1 left A
Transition table
Simulation is done just simple.
The same TM with repetitions reduced.
The same TM with tape symbol exponents.
The same TM as 1-macro machine.
The same TM as 1-macro machine with pure additive config-TRs.

  Step Tpos St Tape contents
     0    0 A . . . 0
     1    1 B . . . 10
     2    0 B . . . 11
     3    1 C . . . 01
     4    0 A . . . 01
     5    1 B . . . 11
     6    2 C . . . 100
     7    1 C . . . 101
     8    0 C . . . 111
     9   -1 A . . .0111
    10    0 B . . .1111
    11    1 C . . .1011
    12    0 A . . .1011
    13    1 B . . .1111
    14    2 C . . .1101
    15    1 A . . .1101
    16    2 B . . .1111
    17    3 C . . .11100
    18    2 C . . .11101
    19    1 C . . .11111
    20    0 A . . .11111
    21    1 H . . .11111

After 21 steps (22 lines): state = H.
Produced     5 ones.
Tape index 1, scanned [-1 .. 3].
State Count Execution count First in step
on 0 on 1 on 0 on 1
A 6 5 1 0 20
B 6 1 5 1 2
C 9 4 5 6 3
Execution statistics

The same TM with repetitions reduced.
The same TM with tape symbol exponents.
The same TM as 1-macro machine.
The same TM as 1-macro machine with pure additive config-TRs.

To the BB simulations page of Heiner Marxen.
To the busy beaver page of Heiner Marxen.
To the home page of Heiner Marxen.
Tue Jul 6 22:12:32 CEST 2010