Universal Turing machine: Difference between revisions

← Older edit

Universal Turing machine (view source)

Revision as of 10:30, 15 February 2024

1,135 bytes added , 4 months ago

m

→‎{{header|Wren}}: Minor tidy

PureFox

9,488

edits

Revision as of 04:52, 11 June 2023 (view source) Laurence (talk \| contribs) m (→‎{{header\|Fōrmulæ}}) ← Older edit		Latest revision as of 10:30, 15 February 2024 (view source) PureFox (talk \| contribs) m (→‎{{header\|Wren}}: Minor tidy)
(One intermediate revision by one other user not shown)
Line 4,512: {{FormulaeEntry\|page=https://formulae.org/?script=examples/Universal_Turing_machine}} '''Solution''' [[File:Fōrmulæ - Universal Turing machine 01.png]] '''Test case 1. Simple incrementer''' [[File:Fōrmulæ - Universal Turing machine 02.png]] [[File:Fōrmulæ - Universal Turing machine 03.png]] '''Test case 2. One-state busy beaver game''' [[File:Fōrmulæ - Universal Turing machine 04.png]] [[File:Fōrmulæ - Universal Turing machine 05.png]] '''Test case 3. Two-state busy beaver game''' [[File:Fōrmulæ - Universal Turing machine 06.png]] [[File:Fōrmulæ - Universal Turing machine 07.png]] '''Test case 4. Three-state busy beaver game''' [[File:Fōrmulæ - Universal Turing machine 08.png]] [[File:Fōrmulæ - Universal Turing machine 09.png]] '''Test case 5. Four-state busy beaver game''' [[File:Fōrmulæ - Universal Turing machine 10.png]] [[File:Fōrmulæ - Universal Turing machine 11.png]] '''Test case 6. (Probable) Five-state busy beaver game''' In this case, the length of the tape is returned, and not the tape itself. This machine will run for more than 47 millions steps. [[File:Fōrmulæ - Universal Turing machine 12.png]] [[File:Fōrmulæ - Universal Turing machine 13.png]] =={{header\|Go}}== Line 12,275 ⟶ 12,319: {{libheader\|Wren-dynamic}} {{libheader\|Wren-fmt}} <syntaxhighlight lang="~~ecmascript~~wren">import "./dynamic" for Enum, Tuple, Struct import "./fmt" for Fmt var Dir = Enum.create("Dir", ["LEFT", "RIGHT", "STAY"])