Universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
Apple Bottom (talk | contribs) proper pname; rle=true; capitalize Turing (it's a name); add gallery with larger layout image; move Wikipedia link to extlinks section |
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 difference)
| |
Revision as of 23:41, 1 November 2016
| 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.
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