Rosetta Code

Universal Turing machine: Difference between revisions

Page Discussion

Universal Turing machine (view source)

Revision as of 23:51, 30 August 2018

898 bytes removed ,  5 years ago
m
→‎{{header|Fōrmulæ}}
Line 2,059:
=={{header|Fōrmulæ}}==
 
Unfortunately images cannot be uploaded in Rosetta Code, follow [http://dictionary.formulae.org/Universal_Turing_Machine this] link.
A Fōrmulæ program, and in general any Fōrmulæ expression is a Abtract Syntax Tree that can be visualized in many ways.
 
Unfortunately images cannot be uploaded in Rosetta Code, so links to actual images are provided.
 
==== Program ====
 
The following is a function definition of a Turing Machine: [http://www.formulae.org/rosettacode/TuringMachineProgramCode.png Click or tap]
 
==== Simple incrementer ====
 
[http://www.formulae.org/rosettacode/TuringMachineOutput1.png Click or tap]
 
==== Task: Two-state busy beaver ====
 
[http://www.formulae.org/rosettacode/TuringMachineOutput2.png Click or tap]
 
==== Task: Three-state busy beaver ====
 
[http://www.formulae.org/rosettacode/TuringMachineOutput3.png Click or tap]
 
==== Task: Four-state busy beaver ====
 
[http://www.formulae.org/rosettacode/TuringMachineOutput4.png Click or tap]
 
==== Bonus task, Five-state busy beaver ====
 
The actual resulting tape is not shown, its size in shown instead.
 
[http://www.formulae.org/rosettacode/TuringMachineOutput5.png Click or tap]
 
=={{header|Fortran}}==
Laurence
2,121

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/224406"