2-state 3-symbol contender (cited from P.Michel) 

Comment: This TM produces 6 nonzeros in 26 steps.

Constructed by $Id: hmBBsimu.awk,v 1.12 2010/07/06 19:46:42 heiner Exp $
State on
0		 on
1		 on
2		 on 0 on 1 on 2
Print Move Goto Print Move Goto Print Move Goto
A 1RB 2LA 1RH 1 right B 2 left A 1 right H
B 1LB 1LA 0RA 1 left B 1 left A 0 right 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 2-macro machine.
The same TM as 2-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 A . . .011
     4    0 B . . .111
     5   -1 A . . .111
     6   -2 A . . 0211
     7   -1 B . . 1211
     8    0 A . . 1011
     9   -1 A . . 1021
    10    0 B . . 1121
    11    1 A . . 1101
    12    0 A . . 1102
    13    1 B . . 1112
    14    2 A . . 11100
    15    3 B . . 111010
    16    2 B . . 111011
    17    1 A . . 111011
    18    2 B . . 111111
    19    1 A . . 111111
    20    0 A . . 111211
    21   -1 A . . 112211
    22   -2 A . . 122211
    23   -3 A . .0222211
    24   -2 B . .1222211
    25   -1 A . .1022211
    26    0 H . .1012211

After 26 steps (27 lines): state = H.
Produced     6 nonzeros.
Tape index 0, scanned [-3 .. 3].
State Count Execution count First in step
on 0 on 1 on 2 on 0 on 1 on 2
A 16 8 7 1 0 5 25
B 10 2 4 4 1 2 7
Execution statistics 

The same TM with repetitions reduced.

The same TM with tape symbol exponents.

The same TM as 2-macro machine.

The same TM as 2-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:33 CEST 2010