Comment: This TM produces 25 ones in 255 steps.
| State | on 0 |
on 1 |
on 0 | on 1 | ||||
|---|---|---|---|---|---|---|---|---|
| Move | Goto | Move | Goto | |||||
| 1 | 21 | 5< | 1 | stay | 2 | 1 | left | 5 |
| 2 | 6> | 2> | 0 | right | 6 | 1 | right | 2 |
| 3 | 2> | *= | 0 | right | 2 | 1 | stay | * |
| 4 | 5> | 6< | 0 | right | 5 | 1 | left | 6 |
| 5 | 3> | 40 | 0 | right | 3 | 0 | stay | 4 |
| 6 | 41 | 1< | 1 | stay | 4 | 1 | left | 1 |
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 1>
1 2 1 1 2>
2 3 2 1 0 6>
3 5 1 1 0 <6 1
4 7 0 1 <6 12
5 8 -1 <1 13
6 10 0 1 2> 13
7 13 3 14 2>
8 14 4 14 0 6>
9 16 3 14 0 <6 1
10 18 2 14 <6 12
11 19 1 13 <1 13
12 20 0 12 <5 14
13 22 1 1 0 5> 14
14 30 5 1 05 5>
15 31 6 1 06 3>
16 32 7 1 07 2>
17 33 8 1 08 6>
>> Try to prove a PA-CTR with 2 Vars...
0 0 0 14+V(2) 01+V(1) 6>
1 2 -1 14+V(2) 01+V(1) <6 1
2 4+2*V(1) -2+-1*V(1) 14+V(2) <6 12+V(1)
3 5+2*V(1) -3+-1*V(1) 13+V(2) <1 13+V(1)
4 6+2*V(1) -4+-1*V(1) 12+V(2) <5 14+V(1)
5 8+2*V(1) -3+-1*V(1) 11+V(2) 0 5> 14+V(1)
6 16+4*V(1) 1 11+V(2) 05+V(1) 5>
7 17+4*V(1) 2 11+V(2) 06+V(1) 3>
8 18+4*V(1) 3 11+V(2) 07+V(1) 2>
9 19+4*V(1) 4 11+V(2) 08+V(1) 6>
<< Success! ==> defined new CTR 1 (PA)
18 35 7 1 08 <6 1
19 51 -1 1 <6 19
20 52 -2 <1 110
21 54 -1 1 2> 110
22 64 9 111 2>
23 65 10 111 0 6>
>> Try to prove a PPA-CTR with 1 Vars...
0 0 0 1 01+V(1) 6>
1 2 -1 1 01+V(1) <6 1
2 4+2*V(1) -2+-1*V(1) 1 <6 12+V(1)
3 5+2*V(1) -3+-1*V(1) <1 13+V(1)
4 7+2*V(1) -2+-1*V(1) 1 2> 13+V(1)
5 10+3*V(1) 1 14+V(1) 2>
6 11+3*V(1) 2 14+V(1) 0 6>
<< Success! ==> defined new CTR 2 (PPA)
23 65 10 111 0 6>
== Executing PA-CTR 1, V(1)=0, V(2)=7, repcount=3, factor=7/3
50 206 22 12 022 6>
51 208 21 12 022 <6 1
52 252 -1 12 <6 123
53 253 -2 1 <1 124
54 254 -3 <5 125
55 255 -2 3> 125
56 255 -2 3> 125 [would halt]
Lines: 31
Top steps: 30
Macro steps: 56
Basic steps: 255
Tape index: -2
ones: 25
log10(ones ): 1.398
log10(steps ): 2.407
Run state: would halt
Input to awk program:
gohalt 1
T 4-Tuple BB6 #1 of Machado/Pereira
4T 21 5< 6> 2> 2> *= 5> 6< 3> 40 41 1< : 25 255
gohalt 0
L 4
m 260
M 260
pref sim
machv 4BB6_1 just simple
machv 4BB6_1-r with repetitions reduced
machv 4BB6_1-1 with tape symbol exponents
machv 4BB6_1-m as 1-macro machine
machv 4BB6_1-a as 1-macro machine with pure additive config-TRs
iam 4BB6_1-a
mtype 1
mmtyp 3
r 1
H 1
mac 0
E 2
sympr
HM 1
date Tue Jul 6 22:11:24 CEST 2010
edate Tue Jul 6 22:11:24 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:11:24 CEST 2010