Game of life cellular automata
Autres auteurs :
Adamatzky, Andrew.
Publié par :
Springer.
(London | New York )
Détails physiques : xix, 579 pages illustrations 25 cm.
ISBN :9781849962162 (alk. paper); 1849962162 (alk. paper); 9781849962179 (eISBN); 1849962170 (eISBN).
Année : 2010
| Type de document | Site actuel | Cote | Statut | Date de retour prévue | Code à barres | Réservations |
|---|---|---|---|---|---|---|
| Livre | La bibliothèque des Sciences Exactes et Naturelles | 511.3 ADA (Parcourir l'étagère) | Disponible | 0000000022211 |
Total des réservations: 0
Survol La bibliothèque des Sciences Exactes et Naturelles Étagères Fermer l'étagère
| Pas d'image disponible |
|
|
|
|
Pas d'image disponible |
|
||
| 511 TEM Modlisation mathématique et mécanique des milieux continus | 511.1 YE Strict finitism and the logic of mathematical applications | 511.3 ACZ Proof theory | 511.3 ADA Game of life cellular automata | 511.3 AMA Domains and lambda-calculi | 511.3 AND VOL.2 Entailment : the logic of relevance and necessity / | 511.3 ANS Cognitive reasoning : |
Includes bibliographical references and 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.


Il n'y a pas de commentaire pour ce document.