Rendell, Paul.
Turing Machine Universality of the Game of Life [electronic resource] / by Paul Rendell. - XV, 177 p. 141 illus. online resource. - Emergence, Complexity and Computation, 18 2194-7287 ; . - Emergence, Complexity and Computation, 18 .
Introduction -- Background -- Literature Review / Related Work -- Game of Life Turing Machine -- Game of Life Universal Turing Machine -- Optimizing Transition Order -- Forty Five Degree Stack -- Stack Constructor -- Universal Counter Machine - Turing Machine -- Wolfram's two State Three Symbol UTM -- Conclusions and Discussion -- Further Work.
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. .
9783319198422
10.1007/978-3-319-19842-2 doi
Engineering.
Artificial intelligence.
Statistical physics.
Computational intelligence.
Complexity, Computational.
Engineering.
Complexity.
Computational Intelligence.
Artificial Intelligence (incl. Robotics).
Nonlinear Dynamics.
QA76.9.M35
620
Turing Machine Universality of the Game of Life [electronic resource] / by Paul Rendell. - XV, 177 p. 141 illus. online resource. - Emergence, Complexity and Computation, 18 2194-7287 ; . - Emergence, Complexity and Computation, 18 .
Introduction -- Background -- Literature Review / Related Work -- Game of Life Turing Machine -- Game of Life Universal Turing Machine -- Optimizing Transition Order -- Forty Five Degree Stack -- Stack Constructor -- Universal Counter Machine - Turing Machine -- Wolfram's two State Three Symbol UTM -- Conclusions and Discussion -- Further Work.
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. .
9783319198422
10.1007/978-3-319-19842-2 doi
Engineering.
Artificial intelligence.
Statistical physics.
Computational intelligence.
Complexity, Computational.
Engineering.
Complexity.
Computational Intelligence.
Artificial Intelligence (incl. Robotics).
Nonlinear Dynamics.
QA76.9.M35
620