"Rule 110" meaning in All languages combined

See Rule 110 on Wiktionary

Proper name [English]

Etymology: The binary number sequence 01101110, summarising the rule, is equivalent to the decimal number 110. This is the rule's Wolfram code. Head templates: {{en-proper noun|head=Rule 110}} Rule 110
  1. (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. Wikipedia link: Rule 110 Categories (topical): Cellular automata
{
  "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": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "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",
        "Pages with 1 entry",
        "Pages with entries",
        "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"
}

Download raw JSONL data for Rule 110 meaning in All languages combined (1.3kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-21 from the enwiktionary dump dated 2024-12-04 using wiktextract (d8cb2f3 and 4e554ae). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.