Universal Turing machine: Difference between revisions
m
→Control language version
Cyril Nocton (talk | contribs) |
Cyril Nocton (talk | contribs) |
||
Line 2,395:
The simpler the better.
''TODO. Introduce Hopcroft & Ullman formal definition to explain variables names :-)
M = <Q, Γ, b, Σ, δ, q0 F>''
<lang lisp>
(defun run (δ r q0 F b)
(let (l code op x)
(loop until (member q0 F) do
| |||