Turing Machine Universality of the Game of Life

  • Paul Rendell

Part of the Emergence, Complexity and Computation book series (ECC, volume 18)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Paul Rendell
    Pages 1-3
  3. Paul Rendell
    Pages 5-16
  4. Paul Rendell
    Pages 17-43
  5. Paul Rendell
    Pages 45-70
  6. Paul Rendell
    Pages 71-89
  7. Paul Rendell
    Pages 91-105
  8. Paul Rendell
    Pages 107-117
  9. Paul Rendell
    Pages 119-141
  10. Paul Rendell
    Pages 143-146
  11. Paul Rendell
    Pages 147-149
  12. Paul Rendell
    Pages 151-159
  13. Paul Rendell
    Pages 161-162
  14. Back Matter
    Pages 163-177

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.



Cellular Automata Conway’s Game of Life Counter Machine Quadratic Assignment Problem Turing Machine Universality

Authors and affiliations

  • Paul Rendell
    • 1
  1. 1.Department of Computer ScienceUniversity of the West of EnglandBristolUnited Kingdom

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Engineering Engineering (R0)
  • Print ISBN 978-3-319-19841-5
  • Online ISBN 978-3-319-19842-2
  • Series Print ISSN 2194-7287
  • Series Online ISSN 2194-7295
  • Buy this book on publisher's site
Industry Sectors
Oil, Gas & Geosciences