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 
The same TM just simple.
The same TM with repetitions reduced.
Simulation is done 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  Tape contents
     0     0  <A
     1     1  1 B>
     2     0  1 <B 1
     3    -1  <A 1 1
     4     0  1 B> 1 1
     5    -1  1 <A 1 1
     6    -2  <A 2 1 1
     7    -1  1 B> 2 1 1
     8     0  1 0 A> 1 1
     9    -1  1 0 <A 2 1
    10     0  1 1 B> 2 1
    11     1  1 1 0 A> 1
    12     0  1 1 0 <A 2
    13     1  13 B> 2
    14     2  13 0 A>
    15     3  13 0 1 B>
    16     2  13 0 1 <B 1
    17     1  13 0 <A 1 1
    18     2  14 B> 1 1
    19     1  14 <A 1 1
+   23    -3  <A 24 1 1
    24    -2  1 B> 24 1 1
    25    -1  1 0 A> 23 1 1
    26     0  1 0 1 H> 2 2 1 1

After 26 steps (24 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 just simple.

The same TM with repetitions reduced.

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