Universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
→External links: LinkGoLNews (add 1) |
→Gallery: better view of img |
||
| Line 14: | Line 14: | ||
==Gallery== | ==Gallery== | ||
{|class="wikitable" style="text-align:center" | |||
|[[Image:Universalturingmachine large.png|300px]] | |||
|- | |||
|Layout of the Universal Turing machine | |||
|} | |||
==See also== | ==See also== | ||
Revision as of 00:10, 20 July 2022
| Universal Turing machine | |||||
| |||||
| View static 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.
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