Comment: This TM produces >2.1x10^628 nonzeros in >3.1x10^1256 steps.
| State | on 0 |
on 1 |
on 2 |
on 3 |
on 0 | on 1 | on 2 | on 3 | ||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Move | Goto | Move | Goto | Move | Goto | Move | Goto | |||||||||
| A | 1RB | 3LA | 3RC | 1RA | 1 | right | B | 3 | left | A | 3 | right | C | 1 | right | A |
| B | 2RC | 1LA | 1RH | 2RB | 2 | right | C | 1 | left | A | 1 | right | H | 2 | right | B |
| C | 1LC | 1RB | 1LB | 2RA | 1 | left | C | 1 | right | B | 1 | left | B | 2 | right | A |
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 2 1 2 C>
3 3 1 1 2 <C 1
4 4 0 1 <B 12
5 5 -1 <A 13
6 6 0 1 B> 13
7 7 -1 1 <A 13
8 8 -2 <A 3 13
9 9 -1 1 B> 3 13
10 10 0 1 2 B> 13
11 11 -1 1 2 <A 13
12 12 0 1 3 C> 13
13 13 1 1 3 1 B> 12
14 14 0 1 3 1 <A 12
15 15 -1 1 3 <A 3 12
16 16 0 12 A> 3 12
17 17 1 13 A> 12
18 18 0 13 <A 3 1
19 21 -3 <A 34 1
20 22 -2 1 B> 34 1
21 26 2 1 24 B> 1
22 27 1 1 24 <A 1
23 28 2 1 23 3 C> 1
24 29 3 1 23 3 1 B>
25 30 4 1 23 3 1 2 C>
26 31 3 1 23 3 1 2 <C 1
27 32 2 1 23 3 1 <B 12
28 33 1 1 23 3 <A 13
29 34 2 1 23 1 A> 13
30 35 1 1 23 1 <A 3 12
31 36 0 1 23 <A 32 12
32 37 1 1 22 3 C> 32 12
33 38 2 1 22 3 2 A> 3 12
34 39 3 1 22 3 2 1 A> 12
35 40 2 1 22 3 2 1 <A 3 1
36 41 1 1 22 3 2 <A 32 1
37 42 2 1 22 32 C> 32 1
>> Try to prove a PA-CTR with 3 Vars...
0 0 0 [*]* [*]* 31+V(1) C> 32+V(3) 12+V(2)
1 1 1 [*]* [*]* 31+V(1) 2 A> 31+V(3) 12+V(2)
2 2+V(3) 2+V(3) [*]* [*]* 31+V(1) 2 11+V(3) A> 12+V(2)
3 3+V(3) 1+V(3) [*]* [*]* 31+V(1) 2 11+V(3) <A 3 11+V(2)
4 4+2*V(3) 0 [*]* [*]* 31+V(1) 2 <A 32+V(3) 11+V(2)
5 5+2*V(3) 1 [*]* [*]* 32+V(1) C> 32+V(3) 11+V(2)
<< Success! ==> defined new CTR 1 (PA)
38 43 3 1 22 32 2 A> 3 1
39 44 4 1 22 32 2 1 A> 1
40 45 3 1 22 32 2 1 <A 3
41 46 2 1 22 32 2 <A 32
42 47 3 1 22 33 C> 32
43 48 4 1 22 33 2 A> 3
44 49 5 1 22 33 2 1 A>
45 50 6 1 22 33 2 12 B>
46 51 7 1 22 33 2 12 2 C>
47 52 6 1 22 33 2 12 2 <C 1
48 53 5 1 22 33 2 12 <B 12
49 54 4 1 22 33 2 1 <A 13
50 55 3 1 22 33 2 <A 3 13
51 56 4 1 22 34 C> 3 13
52 57 5 1 22 34 2 A> 13
53 58 4 1 22 34 2 <A 3 12
>> Try to prove a PA-CTR with 2 Vars...
0 0 0 [*]* [*]* 31+V(1) 2 <A 3 12+V(2)
1 1 1 [*]* [*]* 32+V(1) C> 3 12+V(2)
2 2 2 [*]* [*]* 32+V(1) 2 A> 12+V(2)
3 3 1 [*]* [*]* 32+V(1) 2 <A 3 11+V(2)
<< Success! ==> defined new CTR 2 (PA)
53 58 4 1 22 34 2 <A 3 12
== Executing PA-CTR 2, V(1)=3, V(2)=0, repcount=1, factor=1/1
56 61 5 1 22 35 2 <A 3 1
57 62 6 1 22 36 C> 3 1
58 63 7 1 22 36 2 A> 1
59 64 6 1 22 36 2 <A 3
60 65 7 1 22 37 C> 3
61 66 8 1 22 37 2 A>
62 67 9 1 22 37 2 1 B>
63 68 10 1 22 37 2 1 2 C>
64 69 9 1 22 37 2 1 2 <C 1
65 70 8 1 22 37 2 1 <B 12
66 71 7 1 22 37 2 <A 13
67 72 8 1 22 38 C> 13
68 73 9 1 22 38 1 B> 12
69 74 8 1 22 38 1 <A 12
70 75 7 1 22 38 <A 3 12
71 76 8 1 22 37 1 A> 3 12
72 77 9 1 22 37 12 A> 12
73 78 8 1 22 37 12 <A 3 1
74 80 6 1 22 37 <A 33 1
>> Try to prove a PA-CTR with 3 Vars...
0 0 0 [*]* [*]* 32+V(1) <A 31+V(3) 12+V(2)
1 1 1 [*]* [*]* 31+V(1) 1 A> 31+V(3) 12+V(2)
2 2+V(3) 2+V(3) [*]* [*]* 31+V(1) 12+V(3) A> 12+V(2)
3 3+V(3) 1+V(3) [*]* [*]* 31+V(1) 12+V(3) <A 3 11+V(2)
4 5+2*V(3) -1 [*]* [*]* 31+V(1) <A 33+V(3) 11+V(2)
<< Success! ==> defined new CTR 3 (PA)
75 81 7 1 22 36 1 A> 33 1
76 84 10 1 22 36 14 A> 1
77 85 9 1 22 36 14 <A 3
78 89 5 1 22 36 <A 35
79 90 6 1 22 35 1 A> 35
80 95 11 1 22 35 16 A>
81 96 12 1 22 35 17 B>
82 97 13 1 22 35 17 2 C>
83 98 12 1 22 35 17 2 <C 1
84 99 11 1 22 35 17 <B 12
85 100 10 1 22 35 16 <A 13
86 106 4 1 22 35 <A 36 13
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 [*]* [*]* 34+V(1) <A 31+V(2) 1
1 1 1 [*]* [*]* 33+V(1) 1 A> 31+V(2) 1
2 2+V(2) 2+V(2) [*]* [*]* 33+V(1) 12+V(2) A> 1
3 3+V(2) 1+V(2) [*]* [*]* 33+V(1) 12+V(2) <A 3
4 5+2*V(2) -1 [*]* [*]* 33+V(1) <A 33+V(2)
5 6+2*V(2) 0 [*]* [*]* 32+V(1) 1 A> 33+V(2)
6 9+3*V(2) 3+V(2) [*]* [*]* 32+V(1) 14+V(2) A>
7 10+3*V(2) 4+V(2) [*]* [*]* 32+V(1) 15+V(2) B>
8 11+3*V(2) 5+V(2) [*]* [*]* 32+V(1) 15+V(2) 2 C>
9 12+3*V(2) 4+V(2) [*]* [*]* 32+V(1) 15+V(2) 2 <C 1
10 13+3*V(2) 3+V(2) [*]* [*]* 32+V(1) 15+V(2) <B 12
11 14+3*V(2) 2+V(2) [*]* [*]* 32+V(1) 14+V(2) <A 13
12 18+4*V(2) -2 [*]* [*]* 32+V(1) <A 34+V(2) 13
<< Success! ==> defined new CTR 4 (PPA)
86 106 4 1 22 35 <A 36 13
== Executing PA-CTR 3, V(1)=3, V(2)=1, V(3)=5, repcount=2, factor=2/1
94 140 2 1 22 33 <A 310 1
95 141 3 1 22 32 1 A> 310 1
96 151 13 1 22 32 111 A> 1
97 152 12 1 22 32 111 <A 3
98 163 1 1 22 32 <A 312
99 164 2 1 22 3 1 A> 312
100 176 14 1 22 3 113 A>
101 177 15 1 22 3 114 B>
102 178 16 1 22 3 114 2 C>
103 179 15 1 22 3 114 2 <C 1
104 180 14 1 22 3 114 <B 12
105 181 13 1 22 3 113 <A 13
106 194 0 1 22 3 <A 313 13
107 195 1 1 22 1 A> 313 13
108 208 14 1 22 114 A> 13
109 209 13 1 22 114 <A 3 12
110 223 -1 1 22 <A 315 12
111 224 0 1 2 3 C> 315 12
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 [*]* 22+V(1) 33 <A 31+V(2) 1
1 1 1 [*]* 22+V(1) 32 1 A> 31+V(2) 1
2 2+V(2) 2+V(2) [*]* 22+V(1) 32 12+V(2) A> 1
3 3+V(2) 1+V(2) [*]* 22+V(1) 32 12+V(2) <A 3
4 5+2*V(2) -1 [*]* 22+V(1) 32 <A 33+V(2)
5 6+2*V(2) 0 [*]* 22+V(1) 3 1 A> 33+V(2)
6 9+3*V(2) 3+V(2) [*]* 22+V(1) 3 14+V(2) A>
7 10+3*V(2) 4+V(2) [*]* 22+V(1) 3 15+V(2) B>
8 11+3*V(2) 5+V(2) [*]* 22+V(1) 3 15+V(2) 2 C>
9 12+3*V(2) 4+V(2) [*]* 22+V(1) 3 15+V(2) 2 <C 1
10 13+3*V(2) 3+V(2) [*]* 22+V(1) 3 15+V(2) <B 12
11 14+3*V(2) 2+V(2) [*]* 22+V(1) 3 14+V(2) <A 13
12 18+4*V(2) -2 [*]* 22+V(1) 3 <A 34+V(2) 13
13 19+4*V(2) -1 [*]* 22+V(1) 1 A> 34+V(2) 13
14 23+5*V(2) 3+V(2) [*]* 22+V(1) 15+V(2) A> 13
15 24+5*V(2) 2+V(2) [*]* 22+V(1) 15+V(2) <A 3 12
16 29+6*V(2) -3 [*]* 22+V(1) <A 36+V(2) 12
17 30+6*V(2) -2 [*]* 21+V(1) 3 C> 36+V(2) 12
<< Success! ==> defined new CTR 5 (PPA)
111 224 0 1 2 3 C> 315 12
== Executing PA-CTR 1, V(1)=0, V(2)=0, V(3)=13, repcount=1, factor=1/1
116 255 1 1 2 32 C> 315 1
117 256 2 1 2 32 2 A> 314 1
118 270 16 1 2 32 2 114 A> 1
119 271 15 1 2 32 2 114 <A 3
120 285 1 1 2 32 2 <A 315
121 286 2 1 2 33 C> 315
122 287 3 1 2 33 2 A> 314
123 301 17 1 2 33 2 114 A>
124 302 18 1 2 33 2 115 B>
125 303 19 1 2 33 2 115 2 C>
126 304 18 1 2 33 2 115 2 <C 1
127 305 17 1 2 33 2 115 <B 12
128 306 16 1 2 33 2 114 <A 13
129 320 2 1 2 33 2 <A 314 13
130 321 3 1 2 34 C> 314 13
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 [*]* [*]* 31+V(1) C> 33+V(2) 1
1 1 1 [*]* [*]* 31+V(1) 2 A> 32+V(2) 1
2 3+V(2) 3+V(2) [*]* [*]* 31+V(1) 2 12+V(2) A> 1
3 4+V(2) 2+V(2) [*]* [*]* 31+V(1) 2 12+V(2) <A 3
4 6+2*V(2) 0 [*]* [*]* 31+V(1) 2 <A 33+V(2)
5 7+2*V(2) 1 [*]* [*]* 32+V(1) C> 33+V(2)
6 8+2*V(2) 2 [*]* [*]* 32+V(1) 2 A> 32+V(2)
7 10+3*V(2) 4+V(2) [*]* [*]* 32+V(1) 2 12+V(2) A>
8 11+3*V(2) 5+V(2) [*]* [*]* 32+V(1) 2 13+V(2) B>
9 12+3*V(2) 6+V(2) [*]* [*]* 32+V(1) 2 13+V(2) 2 C>
10 13+3*V(2) 5+V(2) [*]* [*]* 32+V(1) 2 13+V(2) 2 <C 1
11 14+3*V(2) 4+V(2) [*]* [*]* 32+V(1) 2 13+V(2) <B 12
12 15+3*V(2) 3+V(2) [*]* [*]* 32+V(1) 2 12+V(2) <A 13
13 17+4*V(2) 1 [*]* [*]* 32+V(1) 2 <A 32+V(2) 13
14 18+4*V(2) 2 [*]* [*]* 33+V(1) C> 32+V(2) 13
<< Success! ==> defined new CTR 6 (PPA)
130 321 3 1 2 34 C> 314 13
== Executing PA-CTR 1, V(1)=3, V(2)=1, V(3)=12, repcount=2, factor=1/1
140 379 5 1 2 36 C> 314 1
== Executing PPA-CTR 6 (once), V(1)=5, V(2)=11
154 441 7 1 2 38 C> 313 13
== Executing PA-CTR 1, V(1)=7, V(2)=1, V(3)=11, repcount=2, factor=1/1
164 495 9 1 2 310 C> 313 1
== Executing PPA-CTR 6 (once), V(1)=9, V(2)=10
178 553 11 1 2 312 C> 312 13
== Executing PA-CTR 1, V(1)=11, V(2)=1, V(3)=10, repcount=2, factor=1/1
188 603 13 1 2 314 C> 312 1
== Executing PPA-CTR 6 (once), V(1)=13, V(2)=9
202 657 15 1 2 316 C> 311 13
== Executing PA-CTR 1, V(1)=15, V(2)=1, V(3)=9, repcount=2, factor=1/1
212 703 17 1 2 318 C> 311 1
== Executing PPA-CTR 6 (once), V(1)=17, V(2)=8
226 753 19 1 2 320 C> 310 13
== Executing PA-CTR 1, V(1)=19, V(2)=1, V(3)=8, repcount=2, factor=1/1
236 795 21 1 2 322 C> 310 1
== Executing PPA-CTR 6 (once), V(1)=21, V(2)=7
250 841 23 1 2 324 C> 39 13
== Executing PA-CTR 1, V(1)=23, V(2)=1, V(3)=7, repcount=2, factor=1/1
260 879 25 1 2 326 C> 39 1
== Executing PPA-CTR 6 (once), V(1)=25, V(2)=6
274 921 27 1 2 328 C> 38 13
== Executing PA-CTR 1, V(1)=27, V(2)=1, V(3)=6, repcount=2, factor=1/1
284 955 29 1 2 330 C> 38 1
== Executing PPA-CTR 6 (once), V(1)=29, V(2)=5
298 993 31 1 2 332 C> 37 13
== Executing PA-CTR 1, V(1)=31, V(2)=1, V(3)=5, repcount=2, factor=1/1
308 1023 33 1 2 334 C> 37 1
== Executing PPA-CTR 6 (once), V(1)=33, V(2)=4
322 1057 35 1 2 336 C> 36 13
== Executing PA-CTR 1, V(1)=35, V(2)=1, V(3)=4, repcount=2, factor=1/1
332 1083 37 1 2 338 C> 36 1
== Executing PPA-CTR 6 (once), V(1)=37, V(2)=3
346 1113 39 1 2 340 C> 35 13
== Executing PA-CTR 1, V(1)=39, V(2)=1, V(3)=3, repcount=2, factor=1/1
356 1135 41 1 2 342 C> 35 1
== Executing PPA-CTR 6 (once), V(1)=41, V(2)=2
370 1161 43 1 2 344 C> 34 13
== Executing PA-CTR 1, V(1)=43, V(2)=1, V(3)=2, repcount=2, factor=1/1
380 1179 45 1 2 346 C> 34 1
== Executing PPA-CTR 6 (once), V(1)=45, V(2)=1
394 1201 47 1 2 348 C> 33 13
== Executing PA-CTR 1, V(1)=47, V(2)=1, V(3)=1, repcount=2, factor=1/1
404 1215 49 1 2 350 C> 33 1
== Executing PPA-CTR 6 (once), V(1)=49, V(2)=0
418 1233 51 1 2 352 C> 32 13
== Executing PA-CTR 1, V(1)=51, V(2)=1, V(3)=0, repcount=2, factor=1/1
428 1243 53 1 2 354 C> 32 1
429 1244 54 1 2 354 2 A> 3 1
430 1245 55 1 2 354 2 1 A> 1
431 1246 54 1 2 354 2 1 <A 3
432 1247 53 1 2 354 2 <A 32
433 1248 54 1 2 355 C> 32
434 1249 55 1 2 355 2 A> 3
435 1250 56 1 2 355 2 1 A>
436 1251 57 1 2 355 2 12 B>
437 1252 58 1 2 355 2 12 2 C>
438 1253 57 1 2 355 2 12 2 <C 1
439 1254 56 1 2 355 2 12 <B 12
440 1255 55 1 2 355 2 1 <A 13
441 1256 54 1 2 355 2 <A 3 13
>> Try to prove a PPA-CTR with 1 Vars...
0 0 0 [*]* [*]* 31+V(1) C> 32 1
1 1 1 [*]* [*]* 31+V(1) 2 A> 3 1
2 2 2 [*]* [*]* 31+V(1) 2 1 A> 1
3 3 1 [*]* [*]* 31+V(1) 2 1 <A 3
4 4 0 [*]* [*]* 31+V(1) 2 <A 32
5 5 1 [*]* [*]* 32+V(1) C> 32
6 6 2 [*]* [*]* 32+V(1) 2 A> 3
7 7 3 [*]* [*]* 32+V(1) 2 1 A>
8 8 4 [*]* [*]* 32+V(1) 2 12 B>
9 9 5 [*]* [*]* 32+V(1) 2 12 2 C>
10 10 4 [*]* [*]* 32+V(1) 2 12 2 <C 1
11 11 3 [*]* [*]* 32+V(1) 2 12 <B 12
12 12 2 [*]* [*]* 32+V(1) 2 1 <A 13
13 13 1 [*]* [*]* 32+V(1) 2 <A 3 13
<< Success! ==> defined new CTR 7 (PPA)
441 1256 54 1 2 355 2 <A 3 13
== Executing PA-CTR 2, V(1)=54, V(2)=1, repcount=2, factor=1/1
447 1262 56 1 2 357 2 <A 3 1
448 1263 57 1 2 358 C> 3 1
449 1264 58 1 2 358 2 A> 1
450 1265 57 1 2 358 2 <A 3
451 1266 58 1 2 359 C> 3
452 1267 59 1 2 359 2 A>
453 1268 60 1 2 359 2 1 B>
454 1269 61 1 2 359 2 1 2 C>
455 1270 60 1 2 359 2 1 2 <C 1
456 1271 59 1 2 359 2 1 <B 12
457 1272 58 1 2 359 2 <A 13
458 1273 59 1 2 360 C> 13
459 1274 60 1 2 360 1 B> 12
460 1275 59 1 2 360 1 <A 12
461 1276 58 1 2 360 <A 3 12
>> Try to prove a PPA-CTR with 1 Vars...
0 0 0 [*]* [*]* 31+V(1) 2 <A 3 1
1 1 1 [*]* [*]* 32+V(1) C> 3 1
2 2 2 [*]* [*]* 32+V(1) 2 A> 1
3 3 1 [*]* [*]* 32+V(1) 2 <A 3
4 4 2 [*]* [*]* 33+V(1) C> 3
5 5 3 [*]* [*]* 33+V(1) 2 A>
6 6 4 [*]* [*]* 33+V(1) 2 1 B>
7 7 5 [*]* [*]* 33+V(1) 2 1 2 C>
8 8 4 [*]* [*]* 33+V(1) 2 1 2 <C 1
9 9 3 [*]* [*]* 33+V(1) 2 1 <B 12
10 10 2 [*]* [*]* 33+V(1) 2 <A 13
11 11 3 [*]* [*]* 34+V(1) C> 13
12 12 4 [*]* [*]* 34+V(1) 1 B> 12
13 13 3 [*]* [*]* 34+V(1) 1 <A 12
14 14 2 [*]* [*]* 34+V(1) <A 3 12
<< Success! ==> defined new CTR 8 (PPA)
461 1276 58 1 2 360 <A 3 12
== Executing PA-CTR 3, V(1)=58, V(2)=0, V(3)=0, repcount=1, factor=2/1
465 1281 57 1 2 359 <A 33 1
== Executing PPA-CTR 4 (once), V(1)=55, V(2)=2
477 1307 55 1 2 357 <A 36 13
== Executing PA-CTR 3, V(1)=55, V(2)=1, V(3)=5, repcount=2, factor=2/1
485 1341 53 1 2 355 <A 310 1
== Executing PPA-CTR 4 (once), V(1)=51, V(2)=9
497 1395 51 1 2 353 <A 313 13
== Executing PA-CTR 3, V(1)=51, V(2)=1, V(3)=12, repcount=2, factor=2/1
505 1457 49 1 2 351 <A 317 1
== Executing PPA-CTR 4 (once), V(1)=47, V(2)=16
517 1539 47 1 2 349 <A 320 13
== Executing PA-CTR 3, V(1)=47, V(2)=1, V(3)=19, repcount=2, factor=2/1
525 1629 45 1 2 347 <A 324 1
== Executing PPA-CTR 4 (once), V(1)=43, V(2)=23
537 1739 43 1 2 345 <A 327 13
== Executing PA-CTR 3, V(1)=43, V(2)=1, V(3)=26, repcount=2, factor=2/1
545 1857 41 1 2 343 <A 331 1
== Executing PPA-CTR 4 (once), V(1)=39, V(2)=30
557 1995 39 1 2 341 <A 334 13
== Executing PA-CTR 3, V(1)=39, V(2)=1, V(3)=33, repcount=2, factor=2/1
565 2141 37 1 2 339 <A 338 1
== Executing PPA-CTR 4 (once), V(1)=35, V(2)=37
577 2307 35 1 2 337 <A 341 13
== Executing PA-CTR 3, V(1)=35, V(2)=1, V(3)=40, repcount=2, factor=2/1
585 2481 33 1 2 335 <A 345 1
== Executing PPA-CTR 4 (once), V(1)=31, V(2)=44
597 2675 31 1 2 333 <A 348 13
== Executing PA-CTR 3, V(1)=31, V(2)=1, V(3)=47, repcount=2, factor=2/1
605 2877 29 1 2 331 <A 352 1
== Executing PPA-CTR 4 (once), V(1)=27, V(2)=51
617 3099 27 1 2 329 <A 355 13
== Executing PA-CTR 3, V(1)=27, V(2)=1, V(3)=54, repcount=2, factor=2/1
625 3329 25 1 2 327 <A 359 1
== Executing PPA-CTR 4 (once), V(1)=23, V(2)=58
637 3579 23 1 2 325 <A 362 13
== Executing PA-CTR 3, V(1)=23, V(2)=1, V(3)=61, repcount=2, factor=2/1
645 3837 21 1 2 323 <A 366 1
== Executing PPA-CTR 4 (once), V(1)=19, V(2)=65
657 4115 19 1 2 321 <A 369 13
== Executing PA-CTR 3, V(1)=19, V(2)=1, V(3)=68, repcount=2, factor=2/1
665 4401 17 1 2 319 <A 373 1
== Executing PPA-CTR 4 (once), V(1)=15, V(2)=72
677 4707 15 1 2 317 <A 376 13
== Executing PA-CTR 3, V(1)=15, V(2)=1, V(3)=75, repcount=2, factor=2/1
685 5021 13 1 2 315 <A 380 1
== Executing PPA-CTR 4 (once), V(1)=11, V(2)=79
697 5355 11 1 2 313 <A 383 13
== Executing PA-CTR 3, V(1)=11, V(2)=1, V(3)=82, repcount=2, factor=2/1
705 5697 9 1 2 311 <A 387 1
== Executing PPA-CTR 4 (once), V(1)=7, V(2)=86
717 6059 7 1 2 39 <A 390 13
== Executing PA-CTR 3, V(1)=7, V(2)=1, V(3)=89, repcount=2, factor=2/1
725 6429 5 1 2 37 <A 394 1
== Executing PPA-CTR 4 (once), V(1)=3, V(2)=93
737 6819 3 1 2 35 <A 397 13
== Executing PA-CTR 3, V(1)=3, V(2)=1, V(3)=96, repcount=2, factor=2/1
745 7217 1 1 2 33 <A 3101 1
746 7218 2 1 2 32 1 A> 3101 1
Lines: 201
Top steps: 200
Macro steps: 746
Basic steps: 7218
Tape index: 2
nonzeros: 107
log10(nonzeros): 2.029
log10(steps ): 3.858
Input to awk program:
gohalt 1
nbs 4
T 3-state 4-symbol #e (T.J. & S. Ligocki)
: >2.1x10^628 >3.1x10^1256
5T 1RB 3LA 3RC 1RA 2RC 1LA 1RH 2RB 1LC 1RB 1LB 2RA
L 4
M 201
pref sim
machv Lig34_e just simple
machv Lig34_e-r with repetitions reduced
machv Lig34_e-1 with tape symbol exponents
machv Lig34_e-m as 1-macro machine
machv Lig34_e-a as 1-macro machine with pure additive config-TRs
iam Lig34_e-a
mtype 1
mmtyp 3
r 1
H 1
mac 0
E 2
sympr
HM 1
date Tue Jul 6 22:13:49 CEST 2010
edate Tue Jul 6 22:13:50 CEST 2010
bnspeed 1
short 7
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:13:49 CEST 2010