113,95 €
113,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
57 °P sammeln
113,95 €
113,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
57 °P sammeln
Als Download kaufen
113,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
57 °P sammeln
Jetzt verschenken
113,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
57 °P sammeln
  • Format: PDF

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…mehr

  • Geräte: PC
  • ohne Kopierschutz
  • eBook Hilfe
  • Größe: 26.48MB
Produktbeschreibung
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.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Autorenporträt
Andrew Adamatzky is a Professor in Unconventional Computing in the Department of Computer Science, and a member of Bristol Robotics Lab. He does research in reaction-diffusion computing, cellular automata, physarum computing, massive parallel computation, applied mathematics, collective intelligence and robotics.
Rezensionen
From the reviews:

"This volume's 27 papers offer some systematic methods and rigorous theorems that exhibit the study of Conway's game and its variations, emerging out of the realm of merely recreational mathematics. ... this unique book will have great value as both a state-of-the-art summary and a collection of proposals for new directions to explore. Summing Up: Highly recommended. Upper-division undergraduates through professionals." (D. V. Feldman, Choice, Vol. 48 (4), December, 2010)

"Andrew Adamatzky has assembled a superb collection of papers on Life that encompass work going back more than 20 years. ... maintains a good balance between interconnectedness and recognition of the papers as independent contributions. ... This book is a treasure trove of history, concepts, and models. It is a good starting place for a newcomer to the study of Conway's Game of Life, an opening of vistas for the amateur hobbyist, and a serious handbook for the professional researcher." (Anthony J. Duben, ACM Computing Reviews, February, 2011)