Der Artikel ist weiterhin als ^^OTHERCONDITION^^ verfügbar.
Autor: Andrew Adamatzky
ISBN-13: 9781447161547
Einband: Previously published in hardcover
Seiten: 600
Gewicht: 894 g
Format: 235x155x32 mm
Sprache: Englisch

Game of Life Cellular Automata

Geben Sie Ihre Bewertung ab!  
Wir verlosen jeden Monat unter allen freigegebenen Rezensionen
3 Gutscheine im Wert von 20 Euro. Teilnahmebedingungen
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.
This illustrated book brings together results of forty years of study into computational, mathematical, physical and engineering aspects of The Game of Life cellular automata. The book includes simple to understand examples of cellular automata dynamics.
Simple to understand examples of cellular automata dynamicsAbundance of illustrations, working examples, and codesEfficient techniques for evaluating space-time dynamics of discrete non-linear systemsReferences to online interacting demonstrationsOverview of exciting concepts at the edge of mathematics, computer science, engineering and physics
1. Introduction to Cellular Automata and Conway's Game of Life.- Part I Historical.- 2. Conway's Game of Life: Early Personal Recollections.- 3. Conway's Life.- 4. Life's Still Lifes.- 5. A Zoo of Life Forms.- Part II Classical Topics.- 6. Growth and Decay in Life-Like Cellular Automata.- 7. The B36/S125 "2x2" Life-Like Cellular Automaton.- 8. Object Synthesis in Conway's Game of Life and other Cellular Automata.- 9. Gliders and Glider Guns Discovery in Cellular Automata.- 10. Constraint Programming to Solve Maximal Density Still Life.- Part III Asynchronous, Continuous and Memory-Enriched Automata.- 11. Larger than Life's Extremes: Rigorous Results for Simplified Rules and Speculation on the Phase Boundaries.- 12. RealLife.- 13. Variations on the Game of Life.- 14. Does Life Resist Asynchrony?.- 15. LIFE with Short-Term Memory.- 16. Localization Dynamics in a Binary Two-Dimensional Cellular Automaton: the Diffusion Rule.- Part IV Non-Orthogonal Lattices.- 17. The Game of Life in Non-Square Environments.- 18. The Game of Life Rules on Penrose Tilings: Still Life and Oscillators.- 19. A Spherical XOR Gate Implemented in the Game of Life.- Part V Complexity.- 20. Emergent Complexity in Conway's Game of Life.- 21. Macroscopic Spatial Complexity of the Game of Life Cellular Automaton: A Simple Data Analysis.- Part VI Physics.- 22. The Enlightened Game of Life
23. Towards a Quantum Game of Life.- Part VII Music.- 24. Game of Life Music.- Part VIII Computation.- 25. Universal Computation and Construction in GoL Cellular Automata.- 26. A Simple Universal Turing Machine for the Game of Life Turing Machine.- 27. Computation with Competing Patterns in Life-like Automaton.- Index
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. 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.
Editiert von: Andrew Adamatzky
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.

Zu diesem Artikel ist noch keine Rezension vorhanden.
Helfen sie anderen Besuchern und verfassen Sie selbst eine Rezension.

 

Rezensionen

Autor: Andrew Adamatzky
ISBN-13 :: 9781447161547
ISBN: 1447161548
Erscheinungsjahr: 04.11.2014
Verlag: Springer London
Gewicht: 894g
Seiten: 600
Sprache: Englisch
Auflage 2010
Sonstiges: Taschenbuch, 235x155x32 mm