Author: Paul Rendell

http://www.springer.com/us/book/9783319198415

ISBN: 978-3-319-19841-5

DOI: 10.1007/978-3-319-19842-2

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.

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.

Table of contents (12 chapter)

1. 1Introduction
   Rendell, Paul
   Pages 1-3
   

2. 2Background
   Rendell, Paul
   Pages 5-16
   

3. 3Literature Review/Related Work
   Rendell, Paul
   Pages 17-43
   

4. 4Game of Life Turing Machine
   Rendell, Paul
   Pages 45-70
   

5. 5Game of Life Universal Turing Machine
   Rendell, Paul
   Pages 71-89
   

6. 6Optimizing Transition Order
   Rendell, Paul
   Pages 91-105
   

7. 7Forty Five Degree Stack
   Rendell, Paul
   Pages 107-117
   

8. 8Stack Constructor
   Rendell, Paul
   Pages 119-141
   

9. 9Universal Counter Machine—Turing Machine
   Rendell, Paul
   Pages 143-146
   

10. 10Wolfram’s Two State Three Symbol UTM
    Rendell, Paul
    Pages 147-149
    

11. 11Conclusions and Discussion
    Rendell, Paul
    Pages 151-159
    

12. 12Further Work
    Rendell, Paul
    

Read this book on SpringerLink