A Universal Turing Machine in Conway's Game of Life

@article{Rendell2011AUT,
  title={A Universal Turing Machine in Conway's Game of Life},
  author={Paul W. Rendell},
  journal={2011 International Conference on High Performance Computing & Simulation},
  year={2011},
  pages={764-772}
}
In this paper we present a Universal Turing Machine build in the Cellular Automaton Conway's Game of Life. This is an extension of the Turing Machine built previously by the author [10]. It is example of spatio-temporal collision based computation and has infinite tape provided by two stack structures which grow continuously using collision based construction. Two patterns the fanout and takeout are described which are key in solving the routing and synchronization problems. The procedure used… CONTINUE READING
Highly Cited
This paper has 25 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Turing universality of the game of life (Collisionbased computing Pages: 513

P. Rendell
2001
View 12 Excerpts
Highly Influenced

R.K.Winning Ways for your Mathematical Plays (2nd ed.). A K

R BerlekampE., Conway John Horton, Guy
2001
View 1 Excerpt

Conway ’ s Game of Life Turing Machine

P. Rendell
-1

Similar Papers

Loading similar papers…