Anzeige
Erschienen in:
2013 | OriginalPaper | Buchkapitel
Introduction
verfasst von : Andrew Adamatzky
Erschienen in: Reaction-Diffusion Automata: Phenomenology, Localisations, Computation
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Cellular automata are regular uniform networks of locally-connected finite-state machines, called cells. A cell takes a finite number of states. Cells are locally connected: every cell updates its state depending on states of its geographically closest neighbours. All cells update their states simultaneously in discrete time steps. All cells employe the same rule to calculate their states. Cellular automata are discrete systems with non-trivial behaviour. They are mathematical models of computation and computer models of natural systems.