Universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
Apple Bottom (talk | contribs) m Apple Bottom moved page Universal turing machine to Universal Turing machine: Turing is a name, and therefore should be capitalized. |
No edit summary |
||
| (8 intermediate revisions by 4 users not shown) | |||
| Line 5: | Line 5: | ||
|bx = 12699 | |bx = 12699 | ||
|by = 12652 | |by = 12652 | ||
|symmetry = C1 | |||
|discoverer = Paul Rendell | |discoverer = Paul Rendell | ||
|discoveryear = 2010 | |discoveryear = 2010 | ||
|rle = true | |rle = true | ||
}} | }} | ||
The ''' | 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, {{year|2010}}. This pattern is an extension of Paul Rendell's [[Turing machine]] and, being a universal Turing machine, is also [http://rendell-attic.org/gol/utm/utmtm.htm capable of simulating it]. | ||
In March 23, 2011, the pattern was extended further into the [[fully universal Turing machine]]. | |||
== | == Gallery == | ||
{| class="wikitable" style="text-align:center" | |||
| [[File:Universalturingmachine large.png|300px]] | |||
|- | |||
| Layout of the Universal Turing machine | |||
|} | |||
==External links== | == See also == | ||
*[http://rendell-attic.org/gol/utm/index.htm A Universal Turing Machine in Conway's Game of Life] - Official site by Paul Rendell | * [[Turing machine]] | ||
{{LinkWikipedia|Universal_Turing_machine|name=Universal Turing machine}} | * [[Universal computer]] | ||
* [[Universal constructor]] | |||
== 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 | |||
* {{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}} | |||
[[Category:Infinite growth]] | |||
[[Category:Universal computation]] | |||
Latest revision as of 16:40, 21 August 2024
| Universal Turing machine | |||||
| |||||
| View static image | |||||
| Pattern type | Miscellaneous | ||||
|---|---|---|---|---|---|
| Number of cells | 252192 | ||||
| Bounding box | 12699 × 12652 | ||||
| Static symmetry | C1 | ||||
| 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.
Gallery
|
| Layout of the Universal Turing machine |
See also
External links
- A Universal Turing Machine in Conway's Game of Life - Official site by Paul Rendell
- Turing machines at Game of Life News. Posted by Adam P. Goucher on January 10, 2011.
- Universal Turing machine at Wikipedia