Fully universal Turing machine: Difference between revisions
Jump to navigation
Jump to search
images |
ref |
||
| Line 15: | Line 15: | ||
{|class="wikitable" style="width:425px;" | {|class="wikitable" style="width:425px;" | ||
|[[File:fullyuniversalturingmachine1.png]]{{br}}The initial UTM state. The dotted line going up to the right is the program for the stack. | |[[File:fullyuniversalturingmachine1.png]]{{br}}The initial UTM state. The dotted line going up to the right is the program for the stack.<ref name="utm1" /> | ||
|- | |- | ||
|[[File:fullyuniversalturingmachine2.png]]{{br}}The image above on left is after 149 million generations. The line running down to the left in the middle is the trace of each address of the finite state machine and is very sparse. The distance this line has moved from the stack is related to the time that [[Golly]] was running after the UTM stopped. The length of this line is related to the time the UTM was running. | |[[File:fullyuniversalturingmachine2.png]]{{br}}The image above on left is after 149 million generations. The line running down to the left in the middle is the trace of each address of the finite state machine and is very sparse. The distance this line has moved from the stack is related to the time that [[Golly]] was running after the UTM stopped. The length of this line is related to the time the UTM was running.<ref name="utm1" /> | ||
|} | |} | ||
| Line 26: | Line 26: | ||
==References== | ==References== | ||
<references /> | <references> | ||
<ref name="utm1">[http://rendell-attic.org/gol/fullutm/index.htm A Fully Universal Turing Machine] - Official site by Paul Rendell</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 23:45, 19 January 2023
| 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).
The fully universal Turing machine was voted Pattern of the Year for 2011 on the ConwayLife.com forums, tied with the Lobster.[1]
 The initial UTM state. The dotted line going up to the right is the program for the stack.[2] |
 The image above on left is after 149 million generations. The line running down to the left in the middle is the trace of each address of the finite state machine and is very sparse. The distance this line has moved from the stack is related to the time that Golly was running after the UTM stopped. The length of this line is related to the time the UTM was running.[2] |
See also
References
- ↑ beebop (February 28, 2012). Patterns of the Year 2011 (discussion thread) at the ConwayLife.com forums
- ↑ 2.0 2.1 A Fully Universal Turing Machine - Official site by Paul Rendell
External links
- A Fully Universal Turing Machine - Official site by Paul Rendell