Universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
The number of cells as reported by Golly. |
Apple Bottom (talk | contribs) {{Requestpatternfile}} |
||
| Line 1: | Line 1: | ||
{{Requestpatternfile}} | |||
{{Pattern|name=Universal turing machine|pname=universalturingmachinesmall|bx=12699|by=12652|c=252192|discoverer=Paul Rendell|discoveryear=2010|nofile=true}} | {{Pattern|name=Universal turing machine|pname=universalturingmachinesmall|bx=12699|by=12652|c=252192|discoverer=Paul Rendell|discoveryear=2010|nofile=true}} | ||
The '''Universal turing machine''' is a [[pattern]] that is, by definition of a [http://en.wikipedia.org/wiki/Universal_Turing_machine universal turing machine], 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]. | The '''Universal turing machine''' is a [[pattern]] that is, by definition of a [http://en.wikipedia.org/wiki/Universal_Turing_machine universal turing machine], 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]. | ||
Revision as of 10:39, 21 April 2016
|
This page does not link to a downloadable pattern file.
If you have access to this pattern in RLE format (or any other common file format), please add it to the RLE namespace or post it in this forum thread. Consider checking Google and other pattern archives for a copy of this pattern. |
| 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 of a universal turing machine, 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.
See also
External links
- A Universal Turing Machine in Conway's Game of Life - Official site by Paul Rendell