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

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

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
The same TM just simple.
The same TM with repetitions reduced.
The same TM with tape symbol exponents.
The same TM as 1-macro machine.
Simulation is done as 1-macro machine with pure additive config-TRs.

Pushing initial machine.
Pushing macro factor 1.

Steps             BasSteps              BasTpos  Tape contents
    0                    0                    0  A>
    1                    1                    1  1 B>
    2                    2                    0  1 <B 1
    3                    3                    1  C> 1
    4                    4                    0  <A 1
    5                    5                    1  1 B> 1
    6                    6                    2  1 0 C>
    7                    7                    1  1 0 <C 1
    8                    8                    0  1 <C 12
    9                    9                   -1  <A 13
   10                   10                    0  1 B> 13
   11                   11                    1  1 0 C> 12
   12                   12                    0  1 0 <A 12
   13                   13                    1  12 B> 12
>> Try to prove a PA-CTR with 2 Vars...
    0                    0                    0  11+V(1) B> 12+V(2)
    1                    1                    1  11+V(1) 0 C> 11+V(2)
    2                    2                    0  11+V(1) 0 <A 11+V(2)
    3                    3                    1  12+V(1) B> 11+V(2)
<< Success! ==> defined new CTR 1 (PA)
   13                   13                    1  12 B> 12
== Executing  PA-CTR  1, V(1)=1, V(2)=0, repcount=1, factor=1/1
   16                   16                    2  13 B> 1
   17                   17                    3  13 0 C>
   18                   18                    2  13 0 <C 1
   19                   19                    1  13 <C 12
   20                   20                    0  12 <A 13
   21                   21                    1  12 H> 13
   21                   21                    1  12 H> 13   [stop]

Lines:       21
Top steps:   19
Macro steps: 21
Basic steps: 21
Tape index:  1
ones:        5
log10(ones    ):    0.699
log10(steps   ):    1.322
Run state:   stop

The same TM just simple.
The same TM with repetitions reduced.
The same TM with tape symbol exponents.
The same TM as 1-macro machine.

To the BB simulations page of Heiner Marxen.
To the busy beaver page of Heiner Marxen.
To the home page of Heiner Marxen.
Input to awk program:
    gohalt 1
    T 3-state Busy Beaver (most steps) (by T.Rado)
    : 5 21
    C Taken (cited) from P.Michel
    5T  1RB 1RH  1LB 0RC  1LC 1LA
    L 6
    M	201
    pref	sim
    machv TM32_bbS  	just simple
    machv TM32_bbS-r	with repetitions reduced
    machv TM32_bbS-1	with tape symbol exponents
    machv TM32_bbS-m	as 1-macro machine
    machv TM32_bbS-a	as 1-macro machine with pure additive config-TRs
    iam	TM32_bbS-a
    mtype	1
    mmtyp	3
    r	1
    H	1
    mac	0
    E	2
    sympr	
    HM	1
    date	Tue Jul  6 22:12:32 CEST 2010
    edate	Tue Jul  6 22:12:32 CEST 2010
    bnspeed	1

Constructed by: $Id: tmJob.awk,v 1.34 2010/05/06 18:26:17 heiner Exp $ $Id: basics.awk,v 1.1 2010/05/06 17:24:17 heiner Exp $ $Id: htSupp.awk,v 1.14 2010/07/06 19:48:32 heiner Exp $ $Id: mmSim.awk,v 1.34 2005/01/09 22:23:28 heiner Exp $ $Id: bignum.awk,v 1.34 2010/05/06 17:58:14 heiner Exp $ $Id: varLI.awk,v 1.11 2005/01/15 21:01:29 heiner Exp $ bignum signature: LEN={S++:9 U++:9 S+:8 U+:8 S*:4 U*:4} DONT: y i o;
Start: Tue Jul 6 22:12:32 CEST 2010
Ready: Tue Jul 6 22:12:32 CEST 2010