Universal Turing machine: Difference between revisions

From LifeWiki
Jump to navigation Jump to search
→Gallery: better view of img
Confocal (talk | contribs)
m →External links: category, formatting
Line 26: Line 26:


==External links==
==External links==
*[http://rendell-attic.org/gol/utm/index.htm A Universal Turing Machine in Conway's Game of Life] - Official site by Paul Rendell
* [http://rendell-attic.org/gol/utm/index.htm A Universal Turing Machine in Conway's Game of Life] - Official site by Paul Rendell
* {{LinkGoLNews|2011/01/turing_machines_1.html|title=Turing machines|author=Adam P. Goucher|date=January 10, 2011}}
* {{LinkGoLNews|2011/01/turing_machines_1.html|title=Turing machines|author=Adam P. Goucher|date=January 10, 2011}}
{{LinkWikipedia|Universal_Turing_machine|name=Universal Turing machine}}
* {{LinkWikipedia|Universal_Turing_machine|name=Universal Turing machine}}


[[Category:Infinite growth]]
[[Category:Infinite growth]]
[[Category:Universal computation]]

Revision as of 05:20, 24 March 2023

Universal Turing machine
Universal Turing machine image
Pattern type Miscellaneous
Number of cells 252192
Bounding box 12699 × 12652
Static symmetry Unspecified
Discovered by Paul Rendell
Year of discovery 2010

The universal Turing machine is a pattern that is, by definition, capable of simulating every other Turing machine. It was created by Paul Rendell and its construction was completed on February 10, 2010. This pattern is an extension of Paul Rendell's Turing machine and, being a universal Turing machine, is also capable of simulating it.

In March 23, 2011, the pattern was extended further into the fully universal Turing machine.

Layout of the Universal Turing machine

See also