Fully universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
mNo edit summary |
||
| Line 3: | Line 3: | ||
|discoverer = Paul Rendell | |discoverer = Paul Rendell | ||
|discoveryear = 2011 | |discoveryear = 2011 | ||
|nofile | |nofile = true | ||
}} | }} | ||
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: | 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: | ||
Revision as of 01:28, 16 May 2019
| 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).
See also
External links
- A Fully Universal Turing Machine - Official site by Paul Rendell