"nondeterministic Turing machine" meaning in English

See nondeterministic Turing machine in All languages combined, or Wiktionary

Noun

Forms: nondeterministic Turing machines [plural]
Head templates: {{en-noun|head=nondeterministic Turing machine}} nondeterministic Turing machine (plural nondeterministic Turing machines)
  1. (computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read. Categories (topical): Computer science

Inflected forms

{
  "forms": [
    {
      "form": "nondeterministic Turing machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "nondeterministic Turing machine"
      },
      "expansion": "nondeterministic Turing machine (plural nondeterministic Turing 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 language name categories using raw markup",
          "parents": [
            "Entries with language name 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": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "text": "Coordinate term: deterministic Turing machine"
        }
      ],
      "glosses": [
        "A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "id": "en-nondeterministic_Turing_machine-en-noun-xBx3J4cL",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "variant",
          "variant"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "governing",
          "governing"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "specify",
          "specify"
        ],
        [
          "possible",
          "possible"
        ],
        [
          "action",
          "action"
        ],
        [
          "given",
          "given"
        ],
        [
          "combination",
          "combination"
        ],
        [
          "state",
          "state"
        ],
        [
          "machine",
          "machine"
        ],
        [
          "symbol",
          "symbol"
        ]
      ],
      "raw_glosses": [
        "(computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "nondeterministic Turing machine"
}
{
  "forms": [
    {
      "form": "nondeterministic Turing machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "nondeterministic Turing machine"
      },
      "expansion": "nondeterministic Turing machine (plural nondeterministic Turing machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English entries with language name categories using raw markup",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with non-redundant non-automated sortkeys",
        "Pages with 1 entry",
        "en:Computer science"
      ],
      "examples": [
        {
          "text": "Coordinate term: deterministic Turing machine"
        }
      ],
      "glosses": [
        "A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "variant",
          "variant"
        ],
        [
          "Turing machine",
          "Turing machine"
        ],
        [
          "governing",
          "governing"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "specify",
          "specify"
        ],
        [
          "possible",
          "possible"
        ],
        [
          "action",
          "action"
        ],
        [
          "given",
          "given"
        ],
        [
          "combination",
          "combination"
        ],
        [
          "state",
          "state"
        ],
        [
          "machine",
          "machine"
        ],
        [
          "symbol",
          "symbol"
        ]
      ],
      "raw_glosses": [
        "(computer science) A variant of a Turing machine whose governing rules may specify more than one possible action for any given combination of the state of the machine and symbol being read."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "nondeterministic Turing machine"
}

Download raw JSONL data for nondeterministic Turing machine meaning in English (1.6kB)


This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-09-01 from the enwiktionary dump dated 2024-08-20 using wiktextract (8e41825 and f99c758). 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.