Comment: This TM produces 164 ones in 23197 steps.
| State | on 0 |
on 1 |
on 0 | on 1 | ||||
|---|---|---|---|---|---|---|---|---|
| Move | Goto | Move | Goto | |||||
| 1 | 21 | 7< | 1 | stay | 2 | 1 | left | 7 |
| 2 | 71 | 3> | 1 | stay | 7 | 1 | right | 3 |
| 3 | 6> | 40 | 0 | right | 6 | 0 | stay | 4 |
| 4 | 2> | 4> | 0 | right | 2 | 1 | right | 4 |
| 5 | 11 | 3< | 1 | stay | 1 | 1 | left | 3 |
| 6 | 50 | *= | 0 | stay | 5 | 1 | stay | * |
| 7 | 4> | 5< | 0 | right | 4 | 1 | left | 5 |
The same TM just simple.
The same TM with repetitions reduced.
The same TM with tape symbol exponents.
The same TM as 2-macro machine.
Simulation is done as 2-macro machine with pure additive config-TRs.
Pushing initial machine.
Pushing macro factor 2.
Steps BasSteps BasTpos Tape contents
0 0 0 1>
1 3 2 10 6>
2 6 1 10 <7 10
3 7 2 10 4> 10
4 9 4 102 2>
5 11 3 102 <5 10
6 17 -1 <5 112 10
7 21 0 01 4> 112 10
8 25 4 01 112 4> 10
9 27 6 01 112 10 2>
10 29 5 01 112 10 <5 10
11 32 3 01 112 <5 11 10
12 36 4 01 11 01 3> 11 10
13 39 6 01 11 012 3> 10
14 45 5 01 11 012 <7 11
15 51 1 01 11 <7 113
16 53 -1 01 <3 114
17 55 0 2> 114
18 67 8 104 2>
19 69 7 104 <5 10
20 81 -1 <5 114 10
21 85 0 01 4> 114 10
22 93 8 01 114 4> 10
23 95 10 01 114 10 2>
24 97 9 01 114 10 <5 10
25 100 7 01 114 <5 11 10
26 104 8 01 113 01 3> 11 10
27 107 10 01 113 012 3> 10
28 113 9 01 113 012 <7 11
29 119 5 01 113 <7 113
30 121 3 01 112 <3 114
31 123 4 01 11 10 2> 114
32 135 12 01 11 105 2>
>> Try to prove a PA-CTR with 2 Vars...
0 0 0 [*]* 114+V(2) 101+V(1) 2>
1 2 -1 [*]* 114+V(2) 101+V(1) <5 10
2 5+3*V(1) -3+-2*V(1) [*]* 114+V(2) <5 111+V(1) 10
3 9+3*V(1) -2+-2*V(1) [*]* 113+V(2) 01 3> 111+V(1) 10
4 12+6*V(1) 0 [*]* 113+V(2) 012+V(1) 3> 10
5 18+6*V(1) -1 [*]* 113+V(2) 012+V(1) <7 11
6 24+9*V(1) -5+-2*V(1) [*]* 113+V(2) <7 113+V(1)
7 26+9*V(1) -7+-2*V(1) [*]* 112+V(2) <3 114+V(1)
8 28+9*V(1) -6+-2*V(1) [*]* 111+V(2) 10 2> 114+V(1)
9 40+12*V(1) 2 [*]* 111+V(2) 105+V(1) 2>
<< Success! ==> defined new CTR 1 (PA)
33 137 11 01 11 105 <5 10
34 152 1 01 11 <5 115 10
35 156 2 012 3> 115 10
36 171 12 017 3> 10
37 177 11 017 <7 11
38 198 -3 <7 118
39 199 -2 4> 118
40 215 14 118 4>
41 220 13 118 <7 11
42 222 11 117 <3 112
43 224 12 116 10 2> 112
44 230 16 116 103 2>
45 232 15 116 103 <5 10
46 241 9 116 <5 113 10
47 245 10 115 01 3> 113 10
48 254 16 115 014 3> 10
49 260 15 115 014 <7 11
50 272 7 115 <7 115
>> Try to prove a PA-CTR with 2 Vars...
0 0 0 114+V(1) <7 111+V(2)
1 2 -2 113+V(1) <3 112+V(2)
2 4 -1 112+V(1) 10 2> 112+V(2)
3 10+3*V(2) 3+2*V(2) 112+V(1) 103+V(2) 2>
4 12+3*V(2) 2+2*V(2) 112+V(1) 103+V(2) <5 10
5 21+6*V(2) -4 112+V(1) <5 113+V(2) 10
6 25+6*V(2) -3 111+V(1) 01 3> 113+V(2) 10
7 34+9*V(2) 3+2*V(2) 111+V(1) 014+V(2) 3> 10
8 40+9*V(2) 2+2*V(2) 111+V(1) 014+V(2) <7 11
9 52+12*V(2) -6 111+V(1) <7 115+V(2)
<< Success! ==> defined new CTR 2 (PA)
50 272 7 115 <7 115
== Executing PA-CTR 2, V(1)=1, V(2)=4, repcount=1, factor=4/3
59 372 1 112 <7 119
60 374 -1 11 <3 1110
61 376 0 10 2> 1110
62 406 20 1011 2>
63 408 19 1011 <5 10
64 441 -3 <5 1111 10
65 445 -2 01 4> 1111 10
66 467 20 01 1111 4> 10
67 469 22 01 1111 10 2>
>> Try to prove a PPA-CTR with 1 Vars...
0 0 0 112 <7 112+V(1)
1 2 -2 11 <3 113+V(1)
2 4 -1 10 2> 113+V(1)
3 13+3*V(1) 5+2*V(1) 104+V(1) 2>
4 15+3*V(1) 4+2*V(1) 104+V(1) <5 10
5 27+6*V(1) -4 <5 114+V(1) 10
6 31+6*V(1) -3 01 4> 114+V(1) 10
7 39+8*V(1) 5+2*V(1) 01 114+V(1) 4> 10
8 41+8*V(1) 7+2*V(1) 01 114+V(1) 10 2>
<< Success! ==> defined new CTR 3 (PPA)
67 469 22 01 1111 10 2>
== Executing PA-CTR 1, V(1)=0, V(2)=7, repcount=3, factor=4/3
94 733 28 01 112 1013 2>
95 735 27 01 112 1013 <5 10
96 774 1 01 112 <5 1113 10
97 778 2 01 11 01 3> 1113 10
98 817 28 01 11 0114 3> 10
99 823 27 01 11 0114 <7 11
100 865 -1 01 11 <7 1115
101 867 -3 01 <3 1116
102 869 -2 2> 1116
103 917 30 1016 2>
104 919 29 1016 <5 10
105 967 -3 <5 1116 10
106 971 -2 01 4> 1116 10
107 1003 30 01 1116 4> 10
108 1005 32 01 1116 10 2>
>> Try to prove a PPA-CTR with 1 Vars...
0 0 0 01 112 101+V(1) 2>
1 2 -1 01 112 101+V(1) <5 10
2 5+3*V(1) -3+-2*V(1) 01 112 <5 111+V(1) 10
3 9+3*V(1) -2+-2*V(1) 01 11 01 3> 111+V(1) 10
4 12+6*V(1) 0 01 11 012+V(1) 3> 10
5 18+6*V(1) -1 01 11 012+V(1) <7 11
6 24+9*V(1) -5+-2*V(1) 01 11 <7 113+V(1)
7 26+9*V(1) -7+-2*V(1) 01 <3 114+V(1)
8 28+9*V(1) -6+-2*V(1) 2> 114+V(1)
9 40+12*V(1) 2 104+V(1) 2>
10 42+12*V(1) 1 104+V(1) <5 10
11 54+15*V(1) -7+-2*V(1) <5 114+V(1) 10
12 58+15*V(1) -6+-2*V(1) 01 4> 114+V(1) 10
13 66+17*V(1) 2 01 114+V(1) 4> 10
14 68+17*V(1) 4 01 114+V(1) 10 2>
<< Success! ==> defined new CTR 4 (PPA)
108 1005 32 01 1116 10 2>
== Executing PA-CTR 1, V(1)=0, V(2)=12, repcount=5, factor=4/3
153 1685 42 01 11 1021 2>
154 1687 41 01 11 1021 <5 10
155 1750 -1 01 11 <5 1121 10
156 1754 0 012 3> 1121 10
157 1817 42 0123 3> 10
158 1823 41 0123 <7 11
159 1892 -5 <7 1124
160 1893 -4 4> 1124
161 1941 44 1124 4>
162 1946 43 1124 <7 11
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 011+V(2) 11 101+V(1) 2>
1 2 -1 011+V(2) 11 101+V(1) <5 10
2 5+3*V(1) -3+-2*V(1) 011+V(2) 11 <5 111+V(1) 10
3 9+3*V(1) -2+-2*V(1) 012+V(2) 3> 111+V(1) 10
4 12+6*V(1) 0 013+V(1)+V(2) 3> 10
5 18+6*V(1) -1 013+V(1)+V(2) <7 11
6 27+9*V(1)+3*V(2) -7+-2*V(1)+-2*V(2) <7 114+V(1)+V(2)
7 28+9*V(1)+3*V(2) -6+-2*V(1)+-2*V(2) 4> 114+V(1)+V(2)
8 36+11*V(1)+5*V(2) 2 114+V(1)+V(2) 4>
9 41+11*V(1)+5*V(2) 1 114+V(1)+V(2) <7 11
<< Success! ==> defined new CTR 5 (PPA)
162 1946 43 1124 <7 11
== Executing PA-CTR 2, V(1)=20, V(2)=0, repcount=7, factor=4/3
225 3318 1 113 <7 1129
226 3320 -1 112 <3 1130
227 3322 0 11 10 2> 1130
228 3412 60 11 1031 2>
229 3414 59 11 1031 <5 10
230 3507 -3 11 <5 1131 10
231 3511 -2 01 3> 1131 10
232 3604 60 0132 3> 10
233 3610 59 0132 <7 11
234 3706 -5 <7 1133
235 3707 -4 4> 1133
236 3773 62 1133 4>
237 3778 61 1133 <7 11
>> Try to prove a PPA-CTR with 1 Vars...
0 0 0 113 <7 111+V(1)
1 2 -2 112 <3 112+V(1)
2 4 -1 11 10 2> 112+V(1)
3 10+3*V(1) 3+2*V(1) 11 103+V(1) 2>
4 12+3*V(1) 2+2*V(1) 11 103+V(1) <5 10
5 21+6*V(1) -4 11 <5 113+V(1) 10
6 25+6*V(1) -3 01 3> 113+V(1) 10
7 34+9*V(1) 3+2*V(1) 014+V(1) 3> 10
8 40+9*V(1) 2+2*V(1) 014+V(1) <7 11
9 52+12*V(1) -6 <7 115+V(1)
10 53+12*V(1) -5 4> 115+V(1)
11 63+14*V(1) 5+2*V(1) 115+V(1) 4>
12 68+14*V(1) 4+2*V(1) 115+V(1) <7 11
<< Success! ==> defined new CTR 6 (PPA)
237 3778 61 1133 <7 11
== Executing PA-CTR 2, V(1)=29, V(2)=0, repcount=10, factor=4/3
327 6458 1 113 <7 1141
== Executing PPA-CTR 6 (once), V(1)=40
339 7086 85 1145 <7 11
== Executing PA-CTR 2, V(1)=41, V(2)=0, repcount=14, factor=4/3
465 12182 1 113 <7 1157
== Executing PPA-CTR 6 (once), V(1)=56
477 13034 117 1161 <7 11
== Executing PA-CTR 2, V(1)=57, V(2)=0, repcount=20, factor=4/3
657 23194 -3 11 <7 1181
658 23196 -5 <3 1182
659 23197 -4 6> 1182
660 23197 -4 6> 1182 [would halt]
Lines: 106
Top steps: 105
Macro steps: 660
Basic steps: 23197
Tape index: -4
ones: 164
log10(ones ): 2.215
log10(steps ): 4.365
Run state: would halt
Input to awk program:
gohalt 1
T 4-Tuple BB7 #3 of Machado/Pereira
4T 21 7< 71 3> 6> 40 2> 4> 11 3< 50 *= 4> 5<
: 164 23197
gohalt 0
L 6
m 25000
M 400
pref sim
machv 4BB7_3 just simple
machv 4BB7_3-r with repetitions reduced
machv 4BB7_3-1 with tape symbol exponents
machv 4BB7_3-m as 2-macro machine
machv 4BB7_3-a as 2-macro machine with pure additive config-TRs
iam 4BB7_3-a
mtype 2
mmtyp 3
r 1
H 1
mac 0
E 2
sympr
HM 1
date Tue Jul 6 22:11:29 CEST 2010
edate Tue Jul 6 22:11:29 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:29 CEST 2010