Game of Life Cellular Automata

  • Andrew Adamatzky

Table of contents

  1. Front Matter
    Pages I-XIX
  2. Historical

    1. Front Matter
      Pages 9-9
    2. Harold V. McIntosh
      Pages 17-33
    3. Harold V. McIntosh
      Pages 35-50
    4. Harold V. McIntosh
      Pages 51-68
  3. Classical Topics

    1. Front Matter
      Pages 69-69
    2. Geoffrey Chu, Karen Elizabeth Petrie, Neil Yorke-Smith
      Pages 167-175
  4. Asynchronous, Continuous and Memory-Enriched Automata

    1. Front Matter
      Pages 177-177
    2. Marcus Pivato
      Pages 223-234
    3. Ferdinand Peper, Susumu Adachi, Jia Lee
      Pages 235-255
    4. Nazim Fatès
      Pages 257-274
    5. Ramón Alonso-Sanz
      Pages 275-290
    6. Genaro J. Martínez, Andrew Adamatzky, Harold V. McIntosh
      Pages 291-315

About this book

Introduction

In the late 1960s British mathematician John Conway invented a virtual mathematical machine that operates on a two-dimensional array of square cell. Each cell takes two states, live and dead. The cells’ states are updated simultaneously and in discrete time. A dead cell comes to life if it has exactly three live neighbours. A live cell remains alive if two or three of its neighbours are alive, otherwise the cell dies. The Conway’s Game of Life became the most programmed solitary game and the most known cellular automaton. The book brings together results of forty years of study into computational, mathematical, physical and engineering aspects of the Game of Life cellular automata. Selected topics include phenomenology and statistical behaviour; space-time dynamics on Penrose tilling and hyperbolic spaces; generation of music; algebraic properties; modelling of financial markets; semi-quantum extensions; predicting emergence; dual-graph based analysis; fuzzy, limit behaviour and threshold scaling; evolving cell-state transition rules; localization dynamics in quasi-chemical analogues of GoL; self-organisation towards criticality; asynochrous implementations. The volume is unique because it gives a comprehensive presentation of the theoretical and experimental foundations, cutting-edge computation techniques and mathematical analysis of the fabulously complex, self-organized and emergent phenomena defined by incredibly simple rules.

Keywords

Automat Extension Turing machine automata cellular automaton complexity modeling

Editors and affiliations

  • Andrew Adamatzky
    • 1
  1. 1.Fac. of Computing, Engineering and, Mathematical Sciences (CEMS)University of the West of EnglandBristolUnited Kingdom

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-84996-217-9
  • Copyright Information Springer-Verlag London Limited 2010
  • Publisher Name Springer, London
  • eBook Packages Computer Science
  • Print ISBN 978-1-84996-216-2
  • Online ISBN 978-1-84996-217-9
  • About this book