Methuselah (cellular automaton)

The die hard Methuselah lives for 130 generations before all cells die.

In cellular automata, a methuselah is a small "seed" pattern of initial live cells that take a large number of generations in order to stabilize. More specifically, Martin Gardner defines them as patterns of fewer than ten live cells which take longer than 50 generations to stabilize,[1] although some patterns that are larger than ten cells have also been called methuselahs. Patterns must eventually stabilize to be considered methuselahs. The term comes from the Biblical Methuselah, who lived for 969 years, before he eventually died.

In Conway's Game of Life

In Conway's Game of Life, one of the smallest methuselahs is the R-pentomino,[2] a pattern of five cells first considered by Conway himself,[3] that takes 1103 generations before stabilizing with 116 cells. The acorn,[4] a pattern of seven live cells developed by Charles Corderman, takes 5206 generations to stabilize and produce a 633-cell pattern referred to as its "oak". Some other examples of methuselahs are called bunnies[5] and rabbits.[6]

References

  1. ↑ Gardner, M. (1983). "The Game of Life, Part III". Wheels, Life and Other Mathematical Amusements. W.H. Freeman. p. 246.
  2. ↑ Silver, Stephen (28 February 2006). "R-pentomino". Life Lexicon. Retrieved 2008-12-24.
  3. ↑ Gardner, M. (1983). "The Game of Life, Part III". Wheels, Life and Other Mathematical Amusements. W.H. Freeman. pp. 219, 223.
  4. ↑ Silver, Stephen (28 February 2006). "Acorn". Life Lexicon. Retrieved 2008-12-24.
  5. ↑ Silver, Stephen (28 February 2006). "Bunnies". Life Lexicon. Retrieved 2008-12-24.
  6. ↑ Silver, Stephen (28 February 2006). "Rabbits". Life Lexicon. Retrieved 2008-12-24.

External links


This article is issued from Wikipedia - version of the Sunday, December 28, 2014. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.