4-state Busy Beaver (by A.Brady)

Comment: This TM produces 13 ones in 107 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 1LB 1 right B 1 left B
B 1LA 0LC 1 left A 0 left C
C 1RH 1LD 1 right H 1 left D
D 1RD 0RA 1 right D 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 <A 1
     3    -1  <B 1 1
     4    -2  <A 13
     5    -1  1 B> 13
     6    -2  1 <C 0 1 1
     7    -3  <D 1 0 1 1
     8    -2  1 D> 1 0 1 1
     9    -1  1 0 A> 0 1 1
    10     0  1 0 1 B> 1 1
    11    -1  1 0 1 <C 0 1
    12    -2  1 0 <D 1 0 1
    13    -1  1 1 D> 1 0 1
    14     0  1 1 0 A> 0 1
    15     1  1 1 0 1 B> 1
    16     0  1 1 0 1 <C
    17    -1  1 1 0 <D 1
    18     0  13 D> 1
    19     1  13 0 A>
    20     2  13 0 1 B>
    21     1  13 0 1 <A 1
    22     0  13 0 <B 1 1
    23    -1  13 <A 13
    24    -2  1 1 <B 14
    25    -3  1 <C 0 14
    26    -4  <D 1 0 14
    27    -3  1 D> 1 0 14
    28    -2  1 0 A> 0 14
    29    -1  1 0 1 B> 14
    30    -2  1 0 1 <C 0 13
    31    -3  1 0 <D 1 0 13
    32    -2  1 1 D> 1 0 13
    33    -1  1 1 0 A> 0 13
    34     0  1 1 0 1 B> 13
    35    -1  1 1 0 1 <C 0 1 1
    36    -2  1 1 0 <D 1 0 1 1
    37    -1  13 D> 1 0 1 1
    38     0  13 0 A> 0 1 1
    39     1  13 0 1 B> 1 1
    40     0  13 0 1 <C 0 1
    41    -1  13 0 <D 1 0 1
    42     0  14 D> 1 0 1
    43     1  14 0 A> 0 1
    44     2  14 0 1 B> 1
    45     1  14 0 1 <C
    46     0  14 0 <D 1
    47     1  15 D> 1
    48     2  15 0 A>
    49     3  15 0 1 B>
    50     2  15 0 1 <A 1
    51     1  15 0 <B 1 1
    52     0  15 <A 13
    53    -1  14 <B 14
    54    -2  13 <C 0 14
    55    -3  1 1 <D 1 0 14
    56    -2  1 0 A> 1 0 14
    57    -3  1 0 <B 1 0 14
    58    -4  1 <A 1 1 0 14
    59    -5  <B 13 0 14
    60    -6  <A 14 0 14
    61    -5  1 B> 14 0 14
    62    -6  1 <C 0 13 0 14
    63    -7  <D 1 0 13 0 14
    64    -6  1 D> 1 0 13 0 14
    65    -5  1 0 A> 0 13 0 14
    66    -4  1 0 1 B> 13 0 14
    67    -5  1 0 1 <C 0 1 1 0 14
    68    -6  1 0 <D 1 0 1 1 0 14
    69    -5  1 1 D> 1 0 1 1 0 14
    70    -4  1 1 0 A> 0 1 1 0 14
    71    -3  1 1 0 1 B> 1 1 0 14
    72    -4  1 1 0 1 <C 0 1 0 14
    73    -5  1 1 0 <D 1 0 1 0 14
    74    -4  13 D> 1 0 1 0 14
    75    -3  13 0 A> 0 1 0 14
    76    -2  13 0 1 B> 1 0 14
    77    -3  13 0 1 <C 0 0 14
    78    -4  13 0 <D 1 0 0 14
    79    -3  14 D> 1 0 0 14
    80    -2  14 0 A> 0 0 14
    81    -1  14 0 1 B> 0 14
    82    -2  14 0 1 <A 15
    83    -3  14 0 <B 16
    84    -4  14 <A 17
    85    -5  13 <B 18
    86    -6  1 1 <C 0 18
    87    -7  1 <D 1 0 18
    88    -6  A> 1 0 18
    89    -7  <B 1 0 18
    90    -8  <A 1 1 0 18
    91    -7  1 B> 1 1 0 18
    92    -8  1 <C 0 1 0 18
    93    -9  <D 1 0 1 0 18
    94    -8  1 D> 1 0 1 0 18
    95    -7  1 0 A> 0 1 0 18
    96    -6  1 0 1 B> 1 0 18
    97    -7  1 0 1 <C 0 0 18
    98    -8  1 0 <D 1 0 0 18
    99    -7  1 1 D> 1 0 0 18
   100    -6  1 1 0 A> 0 0 18
   101    -5  1 1 0 1 B> 0 18
   102    -6  1 1 0 1 <A 19
   103    -7  1 1 0 <B 110
   104    -8  1 1 <A 111
   105    -9  1 <B 112
   106   -10  <C 0 112
   107    -9  1 H> 0 112

After 107 steps (108 lines): state = H.
Produced     13 ones.
Tape index -9, scanned [-10 .. 3].
State Count Execution count First in step
on 0 on 1 on 0 on 1
A 30 18 12 0 2
B 30 13 17 1 5
C 17 1 16 106 6
D 30 14 16 7 8
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:32 CEST 2010