Authors:
- Presents a proof of universal computation in the Game of Life cellular automaton by using a Turing machine construction
- Background material is presented giving a description of Conway’s
- Game of Life, Turing machines and Counter Machines
- Self-consistent and well-illustrated book
- Includes supplementary material: sn.pub/extras
Part of the book series: Emergence, Complexity and Computation (ECC, volume 18)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (12 chapters)
-
Front Matter
-
Back Matter
About this book
This book presents a proof of universal computation in the Game of Life cellular automaton by using a Turing machine construction. It provides an introduction including background information and an extended review of the literature for Turing Machines, Counter Machines and the relevant patterns in Conway's Game of Life so that the subject matter is accessibly to non specialists.
The book contains a description of the author’s Turing machine in Conway’s Game of Life including an unlimited storage tape provided by growing stack structures and it also presents a fast universal Turing machine designed to allow the working to be demonstrated in a convenient period of time.
Reviews
“The book contains numerous detailed illustrations … . an avid reader who is a Game of Life enthusiast to the core will cherish every word. However, less detail-oriented readers may also enjoy this manuscript, focusing more on the tale told by the illustrations and their accompanying captions. These in themselves provide much insight into the fascinating universe of cellular automata–and into the amazing feats they can accomplish.” (Moshe Sipper, Genetic Programming and Evolvable Machines, Vol. 18, 2017)
“Rendell’s volume reports an extended project on such engineering of universal computers in the GoL. … individual chapters have references to the literature relevant to each of them. Aficionados of the Game of Life willwelcome this volume as the journal of a fellow enthusiast as he explores new ways to configure and manipulate the simple potential of this fascinating algorithm.” (H. Van Dyke Parunak, Computing Reviews, November, 2015)
Authors and Affiliations
-
Department of Computer Science, University of the West of England, Bristol, United Kingdom
Paul Rendell
Bibliographic Information
Book Title: Turing Machine Universality of the Game of Life
Authors: Paul Rendell
Series Title: Emergence, Complexity and Computation
DOI: https://doi.org/10.1007/978-3-319-19842-2
Publisher: Springer Cham
eBook Packages: Engineering, Engineering (R0)
Copyright Information: Springer International Publishing Switzerland 2016
Hardcover ISBN: 978-3-319-19841-5Published: 30 July 2015
Softcover ISBN: 978-3-319-37044-6Published: 15 October 2016
eBook ISBN: 978-3-319-19842-2Published: 21 July 2015
Series ISSN: 2194-7287
Series E-ISSN: 2194-7295
Edition Number: 1
Number of Pages: XV, 177
Number of Illustrations: 141 b/w illustrations
Topics: Complexity, Computational Intelligence, Artificial Intelligence, Applications of Nonlinear Dynamics and Chaos Theory
Industry Sectors: Aerospace