"Rule 110" meaning in All languages combined

{
  "etymology_text": "The binary number sequence 01101110, summarising the rule, is equivalent to the decimal number 110. This is the rule's Wolfram code.",
  "head_templates": [
    {
      "args": {
        "head": "Rule 110"
      },
      "expansion": "Rule 110",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Cellular automata",
          "orig": "en:Cellular automata",
          "parents": [
            "Mathematics",
            "Theory of computing",
            "Formal sciences",
            "Computer science",
            "Sciences",
            "Computing",
            "All topics",
            "Technology",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A simple cellular automaton, unusual in being Turing-complete, where each cell's value changes depending on its current value and those of two neighbouring cells."
      ],
      "id": "en-Rule_110-en-name-bO-YjCQI",
      "links": [
        [
          "cellular automata",
          "cellular automata"
        ],
        [
          "cellular automaton",
          "cellular automaton"
        ],
        [
          "Turing-complete",
          "Turing-complete"
        ],
        [
          "cell",
          "cell"
        ]
      ],
      "raw_glosses": [
        "(cellular automata) A simple cellular automaton, unusual in being Turing-complete, where each cell's value changes depending on its current value and those of two neighbouring cells."
      ],
      "topics": [
        "cellular-automata",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Rule 110"
      ]
    }
  ],
  "word": "Rule 110"
}

{
  "etymology_text": "The binary number sequence 01101110, summarising the rule, is equivalent to the decimal number 110. This is the rule's Wolfram code.",
  "head_templates": [
    {
      "args": {
        "head": "Rule 110"
      },
      "expansion": "Rule 110",
      "name": "en-proper noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "name",
  "senses": [
    {
      "categories": [
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English proper nouns",
        "English terms spelled with numbers",
        "English uncountable nouns",
        "en:Cellular automata"
      ],
      "glosses": [
        "A simple cellular automaton, unusual in being Turing-complete, where each cell's value changes depending on its current value and those of two neighbouring cells."
      ],
      "links": [
        [
          "cellular automata",
          "cellular automata"
        ],
        [
          "cellular automaton",
          "cellular automaton"
        ],
        [
          "Turing-complete",
          "Turing-complete"
        ],
        [
          "cell",
          "cell"
        ]
      ],
      "raw_glosses": [
        "(cellular automata) A simple cellular automaton, unusual in being Turing-complete, where each cell's value changes depending on its current value and those of two neighbouring cells."
      ],
      "topics": [
        "cellular-automata",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ],
      "wikipedia": [
        "Rule 110"
      ]
    }
  ],
  "word": "Rule 110"
}