Fully universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
Stub |
No edit summary |
||
| Line 5: | Line 5: | ||
|nofile = true | |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 produced by two complex [[ | 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]] | * 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 rake]]s; | * A [[c/5 diagonal]] stack constructor using [[Matthias Merzenich]]'s [[c/5 diagonal rake]]s; | ||
* An expanding stack constructor comprising two perpendicular [[c/2 orthogonal]] convoys of | * An expanding stack constructor comprising two perpendicular [[c/2 orthogonal]] convoys of rakes (the final version). | ||
==See also== | ==See also== | ||
Revision as of 15:52, 30 April 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