Fully universal Turing machine
Jump to navigation
Jump to search
| Fully universal Turing machine | ||
| ||
| View static image | ||
| Pattern type | Miscellaneous | |
|---|---|---|
| Static symmetry | Unspecified | |
| Discovered by | Paul Rendell | |
| Year of discovery | 2011 | |
The fully universal Turing machine is an extension of Paul Rendell's universal Turing machine. Its tape is perfectly diagonal (instead of oblique), and the memory cells of the tape are continuously produced by two complex rake convoys. Rendell experimented with three different variants of this mechanism:
- A c/12 diagonal stack constructor using Cordership-based rakes (very large);
- A c/5 diagonal stack constructor using Matthias Merzenich's c/5 diagonal rakes;
- An expanding stack constructor comprising two perpendicular c/2 orthogonal convoys of rakes (the final version).
It was voted Pattern of the Year 2011, along with the lobster, on the ConwayLife.com forums.[1]
See also
References
- ↑ beebop (February 28, 2012). Patterns of the Year 2011 (discussion thread) at the ConwayLife.com forums
External links
- A Fully Universal Turing Machine - Official site by Paul Rendell