Revision as of 00:59, 1 June 2022 (view source) Cyril Nocton (talk \| contribs) m (→‎Tmcl version) ← Older edit		Revision as of 20:07, 1 June 2022 (view source) Cyril Nocton (talk \| contribs) m (→‎Tmcl version) Newer edit →
Line 2,384: '>' : move right '@' : state <- op <symbol> : op <- symbol</pre> 2. Interpreter Line 2,395: <lang lisp>(defun run (table input state halt blank) ;; ~~bugs / questions~~help : cyril nocton <cyril.nocton:gmail.com> (let (lStack (rStack input) ~~rule~~code operand match) (loop until (eql state halt) do (setf ~~rule~~code (cdr (assoc state table)) operand 'null match t) (dolist (symbol ~~rule~~code) (case symbol (= (setf match (eql (car rStack) operand)))

Universal Turing machine (view source)