Comment: This TM produces 90 nonzeros in 7195 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 | 1LA | 1RA | 1 | right | B | 3 | left | A | 1 | left | A | 1 | right | A |
| B | 2LA | 1RH | 3RA | 3RB | 2 | left | A | 1 | right | H | 3 | right | A | 3 | right | B |
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 2
3 3 -1 <A 3 2
4 4 0 1 B> 3 2
5 5 1 1 3 B> 2
6 6 2 1 32 A>
7 7 3 1 32 1 B>
8 8 2 1 32 1 <A 2
9 9 1 1 32 <A 3 2
10 10 2 1 3 1 A> 3 2
11 11 3 1 3 12 A> 2
12 12 2 1 3 12 <A 1
13 14 0 1 3 <A 32 1
14 15 1 12 A> 32 1
15 17 3 14 A> 1
16 18 2 14 <A 3
17 22 -2 <A 35
18 23 -1 1 B> 35
19 28 4 1 35 B>
20 29 3 1 35 <A 2
21 30 4 1 34 1 A> 2
22 31 3 1 34 1 <A 1
23 32 2 1 34 <A 3 1
24 33 3 1 33 1 A> 3 1
25 34 4 1 33 12 A> 1
26 35 3 1 33 12 <A 3
27 37 1 1 33 <A 33
28 38 2 1 32 1 A> 33
29 41 5 1 32 14 A>
30 42 6 1 32 15 B>
31 43 5 1 32 15 <A 2
32 48 0 1 32 <A 35 2
33 49 1 1 3 1 A> 35 2
34 54 6 1 3 16 A> 2
>> Try to prove a PA-CTR with 2 Vars...
0 0 0 [*]* 34+V(2) 11+V(1) A> 2
1 1 -1 [*]* 34+V(2) 11+V(1) <A 1
2 2+V(1) -2+-1*V(1) [*]* 34+V(2) <A 31+V(1) 1
3 3+V(1) -1+-1*V(1) [*]* 33+V(2) 1 A> 31+V(1) 1
4 4+2*V(1) 0 [*]* 33+V(2) 12+V(1) A> 1
5 5+2*V(1) -1 [*]* 33+V(2) 12+V(1) <A 3
6 7+3*V(1) -3+-1*V(1) [*]* 33+V(2) <A 33+V(1)
7 8+3*V(1) -2+-1*V(1) [*]* 32+V(2) 1 A> 33+V(1)
8 11+4*V(1) 1 [*]* 32+V(2) 14+V(1) A>
9 12+4*V(1) 2 [*]* 32+V(2) 15+V(1) B>
10 13+4*V(1) 1 [*]* 32+V(2) 15+V(1) <A 2
11 18+5*V(1) -4+-1*V(1) [*]* 32+V(2) <A 35+V(1) 2
12 19+5*V(1) -3+-1*V(1) [*]* 31+V(2) 1 A> 35+V(1) 2
13 24+6*V(1) 2 [*]* 31+V(2) 16+V(1) A> 2
<< Success! ==> defined new CTR 1 (PA)
35 55 5 1 3 16 <A 1
36 61 -1 1 3 <A 36 1
37 62 0 12 A> 36 1
38 68 6 18 A> 1
39 69 5 18 <A 3
40 77 -3 <A 39
41 78 -2 1 B> 39
42 87 7 1 39 B>
43 88 6 1 39 <A 2
44 89 7 1 38 1 A> 2
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 11+V(2) 3 12+V(1) A> 2
1 1 -1 11+V(2) 3 12+V(1) <A 1
2 3+V(1) -3+-1*V(1) 11+V(2) 3 <A 32+V(1) 1
3 4+V(1) -2+-1*V(1) 12+V(2) A> 32+V(1) 1
4 6+2*V(1) 0 14+V(1)+V(2) A> 1
5 7+2*V(1) -1 14+V(1)+V(2) <A 3
6 11+3*V(1)+V(2) -5+-1*V(1)+-1*V(2) <A 35+V(1)+V(2)
7 12+3*V(1)+V(2) -4+-1*V(1)+-1*V(2) 1 B> 35+V(1)+V(2)
8 17+4*V(1)+2*V(2) 1 1 35+V(1)+V(2) B>
9 18+4*V(1)+2*V(2) 0 1 35+V(1)+V(2) <A 2
10 19+4*V(1)+2*V(2) 1 1 34+V(1)+V(2) 1 A> 2
<< Success! ==> defined new CTR 2 (PPA)
44 89 7 1 38 1 A> 2
== Executing PA-CTR 1, V(1)=0, V(2)=4, repcount=2, factor=5/3
70 167 11 1 32 111 A> 2
71 168 10 1 32 111 <A 1
72 179 -1 1 32 <A 311 1
73 180 0 1 3 1 A> 311 1
74 191 11 1 3 112 A> 1
75 192 10 1 3 112 <A 3
76 204 -2 1 3 <A 313
77 205 -1 12 A> 313
78 218 12 115 A>
79 219 13 116 B>
80 220 12 116 <A 2
81 236 -4 <A 316 2
82 237 -3 1 B> 316 2
83 253 13 1 316 B> 2
84 254 14 1 317 A>
85 255 15 1 317 1 B>
86 256 14 1 317 1 <A 2
87 257 13 1 317 <A 3 2
88 258 14 1 316 1 A> 3 2
89 259 15 1 316 12 A> 2
>> Try to prove a PPA-CTR with 2 Vars...
0 0 0 11+V(2) 32 11+V(1) A> 2
1 1 -1 11+V(2) 32 11+V(1) <A 1
2 2+V(1) -2+-1*V(1) 11+V(2) 32 <A 31+V(1) 1
3 3+V(1) -1+-1*V(1) 11+V(2) 3 1 A> 31+V(1) 1
4 4+2*V(1) 0 11+V(2) 3 12+V(1) A> 1
5 5+2*V(1) -1 11+V(2) 3 12+V(1) <A 3
6 7+3*V(1) -3+-1*V(1) 11+V(2) 3 <A 33+V(1)
7 8+3*V(1) -2+-1*V(1) 12+V(2) A> 33+V(1)
8 11+4*V(1) 1 15+V(1)+V(2) A>
9 12+4*V(1) 2 16+V(1)+V(2) B>
10 13+4*V(1) 1 16+V(1)+V(2) <A 2
11 19+5*V(1)+V(2) -5+-1*V(1)+-1*V(2) <A 36+V(1)+V(2) 2
12 20+5*V(1)+V(2) -4+-1*V(1)+-1*V(2) 1 B> 36+V(1)+V(2) 2
13 26+6*V(1)+2*V(2) 2 1 36+V(1)+V(2) B> 2
14 27+6*V(1)+2*V(2) 3 1 37+V(1)+V(2) A>
15 28+6*V(1)+2*V(2) 4 1 37+V(1)+V(2) 1 B>
16 29+6*V(1)+2*V(2) 3 1 37+V(1)+V(2) 1 <A 2
17 30+6*V(1)+2*V(2) 2 1 37+V(1)+V(2) <A 3 2
18 31+6*V(1)+2*V(2) 3 1 36+V(1)+V(2) 1 A> 3 2
19 32+6*V(1)+2*V(2) 4 1 36+V(1)+V(2) 12 A> 2
<< Success! ==> defined new CTR 3 (PPA)
89 259 15 1 316 12 A> 2
== Executing PA-CTR 1, V(1)=1, V(2)=12, repcount=5, factor=5/3
154 709 25 1 3 127 A> 2
== Executing PPA-CTR 2 (once), V(1)=25, V(2)=0
164 828 26 1 329 1 A> 2
== Executing PA-CTR 1, V(1)=0, V(2)=25, repcount=9, factor=5/3
281 2124 44 1 32 146 A> 2
== Executing PPA-CTR 3 (once), V(1)=45, V(2)=0
300 2426 48 1 351 12 A> 2
== Executing PA-CTR 1, V(1)=1, V(2)=47, repcount=16, factor=5/3
508 6506 80 1 33 182 A> 2
509 6507 79 1 33 182 <A 1
510 6589 -3 1 33 <A 382 1
511 6590 -2 1 32 1 A> 382 1
512 6672 80 1 32 183 A> 1
513 6673 79 1 32 183 <A 3
514 6756 -4 1 32 <A 384
515 6757 -3 1 3 1 A> 384
516 6841 81 1 3 185 A>
517 6842 82 1 3 186 B>
518 6843 81 1 3 186 <A 2
519 6929 -5 1 3 <A 386 2
520 6930 -4 12 A> 386 2
521 7016 82 188 A> 2
522 7017 81 188 <A 1
523 7105 -7 <A 388 1
524 7106 -6 1 B> 388 1
525 7194 82 1 388 B> 1
526 7195 83 1 388 1 H>
526 7195 83 1 388 1 H> [stop]
Lines: 89
Top steps: 87
Macro steps: 526
Basic steps: 7195
Tape index: 83
nonzeros: 90
log10(nonzeros): 1.954
log10(steps ): 3.857
Run state: stop
Input to awk program:
gohalt 1
nbs 4
T 2-state 4-symbol also formerly best (cited from P.Michel)
: 90 7195
5T 1RB 3LA 1LA 1RA 2LA 1RH 3RA 3RB
L 6
M 201
pref sim
machv TM24_b just simple
machv TM24_b-r with repetitions reduced
machv TM24_b-1 with tape symbol exponents
machv TM24_b-m as 1-macro machine
machv TM24_b-a as 1-macro machine with pure additive config-TRs
iam TM24_b-a
mtype 1
mmtyp 3
r 1
H 1
mac 0
E 2
sympr
HM 1
date Tue Jul 6 22:12:36 CEST 2010
edate Tue Jul 6 22:12:36 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:36 CEST 2010