mathworld.wolfram.com/Rule30.html

Preview meta tags from the mathworld.wolfram.com website.

Linked Hostnames

8

Thumbnail

Search Engine Appearance

Google

https://mathworld.wolfram.com/Rule30.html

Rule 30 -- from Wolfram MathWorld

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...



Bing

Rule 30 -- from Wolfram MathWorld

https://mathworld.wolfram.com/Rule30.html

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...



DuckDuckGo

https://mathworld.wolfram.com/Rule30.html

Rule 30 -- from Wolfram MathWorld

Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...

  • General Meta Tags

    29
    • title
      Rule 30 -- from Wolfram MathWorld
    • DC.Title
      Rule 30
    • DC.Creator
      Weisstein, Eric W.
    • DC.Description
      Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...
    • description
      Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...

  • Open Graph Meta Tags

    5
    • og:image
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_Rule30.png
    • og:url
      https://mathworld.wolfram.com/Rule30.html
    • og:type
      website
    • og:title
      Rule 30 -- from Wolfram MathWorld
    • og:description
      Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...

  • Twitter Meta Tags

    5
    • twitter:card
      summary_large_image
    • twitter:site
      @WolframResearch
    • twitter:title
      Rule 30 -- from Wolfram MathWorld
    • twitter:description
      Rule 30 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its color and its immediate neighbors. Its rule outcomes are encoded in the binary representation 30=00011110_2. This rule is illustrated above together with the evolution of a single black cell it produces after 15 steps (Wolfram 2002, p. 55). 250 iterations of rule 30 are illustrated above. Starting with a single black...
    • twitter:image:src
      https://mathworld.wolfram.com/images/socialmedia/share/ogimage_Rule30.png

  • Link Tags

    4
    • canonical
      https://mathworld.wolfram.com/Rule30.html
    • preload
      //www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
    • stylesheet
      /css/styles.css
    • stylesheet
      /common/js/c2c/1.0/WolframC2CGui.css.en

Links

72