{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:17:51Z","timestamp":1771697871754,"version":"3.50.1"},"publisher-location":"London","reference-count":22,"publisher":"Springer London","isbn-type":[{"value":"9781852335403","type":"print"},{"value":"9781447101291","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4471-0129-1_18","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T14:11:06Z","timestamp":1310998266000},"page":"513-539","source":"Crossref","is-referenced-by-count":72,"title":["Turing Universality of the Game of Life"],"prefix":"10.1007","author":[{"given":"Paul","family":"Rendell","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Berlekamp E.R., Conway J.H. and Guy R. Winning Ways\n                for Your Mathematical Plays, vol 2 (Academic Press, 1982)."},{"key":"18_CR2","unstructured":"Bontes J.G. Life32 Win32 PC Program for Conway\u2019s Game Life\n                \n                  http:\/\/life32.1ifepatterns.net\n                  \n                \/"},{"key":"18_CR3","unstructured":"Callahan P. Java Applet was written by Paul Callahan. \n                  http:\/\/www.radicaleye.com\/lifepage\n                  \n                \/"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/S0022-0000(73)80029-7","volume":"7","author":"S Cook","year":"1973","unstructured":"Cook S. and Reckhow K.R. Time bounded random access machines J. Comput. System Sci. 7 (1973) 354\u2013375.","journal-title":"System Sci"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/321623.321625","volume":"18","author":"SA Cook","year":"1971","unstructured":"Cook S.A. Characterizations of pushdown machines in terms of time-bounded computers J. Ass. Comput. Mach. 18 (1971) 14\u201318.","journal-title":"J. Ass. Comput. Mach"},{"key":"18_CR6","volume-title":"Introduction to Automata Theory","author":"JE Hoperoft","year":"1979","unstructured":"Hoperoft J.E. and Ullman J.D. Introduction to Automata Theory, Languages and Computation (Addison-Wesley, 1979)."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1038\/scientificamerican0584-86","volume":"250","author":"JE Hoperoft","year":"1996","unstructured":"Hoperoft J.E. Turing machines Scientific American 250 (1984) 86\u201398.","journal-title":"Turing machines Scientific American"},{"key":"18_CR8","unstructured":"Gardner M. Mathematical Games articles in Scientific American: On Cellular automata, self-reproduction, and the game \u201clife\u201d (February, 1971) The fantastic combinations of John Conway\u2019s new solitaire game \u201clife\u201d (October, 1970)."},{"key":"18_CR9","volume-title":"Wheels, Life and Other Mathematical Amusements (Freeman","author":"M Gardner","year":"1983","unstructured":"Gardner M. Wheels, Life and Other Mathematical Amusements (Freeman, 1983)."},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1145\/321386.321403","volume":"14","author":"S Ginsburg","year":"1967","unstructured":"Ginsburg S., Greibach S.A. and Harrison M.A. One-way stack automata J.Assoc. Comput. Mach.\n                14 (1967) 389\u2013418.","journal-title":"J.Assoc. Comput. Mach"},{"key":"18_CR11","unstructured":"Gruska J. Foundations of Computing (Thomson International Computer Press, 1997)."},{"key":"18_CR12","first-page":"267","volume":"168","author":"I Korec","year":"1996","unstructured":"Korec I. Small universal register machines Theor. Comput. Sci. 168 (1996) 267\u2013301.","journal-title":"Sci"},{"key":"18_CR13","unstructured":"Leithner D. and Rott P. Dieter and Peter\u2019s Gun Collection\n                \n                  http:\/\/www.mindspring.com\/%7Ealanh\/guns.zip\n                  \n                \n                and\n                \n                  http:\/\/www.mindspring.com\/%7Ealanh\/guns2.zip"},{"key":"18_CR14","first-page":"419","volume":"129","author":"M Margenstern","year":"1994","unstructured":"Margenstern M. Nonerasing Turing machines: A frontier between a decidable halting problem and universality Theoret. Comput. Sci. 129 (1994) 419\u2013424.","journal-title":"Sci"},{"key":"18_CR15","first-page":"153","volume":"257","author":"M Margenstern","year":"2001","unstructured":"Margenstern M. On quasi-unilateral universal Turing machines Theor. Comput. Sci. 257 (2001) 153\u2013166.","journal-title":"Sci"},{"key":"18_CR16","unstructured":"Minsky M.L. Computation: Finite and Infinite Machines (Prentice-Hall, 1967)."},{"key":"18_CR17","unstructured":"Rendell P. Conway\u2019s Game Life Turing Machine\n                \n                  http:\/\/www.rendell.uk.co\/gol"},{"key":"18_CR18","first-page":"215","volume":"168","author":"Y Rogozhin","year":"1996","unstructured":"Rogozhin Y. Small universal Turing machines Theor. Comput. Sci.\n                168 (1996) 215\u2013240.","journal-title":"Sci"},{"key":"18_CR19","unstructured":"Silver S. Stephen Silver\u2019s Life Lexicon\n                \n                  http:\/\/www.argentum.freeserve.co.uk\/lex_home.htm"},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"AM Turing","year":"1937","unstructured":"Turing A.M. On computable numbers, with applications to the entscheidungsproblem Proc. London Math. Soc.\n                42 (1937 230\u2013265.","journal-title":"London Math. Soc"},{"key":"18_CR21","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0020-0190(99)00116-7","volume":"71","author":"A Wojna","year":"1999","unstructured":"Wojna A. Counter machines Information Processing Lett. 71 (1999) 193\u2013197.","journal-title":"Counter machines Information Processing Lett"},{"key":"18_CR22","unstructured":"W\u00f3jtowicz M. Mirek\u2019s Cellebration (MCell)\n                \n                  http:\/\/www.mirwoj.opus.chelm.pl"}],"container-title":["Collision-Based Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0129-1_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:49:28Z","timestamp":1619830168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0129-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781852335403","9781447101291"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0129-1_18","relation":{},"subject":[],"published":{"date-parts":[[2002]]}}}