Skip to main content

Cellular Automata

  • Reference work entry
Encyclopedia of Systems Biology

Synonyms

Cellular spaces; Cellular structures; Homogeneous structures; Iterative arrays; Tessellation automata; Tessellation structures

Definition

A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model studied in computability theory, mathematics, physics, complexity science (Complexity), theoretical biology, and microstructure modeling. They are used to build parallel computing (Parallel Computing, Data Parallelism) architectures as well as to model and simulate physical systems. Moreover they can be used to investigate and reproduce the emergence of patterns (Spatiotemporal Pattern Formation), self-replication and self-similarity properties in natural systems.

Characteristics

History

CA were first developed in the 1940s by Stanislaw Ulam, who was investigating the growth of crystals, using a simple lattice network as his model, and by John Von Neumann, who was working on the problem of self-replicating systems (Von Neumann 1966).

In 1946, Norbert Wiener and...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 899.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 549.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  • Hedlund GA (1969) Endomorphisms and automorphisms of the shift dynamical system. Math Syst Theory 3:320–375

    Google Scholar 

  • Kansal AR, Torquato S, Harsh GR IV, Chiocca EA, Deisboeck TS (2000) Simulated brain tumor growth dynamics using a three-dimensional cellular automaton. J Theor Biol 203:367–382

    PubMed  CAS  Google Scholar 

  • Rendell P (2002) Turing universality of the game of life. In: Adamatzky A (ed) Collision-based computing. Springer, London

    Google Scholar 

  • Sipper M (1997) Evolution of parallel cellular machines: the cellular programming approach. Springer, Heidelberg

    Google Scholar 

  • Toffoli M, Margolus N (1987) Cellular automata machines: a new environment for modeling. MIT Press, Boston

    Google Scholar 

  • Von Neumann J (1966) Theory of self-reproducing automata. University of Illinois Press, Urbana

    Google Scholar 

  • Wiener N, Rosenblueth A (1946) The mathematical formulation of the problem of conduction of impulses in a network of connected excitable elements, specifically in cardiac muscle. Arch Inst Cardiol Mex 16:205–265

    PubMed  CAS  Google Scholar 

  • Wolf-Gladrow DA (2005) Lattice-gas cellular automata and lattice boltzmann models – an introduction. Springer, Berlin

    Google Scholar 

  • Wolfram S (2002) A new kind of science. Wolfram Media, Champaign

    Google Scholar 

  • Zuse K (1982) The computing universe. Int J Theo Phys 21:589–600

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Carlo Cosentino .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media, LLC

About this entry

Cite this entry

Cosentino, C., Vescio, B., Amato, F. (2013). Cellular Automata. In: Dubitzky, W., Wolkenhauer, O., Cho, KH., Yokota, H. (eds) Encyclopedia of Systems Biology. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-9863-7_989

Download citation

Publish with us

Policies and ethics