Turing machine universality of the game of life

Turing Machine Universality of the Game of Life

Volumn , Issue , 2015, Pages 1-177

  Rendell, Paul ^a  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR AUTOMATA; MACHINERY;

BACKGROUND INFORMATION; COUNTER MACHINES; MACHINE CONSTRUCTION; RELEVANT PATTERNS; STACK STRUCTURE; SUBJECT MATTERS; UNIVERSAL COMPUTATIONS; UNIVERSAL TURING MACHINE;

TURING MACHINES;

EID: 84954306917     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-319-19842-2     Document Type: Book

References (71)

1. Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)
2. Berlekamp, E., Conway, J., Guy, R.: What is life (Chapter 25). Winning Ways for Your Mathematical Plays, vol. 2. Academic Press, London (1982)
3. Chapman, P.: Life universal computer. http://www.igblan.free-online.co.uk/igblan/ca/ (2002)
4. Hickerson, D.: Sliding block memory. http://www.radicaleye.com/lifepage/patterns/sbm/sbm. html (1990)
5. Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215-240 (1996)
6. Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring Conway's Game of Life and other cellular automata. http://golly.sourceforge.net/ (2005)
7. Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1-35 (1984)
8. Gardner, M.: Mathematical games: the fantastic combinations of John Conway's new solitaire game 'life'. Sci. Am. 223, 120-123 (1970)
9. Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1-35 (1984)
10. Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1-40 (2004)
11. Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)
12. Berlekamp, E., Conway, J., Guy, R.: What is life, chapter 25. Winning Ways for Your Mathematical Plays, vol. 2. Academic Press, London (1982)
13. Kleene, S.C.: Introduction to Metamathematics. North-Holland Publishing Company/ Wolters-Noordhoff Publishing, Amsterdam (1952)
14. Turing, A.M.: On computable numbers, with applications to the Entscheidungs Problem. Proc. Lond. Math. Soc. 2, 230-265 (1937)
15. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
16. Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215-240 (1996). ISSN 0304-3975
17. Rendell, P.: A simple universal Turing machine for the game of life Turing machine, chapter 26. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 519-545. Springer, London (2010)
18. Britton, S.: Java Applet Turing Machine Simulator. http://ironphoenix.org/tril/tm/ (2009)
19. Moore, C., Mertens, S.: The Nature of Computation. Oxford University Press, Oxford (2011)
20. Hickerson, D.: Sliding block memory. http://www.radicaleye.com/lifepage/patterns/sbm/sbm. html (1990)
21. Berlekamp, E., Conway, J., Guy, R.:What is life.WinningWays for your Mathematical Plays. vol. 2, chapter 25. Academic Press, London (1982)
22. Chapman, P.: Life universal computer. http://www.igblan.free-online.co.uk/igblan/ca/ (2002)
23. Goucher, A.P.: Universal computation and construction in GoL cellular automata. In:Adamatzky, A. (ed.) Game of Life Cellular Automata, chapter, pp. 505-517. Springer (2010)
24. Goucher, A.P.: Game of Life News August 2009: Completed Universal Computer/Constructor. http://pentadecathlon.com/lifeNews/2009/08/post.html (2009)
25. Rogozhin, Y.: Small universal Turing machines. Theor. Comput. Sci. 168(2), 215-240 (1996). ISSN 0304-3975
26. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)
27. Neary, T., Woods, D.: Small weakly universal Turing machines. In: Proceedings of the 17th International Conference on Fundamentals of Computation Theory, FCT'09, pp. 262-273. Springer, Berlin (2009). ISBN 3-642-03408-X, 978-3-642-03408-4
28. Wolfram, S.: A New Kind of Science. Wolfram Media Inc., Champaign (2002)
29. Cook, M.: Universality in elementary cellular automata. Complex Syst. 15(1), 1-40 (2004)
30. Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1-35 (1984)
31. Smith, A.: Universality of Wolfram's 2, 3 Turing Machine, 2007. The Wolfram 2, 3 Turing Machine Research Prize 1. Rendell, P.: Turing universality of the game of life, chapter 18. In:Adamatzky,A. (ed.) Collision-Based Computing, pp. 513-539. Springer, London (2002). ISBN 1-85233-540-8
32. Leithner, D., Rott, P.: Dieter and Peter's gun collection. http://entropymine.com/jason/life/ dpguns/ (1996)
33. Rendell, P.: A simple universal Turing machine for the game of life Turing machine, chapter 26. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 519-545. Springer, London (2010)
34. Rendell, P.: JavaApplet Turing Machine Simulator. http://www.rendell-attic.org/gol/TMapplet (2009)
35. Rendell, P.: Conway's Game of Life Turing Machine. www.rendell-attic.org/gol (2000)
36. Bontes, J.: PC Program for Conway's Game Life. http://psoup.math.wisc.edu/Life32.html (pre 2002)
37. The Python Software Foundation. The Python Language. http://www.python.org (1990)
38. Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring Conway's Game of Life and other cellular automata. http://golly.sourceforge.net/ (2005)
39. Gosper, R.: Exploiting regularities in large cellular spaces. Phys. D: Nonlinear Phenom. 10, 75-80 (1984)
40. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Upper Saddle River (1967)
41. HP laptop with a 2.67 GHz Dual Core 64bit Intel processor and 3Gb of RAMrunningWindows 7
42. Rendell, P.: Universal Turing Machine in Conway's Game Life. http://www.rendell-attic.org/ gol/utm (2000)
43. Koopmans,T.C.,Beckmann, M.:Assignment Problems and theLocation ofEconomic Activities. Cowles Foundation Paper 108, reprinted fromEconometric Journal ofEconometric Society 25(1) (1957)
44. Loiola, E.M., Maria, N., Abreu,M., Boaventura-netto, P.O., Hahn, P., Querido, T.: An analytical survey for the quadratic assignment problem. Eur. J. Oper. Res. 657-690 (2007)
45. Rendell, P.: Java Applet Turing Machine Simulator. http://www.rendell-attic.org/gol/TMapplet (2009)
46. James, T., Rego, C., Glover, F.: Multistart Tabu search and diversification strategies for the quadratic assignment problem. IEEE Trans. Syst. Man Cybern. Part A: Syst. Hum. 39(3), 579-596 (2009)
47. Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Oper. Res. Lett. 16, 101-113 (1994). Seminare Maurey-Schwartz (1975-1976)
48. Reeves, C.R.: Landscapes, operators and heuristic search. Ann. Oper. Res. 86, 473-490 (1997)
49. Merz, P., Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem. Trans. Evol. Comput 4(4), 337-352 (2000). ISSN 1089-778X
50. Rendell, P.: Chapter 26-A simple universal turing machine for the game of life turing machine. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 519-545. Springer, London (2010)
51. HP laptop with a 2.67 GHz Dual Core 64bit Intel processor and 3 Gb of RAM running Windows 7
52. Leithner, D., Rott, P.: Dieter and Peter's gun collection. http://entropymine.com/jason/life/ dpguns/ (1996)
53. Niemiec, M.D.: Niemiec's Life Page-syntheses (1998). http://home.interserv.com/mniemiec/ lifepage.htm
54. Niemiec, M.D.: Niemiec's Life Page-syntheses (1998). http://pentadecathlon.com/objects/ objects.php
55. The Python Software Foundation. The Python Language (1990). http://www.python.org
56. Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring conway's Game of Life and other cellular automata (2005). http://golly.sourceforge.net/
57. Summers, J.: Jason Summers's pattern collections (2009). http://entropymine.com/jason/life/
58. Goucher, A.P.: PaulRendell's c/5 stack constructor (2011). http://pentadecathlon.com/lifeNews/2011/02/index.html
59. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, New Jersey (1967)
60. Rendell., P.: Java Applet Counter Machine Simulator/gol Counter Machine Generator. http:// www.rendell-attic.org/gol/UCM/index.htm (2011)
61. Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1-35 (1984)
62. Rendell, P.: Conway's Game of Life Turing Machine. www.rendell-attic.org/gol (2000)
63. Smith, A.: Universality of Wolfram's 2, 3 Turing Machine, 2007. The Wolfram 2, 3 Turing Machine Research Prize
64. Berlekamp, E., Conway, J., Guy, R.: What is life (Chapter 25). Winning Ways for Your Mathematical Plays, vol. 2. Academic Press, London (1982)
65. Silver, S.: Stephen Silver's Life Lexicon. http://www.argentum.freeserve.co.uk/lex_home.htm, pre (2000)
66. Trevorrow, A., Rokicki, T.: An open source, cross-platform application for exploring Conway's Game of Life and other cellular automata. http://golly.sourceforge.net/ (2005)
67. HP laptop with a 2.67 GHz Dual Core 64bit Intel processor and 3Gb ofRAMrunningWindows 7
68. Gosper, R.: Exploiting regularities in large cellular spaces. Phys. D: Nonlinear Phenom. 10, 75-80 (1984)
69. McIntosh, G.:Youtube video ofminecraft implementation of universal Turing machine program. http://www.youtube.com/watch?v=1X21HQphy6I (2011)
70. Burkard, R.E., Karisch, S.E., Rendl, F.: QAPLIB-a quadratic assignment problem library. Technical report, Department of Mathematics, Graz University of Technology, Graz, Austria (1996)
71. Wolfram, S.: Universality and complexity in cellular automata. Physica 10D, 1-35 (1984)