-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathUTM.java
More file actions
462 lines (359 loc) · 12.5 KB
/
UTM.java
File metadata and controls
462 lines (359 loc) · 12.5 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
/*
Michael Toth
CS125 - Universal Turing Machine
Info:
Alphabet: {'0', '1', '#' }, '#' dictates blank symbol
Tape: 'R' and 'L' dictate right and left respectively
States: {<Current State>, <Input Symbol>, <Write>, <New State>, <Move>}
<Input Symbol>: Current symbol on the tape
<Write>: aplhabet symbol to write to the tape
<Move>: 'L' or 'R', the direction to move the tape or 'H' for halt
*/
import java.util.ArrayList;
public class UTM{
public Tape tape;
private State currentState;
private State state0;
private State state1;
private State state2;
private State state3;
private State state4;
private State state5;
private State state6;
private State state7;
private State state8;
private State state9;
private State state10;
private State state11;
private State state12;
private char print;
public enum OPS{
BUSYBEAVER3, BUSYBEAVER4, BUSYBEAVER5, ADDITION, SUBTRACTION, MULTIPLICATION, COUNTER, NTCOUNTER
}
public UTM(char verbose){
if(verbose == 'y'){
print = '1';
}else{
print = '0';
}
}
//Constructor for counting
public UTM(OPS program, int bits, char verbose){
this(verbose);
String w = "";
for(int i=0; i<bits; i++){
w=w+"0";
}
//Load the tape with the string
tape = new Tape(w);
String outMessage ="";
//Create the counting transition functions
if(program == OPS.COUNTER){
initCounting();
outMessage = "|Counts from 0 through 2 raised to the power of " + bits;
}
if(program == OPS.NTCOUNTER){
initNonTerminatingCounting();
outMessage = "|Counts from 0 to infinity";
}
System.out.println("\n|||>> UTM "+ program);
System.out.println(outMessage);
//Initialize the TM
run();
}//end: Constructor
//Constructor for busy beaver or generic program
public UTM(OPS program, char verbose){
this(verbose);
//Create the busybeaver transition functions
switch(program){
case BUSYBEAVER3:
case BUSYBEAVER4:
case BUSYBEAVER5:
//Load the tape with a blank string
tape = new Tape("#");
initBusyBeaver(program);
break;
}
//output header
System.out.println("\n|||>> UTM " + program);
run();
}//end: Contructor - BUSYBEAVER
//Constructor for addition/subtraction/multiplication
public UTM(OPS program, char verbose, int M, int N){
this(verbose);
if(program == OPS.ADDITION || program == OPS.SUBTRACTION || program == OPS.MULTIPLICATION){
String w = "";
for(int i=0; i<M; i++){
w = w + "0";
}
w = w + "1";
for(int i=0; i<N; i++){
w = w+ "0";
}
tape = new Tape(w);
}
String outMessage = "";
if(program == OPS.ADDITION){
initAddition();
outMessage = "Sum: ";
}
if(program == OPS.SUBTRACTION){
initSubtraction();
outMessage = "Difference: ";
}
if(program == OPS.MULTIPLICATION){
initMultiplication();
outMessage = "Product: ";
}
System.out.println("\n|||>> UTM " + program);
System.out.println("|"+M + " + " + N + " = # 0's in final tape");
run();
System.out.println("|"+outMessage + tape.addZeros());
}
//run(): Starts reading the tape with the current states
public void run(){
currentState = state0;
//Print the current tape
System.out.println("|");
System.out.println("|Initial Tape");
System.out.println("|" + tape.toString());
System.out.println("|");
long startTime = System.nanoTime();
//Transition the state to the next with the input symbol
int i = 0;
while(currentState.isHalted()==false){
currentState = currentState.transition(tape.read(), i);
i++;
}
long estimatedTime = System.nanoTime() - startTime;
double timeMS = (double)estimatedTime / 1000000.0;
System.out.println("|Completed in " + i + " steps");
System.out.println("|Elapsed Time: " + timeMS + "ms");
}//end: run()
public void initMultiplication(){
state0 = new State(tape);
state1 = new State(tape);
state2 = new State(tape);
state3 = new State(tape);
state4 = new State(tape);
state5 = new State(tape);
state6 = new State(tape);
state7 = new State(tape);
state8 = new State(tape);
state9 = new State(tape);
state10 = new State(tape);
state11 = new State(tape);
state12 = new State(tape);
//state0
state0.addTransition('#', '#', state0, 'R', print);
state0.addTransition('1', '1', state0, 'R', print);
state0.addTransition('0', '1', state1, 'R', print);
//state1
state1.addTransition('#', '#', state2, 'R', print);
state1.addTransition('1', '1', state2, 'R', print);
state1.addTransition('0', '0', state1, 'R', print);
//state2
state2.addTransition('#', '#', state2, 'H', '1');
state2.addTransition('1', '1', state2, 'H', '1');
state2.addTransition('0', '1', state3, 'R', print);
//state3
state3.addTransition('#', '#', state4, 'R', print);
state3.addTransition('1', '1', state4, 'R', print);
state3.addTransition('0', '0', state3, 'R', print);
//state4
state4.addTransition('#', '0', state5, 'L', print);
state4.addTransition('1', '0', state5, 'L', print);
state4.addTransition('0', '0', state4, 'R', print);
//state5
state5.addTransition('#', '#', state6, 'L', print);
state5.addTransition('1', '1', state6, 'L', print);
state5.addTransition('0', '0', state5, 'L', print);
//state6
state6.addTransition('#', '0', state8, 'L', print);
state6.addTransition('1', '0', state8, 'L', print);
state6.addTransition('0', '0', state7, 'L', print);
//state7
state7.addTransition('#', '0', state2, 'R', print);
state7.addTransition('1', '0', state2, 'R', print);
state7.addTransition('0', '0', state7, 'L', print);
//state8
state8.addTransition('#', '#', state9, 'L', print);
state8.addTransition('1', '1', state9, 'L', print);
state8.addTransition('0', '0', state8, 'L', print);
//state9
state9.addTransition('#', '#', state11, 'R', print);
state9.addTransition('1', '1', state11, 'R', print);
state9.addTransition('0', '0', state10, 'L', print);
//state10
state10.addTransition('#', '#', state0, 'R', print);
state10.addTransition('1', '1', state0, 'R', print);
state10.addTransition('0', '0', state10, 'L', print);
//state11
state11.addTransition('#', '#', state11, 'R', print);
state11.addTransition('1', '1', state11, 'R', print);
state11.addTransition('0', '1', state12, 'R', print);
//state12
state12.addTransition('#', '#', state12, 'H', '1');
state12.addTransition('1', '1', state12, 'H', '1');
state12.addTransition('0', '1', state12, 'R', print);
}
public void initAddition(){
state0 = new State(tape);
state1 = new State(tape);
state2 = new State(tape);
state3 = new State(tape);
state4 = new State(tape);
//state0
state0.addTransition('0', '0', state1, 'R', print);
state0.addTransition('1', '1', state0, 'R', print);
//state1
state1.addTransition('1', '0', state2, 'R', print);
state1.addTransition('0', '0', state1, 'R', print);
//state2
state2.addTransition('#', '#', state3, 'L', print);
state2.addTransition('1', '1', state3, 'L', print);
state2.addTransition('0', '0', state2, 'R', print);
//state3
state3.addTransition('0', '#', state4, 'L', print);
//state4
state4.addTransition('0', '0', state4, 'L', print);
state4.addTransition('1', '1', state4, 'H', '1');
state4.addTransition('#', '#', state4, 'H', '1');
}
//initBusyBeaver(): creates transition functions for busy beaver
public void initBusyBeaver(OPS BBtype){
//initialize states
state0 = new State(tape);
state1 = new State(tape);
state2 = new State(tape);
switch(BBtype){
case BUSYBEAVER3:
//Add transitions;
//==>addTransition(<read>,<write>,<next state>, <action>, <printOutput: '0'=false, '1'=true>)
//state0
state0.addTransition('0', '1', state1, 'R', '1');
state0.addTransition('1', '1', state0, 'H', '1');
state0.addTransition('#', '1', state1, 'R', '1');
//state1
state1.addTransition('0', '0', state2, 'R', '1');
state1.addTransition('1', '1', state1, 'R', '1');
state1.addTransition('#', '0', state2, 'R', '1');
//state2
state2.addTransition('0', '1', state2, 'L', '1');
state2.addTransition('1', '1', state0, 'L', '1');
state2.addTransition('#', '1', state2, 'L', '1');
break;
case BUSYBEAVER4:
state3 = new State(tape);
//state0
state0.addTransition('0', '1', state1, 'R', print);
state0.addTransition('1', '1', state1, 'L', print);
state0.addTransition('#', '1', state1, 'R', print);
//state1
state1.addTransition('0', '1', state0, 'L', print);
state1.addTransition('1', '0', state2, 'L', print);
state1.addTransition('#', '1', state0, 'L', print);
//state2
state2.addTransition('0', '1', state2, 'H', '1');
state2.addTransition('1', '1', state3, 'L', print);
state2.addTransition('#', '1', state2, 'H', '1');
//state3
state3.addTransition('0', '1', state3, 'R', print);
state3.addTransition('1', '0', state0, 'R', print);
state3.addTransition('#', '1', state3, 'R', print);
break;
case BUSYBEAVER5:
state3 = new State(tape);
state4 = new State(tape);
//state0
state0.addTransition('0', '1', state1, 'R', print);
state0.addTransition('#', '1', state1, 'R', print);
state0.addTransition('1', '1', state2, 'L', print);
//state1
state1.addTransition('0', '1', state2, 'R', print);
state1.addTransition('#', '1', state2, 'R', print);
state1.addTransition('1', '1', state1, 'R', print);
//state2
state2.addTransition('0', '1', state3, 'R', print);
state2.addTransition('#', '1', state3, 'R', print);
state2.addTransition('1', '0', state4, 'L', print);
//state3
state3.addTransition('0', '1', state0, 'L', print);
state3.addTransition('#', '1', state0, 'L', print);
state3.addTransition('1', '1', state3, 'L', print);
//state4
state4.addTransition('0', '1', state4, 'H', print);
state4.addTransition('#', '1', state4, 'H', print);
state4.addTransition('1', '0', state0, 'L', print);
break;
}
}//end: initBusyBeaver()
//initSubtraction(): creates transition functions for subtraciton
public void initSubtraction(){
//initialize states
state0 = new State(tape);
state1 = new State(tape);
state2 = new State(tape);
state3 = new State(tape);
state4 = new State(tape);
state5 = new State(tape);
state6 = new State(tape);
//Add transitions;
//==>addTransition(<read>,<write>,<next state>, <action>, <printOutput: '0'=false, '1'=true>)
//state0
state0.addTransition('0', '#', state1, 'R', print);
state0.addTransition('1', '#', state5, 'R', print);
//state1
state1.addTransition('0', '0', state1, 'R', print);
state1.addTransition('1', '1', state2, 'R', print);
//state2
state2.addTransition('0', '1', state3, 'L', print);
state2.addTransition('1', '1', state2, 'R', print);
state2.addTransition('#', '#', state4, 'L', print);
//state3
state3.addTransition('0', '0', state3, 'L', print);
state3.addTransition('1', '1', state3, 'L', print);
state3.addTransition('#', '#', state0, 'R', print);
//state4
state4.addTransition('0', '0', state4, 'L', print);
state4.addTransition('1', '#', state4, 'L', print);
state4.addTransition('#', '0', state6, 'H', '1');
//state5
state5.addTransition('0', '#', state5, 'R', print);
state5.addTransition('1', '#', state5, 'R', print);
state5.addTransition('#', '#', state6, 'H', print);
}//end: initSubtraction();
//createStates(): creations transition functions for counting
public void initCounting(){
//initialize states
state0 = new State(tape);
state1 = new State(tape);
state2 = new State(tape);
//Add transitions;
//addTransition(<read>,<write>,<next state>, <action>, <printOutput: '0'=false, '1'=true>)
//state0
state0.addTransition('0', '0', state0, 'R', print);
state0.addTransition('1', '1', state0, 'R', print);
state0.addTransition('#', '#', state1, 'L', print);
//state1
state1.addTransition('0', '1', state0, 'R', '1');
state1.addTransition('1', '0', state1, 'L', print);
state1.addTransition('#', '#', state2, 'H', print);
}//end: createStates()
public void initNonTerminatingCounting(){
//initialize states
state0 = new State(tape);
state1 = new State(tape);
state2 = new State(tape);
//Add transitions;
//addTransition(<read>,<write>,<next state>, <action>, <printOutput: '0'=false, '1'=true>)
//state0
state0.addTransition('0', '0', state0, 'R', print);
state0.addTransition('1', '1', state0, 'R', print);
state0.addTransition('#', '#', state1, 'L', print);
//state1
state1.addTransition('0', '1', state0, 'R', '1');
state1.addTransition('1', '0', state1, 'L', print);
state1.addTransition('#', '0', state0, 'R', print);
}
}//end: UTM