Universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
m capitalization |
mNo edit summary |
||
| Line 9: | Line 9: | ||
|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, [[:Category:Patterns found in 2010|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 [[ | In March 23, 2011, the pattern was extended further into the [[fully universal Turing machine]]. | ||
==Gallery== | ==Gallery== | ||
Revision as of 19:01, 30 April 2019
| 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
- Universal Turing machine at Wikipedia