Comment: This TM produces 84 nonzeros in 6445 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 | 2LA | 1RA | 1LA | 1 | right | B | 2 | left | A | 1 | right | A | 1 | left | A |
| B | 3LA | 1RH | 2RB | 2LA | 3 | left | A | 1 | right | H | 2 | right | B | 2 | left | 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 0 1 <A 3
3 3 -1 <A 2 3
4 4 0 1 B> 2 3
5 5 1 1 2 B> 3
6 6 0 1 2 <A 2
7 7 1 12 A> 2
8 8 2 13 A>
9 9 3 14 B>
10 10 2 14 <A 3
11 14 -2 <A 24 3
12 15 -1 1 B> 24 3
13 19 3 1 24 B> 3
14 20 2 1 24 <A 2
15 21 3 1 23 1 A> 2
16 22 4 1 23 12 A>
17 23 5 1 23 13 B>
18 24 4 1 23 13 <A 3
19 27 1 1 23 <A 23 3
20 28 2 1 22 1 A> 23 3
21 31 5 1 22 14 A> 3
22 32 4 1 22 14 <A 1
23 36 0 1 22 <A 24 1
24 37 1 1 2 1 A> 24 1
25 41 5 1 2 15 A> 1
26 42 4 1 2 15 <A 2
27 47 -1 1 2 <A 26
>> Try to prove a PA-CTR with 2 Vars...
0 0 0 [*]* 24+V(1) <A 21+V(2)
1 1 1 [*]* 23+V(1) 1 A> 21+V(2)
2 2+V(2) 2+V(2) [*]* 23+V(1) 12+V(2) A>
3 3+V(2) 3+V(2) [*]* 23+V(1) 13+V(2) B>
4 4+V(2) 2+V(2) [*]* 23+V(1) 13+V(2) <A 3
5 7+2*V(2) -1 [*]* 23+V(1) <A 23+V(2) 3
6 8+2*V(2) 0 [*]* 22+V(1) 1 A> 23+V(2) 3
7 11+3*V(2) 3+V(2) [*]* 22+V(1) 14+V(2) A> 3
8 12+3*V(2) 2+V(2) [*]* 22+V(1) 14+V(2) <A 1
9 16+4*V(2) -2 [*]* 22+V(1) <A 24+V(2) 1
10 17+4*V(2) -1 [*]* 21+V(1) 1 A> 24+V(2) 1
11 21+5*V(2) 3+V(2) [*]* 21+V(1) 15+V(2) A> 1
12 22+5*V(2) 2+V(2) [*]* 21+V(1) 15+V(2) <A 2
13 27+6*V(2) -3 [*]* 21+V(1) <A 26+V(2)
<< Success! ==> defined new CTR 1 (PA)
28 48 0 12 A> 26
29 54 6 18 A>
30 55 7 19 B>
31 56 6 19 <A 3
32 65 -3 <A 29 3
33 66 -2 1 B> 29 3
34 75 7 1 29 B> 3
35 76 6 1 29 <A 2
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 11+V(1) 2 <A 21+V(2)
1 1 1 12+V(1) A> 21+V(2)
2 2+V(2) 2+V(2) 13+V(1)+V(2) A>
3 3+V(2) 3+V(2) 14+V(1)+V(2) B>
4 4+V(2) 2+V(2) 14+V(1)+V(2) <A 3
5 8+V(1)+2*V(2) -2+-1*V(1) <A 24+V(1)+V(2) 3
6 9+V(1)+2*V(2) -1+-1*V(1) 1 B> 24+V(1)+V(2) 3
7 13+2*V(1)+3*V(2) 3+V(2) 1 24+V(1)+V(2) B> 3
8 14+2*V(1)+3*V(2) 2+V(2) 1 24+V(1)+V(2) <A 2
<< Success! ==> defined new CTR 2 (PPA)
35 76 6 1 29 <A 2
== Executing PA-CTR 1, V(1)=5, V(2)=0, repcount=2, factor=5/3
61 160 0 1 23 <A 211
62 161 1 1 22 1 A> 211
63 172 12 1 22 112 A>
64 173 13 1 22 113 B>
65 174 12 1 22 113 <A 3
66 187 -1 1 22 <A 213 3
67 188 0 1 2 1 A> 213 3
68 201 13 1 2 114 A> 3
69 202 12 1 2 114 <A 1
70 216 -2 1 2 <A 214 1
71 217 -1 12 A> 214 1
72 231 13 116 A> 1
73 232 12 116 <A 2
74 248 -4 <A 217
75 249 -3 1 B> 217
76 266 14 1 217 B>
77 267 13 1 217 <A 3
78 268 14 1 216 1 A> 3
79 269 13 1 216 1 <A 1
80 270 12 1 216 <A 2 1
81 271 13 1 215 1 A> 2 1
82 272 14 1 215 12 A> 1
83 273 13 1 215 12 <A 2
84 275 11 1 215 <A 23
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 11+V(1) 23 <A 21+V(2)
1 1 1 11+V(1) 22 1 A> 21+V(2)
2 2+V(2) 2+V(2) 11+V(1) 22 12+V(2) A>
3 3+V(2) 3+V(2) 11+V(1) 22 13+V(2) B>
4 4+V(2) 2+V(2) 11+V(1) 22 13+V(2) <A 3
5 7+2*V(2) -1 11+V(1) 22 <A 23+V(2) 3
6 8+2*V(2) 0 11+V(1) 2 1 A> 23+V(2) 3
7 11+3*V(2) 3+V(2) 11+V(1) 2 14+V(2) A> 3
8 12+3*V(2) 2+V(2) 11+V(1) 2 14+V(2) <A 1
9 16+4*V(2) -2 11+V(1) 2 <A 24+V(2) 1
10 17+4*V(2) -1 12+V(1) A> 24+V(2) 1
11 21+5*V(2) 3+V(2) 16+V(1)+V(2) A> 1
12 22+5*V(2) 2+V(2) 16+V(1)+V(2) <A 2
13 28+V(1)+6*V(2) -4+-1*V(1) <A 27+V(1)+V(2)
14 29+V(1)+6*V(2) -3+-1*V(1) 1 B> 27+V(1)+V(2)
15 36+2*V(1)+7*V(2) 4+V(2) 1 27+V(1)+V(2) B>
16 37+2*V(1)+7*V(2) 3+V(2) 1 27+V(1)+V(2) <A 3
17 38+2*V(1)+7*V(2) 4+V(2) 1 26+V(1)+V(2) 1 A> 3
18 39+2*V(1)+7*V(2) 3+V(2) 1 26+V(1)+V(2) 1 <A 1
19 40+2*V(1)+7*V(2) 2+V(2) 1 26+V(1)+V(2) <A 2 1
20 41+2*V(1)+7*V(2) 3+V(2) 1 25+V(1)+V(2) 1 A> 2 1
21 42+2*V(1)+7*V(2) 4+V(2) 1 25+V(1)+V(2) 12 A> 1
22 43+2*V(1)+7*V(2) 3+V(2) 1 25+V(1)+V(2) 12 <A 2
23 45+2*V(1)+7*V(2) 1+V(2) 1 25+V(1)+V(2) <A 23
<< Success! ==> defined new CTR 3 (PPA)
84 275 11 1 215 <A 23
== Executing PA-CTR 1, V(1)=11, V(2)=2, repcount=4, factor=5/3
136 611 -1 1 23 <A 223
== Executing PPA-CTR 3 (once), V(1)=0, V(2)=22
159 810 22 1 227 <A 23
== Executing PA-CTR 1, V(1)=23, V(2)=2, repcount=8, factor=5/3
263 1962 -2 1 23 <A 243
== Executing PPA-CTR 3 (once), V(1)=0, V(2)=42
286 2301 41 1 247 <A 23
== Executing PA-CTR 1, V(1)=43, V(2)=2, repcount=15, factor=5/3
481 6036 -4 1 22 <A 278
482 6037 -3 1 2 1 A> 278
483 6115 75 1 2 179 A>
484 6116 76 1 2 180 B>
485 6117 75 1 2 180 <A 3
486 6197 -5 1 2 <A 280 3
487 6198 -4 12 A> 280 3
488 6278 76 182 A> 3
489 6279 75 182 <A 1
490 6361 -7 <A 282 1
491 6362 -6 1 B> 282 1
492 6444 76 1 282 B> 1
493 6445 77 1 282 1 H>
493 6445 77 1 282 1 H> [stop]
Lines: 78
Top steps: 76
Macro steps: 493
Basic steps: 6445
Tape index: 77
nonzeros: 84
log10(nonzeros): 1.924
log10(steps ): 3.809
Run state: stop
Input to awk program:
gohalt 1
nbs 4
T 2-state 4-symbol contender (cited from P.Michel)
: 84 6445
5T 1RB 2LA 1RA 1LA 3LA 1RH 2RB 2LA
L 6
M 201
pref sim
machv TM24_a just simple
machv TM24_a-r with repetitions reduced
machv TM24_a-1 with tape symbol exponents
machv TM24_a-m as 1-macro machine
machv TM24_a-a as 1-macro machine with pure additive config-TRs
iam TM24_a-a
mtype 1
mmtyp 3
r 1
H 1
mac 0
E 2
sympr
HM 1
date Tue Jul 6 22:12:35 CEST 2010
edate Tue Jul 6 22:12:35 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:35 CEST 2010