Anonymous user
Universal Turing machine: Difference between revisions
→{{header|Lambdatalk}}: minor edit
(adding lambdatalk) |
(→{{header|Lambdatalk}}: minor edit) |
||
Line 4,840:
=={{header|Lambdatalk}}==
<lang scheme>
{require lib_H}
{def tm
{def tm.r
{lambda {:data :rules :state :end :blank :i :N}
{if {or {W.equal? :state :end} {> :N
then :data
else {let { {:
{:end :end} {:blank :blank} {:rules :rules}▼
{:i :i} {:nb :nb} ▼
{:state {H.get :state :rules}}
{:cell {if {W.equal? {A.get :i :data} undefined}
then :blank
Line 4,967:
1 {H.new write 0 | move -1 | next A}}
} A K 0}
output: busy_beaver2: [] -> [1,1,1,1,1,1,1,1,1,1,1]
</lang>
| |||