Difference between revisions of "Fully universal Turing machine"
Jump to navigation
Jump to search
m |
({{stub}}) |
||
(One intermediate revision by the same user not shown) | |||
Line 4: | Line 4: | ||
|discoveryear = 2011 | |discoveryear = 2011 | ||
|nofile = true | |nofile = true | ||
}} | }}{{stub}} | ||
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: | ||
Line 10: | Line 10: | ||
* 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 rakes (the final version). | * 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 (spaceship)|lobster]], on the [[ConwayLife.com]] forums.<ref name="post6325" /> | |||
==See also== | ==See also== | ||
Line 15: | Line 17: | ||
*[[Universal computer]] | *[[Universal computer]] | ||
*[[Universal constructor]] | *[[Universal constructor]] | ||
==References== | |||
<references> | |||
<ref name="post6325">{{LinkForumThread | |||
|format = ref | |||
|title = Patterns of the Year 2011 | |||
|p = 6325 | |||
|author = beebop | |||
|date = February 28, 2012 | |||
}}</ref> | |||
</references> | |||
==External links== | ==External links== | ||
*[http://rendell-attic.org/gol/fullutm/index.htm A Fully Universal Turing Machine] - Official site by Paul Rendell | *[http://rendell-attic.org/gol/fullutm/index.htm A Fully Universal Turing Machine] - Official site by Paul Rendell |
Revision as of 04:30, 31 December 2019
Fully universal Turing machine | ||
| ||
View static image | ||
Pattern type | Miscellaneous | |
---|---|---|
Discovered by | Paul Rendell | |
Year of discovery | 2011 |
This article is a stub. You can help LifeWiki by expanding it. |
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