Jump to content

Universal Turing machine: Difference between revisions

m
Line 2,390:
Tape is split into two stacks (aka lists).
 
<pre>T = reverse (lStack) . rStack ; rStack (0) is the scanned symbol.</pre>
0</pre>
 
The simpler the better.
Line 2,421 ⟶ 2,422:
(c . (0 = 1 % < b @ 1 = % halt @))))</lang>
 
4. ExecutionInvocation
 
<pre>(run +incrementer+ '(1 1 1) 'q0 'qf 'b)
Line 2,427 ⟶ 2,428:
 
{{out}}
<pre>M = (HALTQF, 111.1111)
M = (QFHALT, 111.1111)</pre>
 
That's all Folks !
422

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.