Cellular Automata
Cellular Automata
- Entry
- Reader's Guide
- Entries A-Z
- Subject Index
-
Cellular automata (CA; singular: cellular automaton) are dynamic discrete systems that operate in space and time on a uniform and regular lattice of cells. These cells are driven by rules that describe interactions at the local level to produce patterns at the global level. Depending on the problem context, the cells can also be rectangular, triangular, or hexagonal.
Figure 1 Different cellular automata neighborhoods
Source: Author.HistoryThe mathematical description of CA was partially postulated by D'Arcy Thompson (1917), then further developed by Von Neumann (1966) in his work on self-reproducing systems. The work of Von Neumann was motivated by Alan Turing's groundbreaking developments in algorithms and digital computing as well as Stanislaw Ulam's work on the growth of crystals in the 1940s and 1950s. CA concepts were ...
-
-
- B
- C
- D
- E
- F
- G
- H
- I
- J
- K
- L
- M
- N
- O
- P
- Q
- R
- S
- T
- U
- V
- W
- X
- Z
-
165449- Loading...
Similar content on SAGE Knowledge
Loading content...Keywords
Also from SAGE Publishing
- CQ Library American political resources opens in new tab
- Data Planet A universe of data opens in new tab
- Lean Library Increase the visibility of your library opens in new tab
- SAGE Journals World-class research journals opens in new tab
- SAGE Research Methods The ultimate methods library opens in new tab
- SAGE Stats Data on demand opens in new tab