Universal Turing machine
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.
| Universal Turing machine | |||||
| |||||
| View static image | |||||
| Pattern type | Miscellaneous | ||||
|---|---|---|---|---|---|
| Number of cells | 252192 | ||||
| Bounding box | 12699×12652 | ||||
| Discovered by | Paul Rendell | ||||
| Year of discovery | 2010 | ||||
| |||||
In March 23, 2011, the pattern was extended further into the fully universal Turing machine.
Gallery
Layout of the Universal Turing machine.
gollark: LyricLy will shortly be reimplemented in Rust.
gollark: LyricLy is a Rust user confirmed?
gollark: https://images-ext-2.discordapp.net/external/EuSLqjpzKjn-qQWvk6RRS6hsfSVBCcrFXrYjbbLT8LI/https/pbs.twimg.com/media/FBPhx4ZWQAETx0i.jpg%3Alarge?width=444&height=622
gollark: How inductuous!
gollark: How do you prove the (nontrivial (not 10, 5, 2)) divisibility rules anyway?
External links
- A Universal Turing Machine in Conway's Game of Life - Official site by Paul Rendell
- Universal Turing machine at Wikipedia
This article is issued from Conwaylife. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.