"unlimited register machine" meaning in English

See unlimited register machine in All languages combined, or Wiktionary

Noun

Forms: unlimited register machines [plural]
Head templates: {{en-noun}} unlimited register machine (plural unlimited register machines)
  1. (computing theory) A particular type of theoretical computer, with infinitely many memory cells, called registers, and formal rules to determine the machine's behavior based on their contents. Categories (topical): Computing, Mathematics, Theory of computing Synonyms: URM Related terms: Turing machine, cellular automaton, pushdown automaton

Inflected forms

Alternative forms

Download JSON data for unlimited register machine meaning in English (2.3kB)

{
  "forms": [
    {
      "form": "unlimited register machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "unlimited register machine (plural unlimited register machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with topic categories using raw markup",
          "parents": [
            "Entries with topic categories using raw markup",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms with non-redundant non-automated sortkeys",
          "parents": [
            "Terms with non-redundant non-automated sortkeys",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computing",
          "orig": "en:Computing",
          "parents": [
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [
            "Computer science",
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A particular type of theoretical computer, with infinitely many memory cells, called registers, and formal rules to determine the machine's behavior based on their contents."
      ],
      "id": "en-unlimited_register_machine-en-noun-MJrIOd8V",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "theoretical",
          "theoretical"
        ],
        [
          "computer",
          "computer"
        ],
        [
          "memory",
          "memory"
        ],
        [
          "cell",
          "cell"
        ],
        [
          "registers",
          "registers#English"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "behavior",
          "behavior"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A particular type of theoretical computer, with infinitely many memory cells, called registers, and formal rules to determine the machine's behavior based on their contents."
      ],
      "related": [
        {
          "word": "Turing machine"
        },
        {
          "word": "cellular automaton"
        },
        {
          "word": "pushdown automaton"
        }
      ],
      "synonyms": [
        {
          "word": "URM"
        }
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "word": "unlimited register machine"
}
{
  "forms": [
    {
      "form": "unlimited register machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "unlimited register machine (plural unlimited register machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Turing machine"
    },
    {
      "word": "cellular automaton"
    },
    {
      "word": "pushdown automaton"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with topic categories using raw markup",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "en:Computing",
        "en:Mathematics",
        "en:Theory of computing"
      ],
      "glosses": [
        "A particular type of theoretical computer, with infinitely many memory cells, called registers, and formal rules to determine the machine's behavior based on their contents."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "theoretical",
          "theoretical"
        ],
        [
          "computer",
          "computer"
        ],
        [
          "memory",
          "memory"
        ],
        [
          "cell",
          "cell"
        ],
        [
          "registers",
          "registers#English"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "behavior",
          "behavior"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A particular type of theoretical computer, with infinitely many memory cells, called registers, and formal rules to determine the machine's behavior based on their contents."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "URM"
    }
  ],
  "word": "unlimited register machine"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-01 from the enwiktionary dump dated 2024-04-21 using wiktextract (f4fd8c9 and c9440ce). 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.