237
edits
→Game of Life and Universal Computation
| Line 78: | Line 78: | ||
[[File:Sliding block memory Snapshot.png|450px]] [[File:Sliding block memory Schematic.png|450px]] | [[File:Sliding block memory Snapshot.png|450px]] [[File:Sliding block memory Schematic.png|450px]] | ||
It is possible to construct logic gates such as AND, OR and NOT using gliders. It is possible to build a pattern that acts like a finite state machine connected to two counters. This has the same computational power as a universal Turing machine, so the Game of Life is theoretically as powerful as any computer with unlimited memory and no time constraints: it is Turing complete. | |||
Paul Rendell has implemented a [http://rendell-attic.org/gol/utm/ Universal Turing Machine] in Conway’s Game of Life in 2010. The left picture shows the pattern of it. The right Figure shows the general scheme of this Turing Machine. | Paul Rendell has implemented a [http://rendell-attic.org/gol/utm/ Universal Turing Machine] in Conway’s Game of Life in 2010. The left picture shows the pattern of it. The right Figure shows the general scheme of this Turing Machine. | ||