"alternating Turing machine" meaning in All languages combined

See alternating Turing machine on Wiktionary

Noun [English]

Forms: alternating Turing machines [plural]
Head templates: {{en-noun|~}} alternating Turing machine (countable and uncountable, plural alternating Turing machines)
  1. (computer science, computational complexity theory) A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP. Tags: countable, uncountable Categories (topical): Computer science

Inflected forms

{
  "forms": [
    {
      "form": "alternating Turing machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "alternating Turing machine (countable and uncountable, plural alternating 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": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP."
      ],
      "id": "en-alternating_Turing_machine-en-noun-5d4gMbVE",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "nondeterministic Turing machine",
          "nondeterministic Turing machine"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "accept",
          "accept"
        ],
        [
          "computation",
          "computation"
        ],
        [
          "generalize",
          "generalize"
        ],
        [
          "definition",
          "definition"
        ],
        [
          "complexity class",
          "complexity class"
        ],
        [
          "NP",
          "NP"
        ],
        [
          "co-NP",
          "co-NP"
        ]
      ],
      "qualifier": "computational complexity theory",
      "raw_glosses": [
        "(computer science, computational complexity theory) A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "alternating Turing machine"
}
{
  "forms": [
    {
      "form": "alternating Turing machines",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "alternating Turing machine (countable and uncountable, plural alternating Turing machines)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English uncountable nouns",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "glosses": [
        "A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "computational complexity theory",
          "computational complexity theory"
        ],
        [
          "nondeterministic Turing machine",
          "nondeterministic Turing machine"
        ],
        [
          "rule",
          "rule"
        ],
        [
          "accept",
          "accept"
        ],
        [
          "computation",
          "computation"
        ],
        [
          "generalize",
          "generalize"
        ],
        [
          "definition",
          "definition"
        ],
        [
          "complexity class",
          "complexity class"
        ],
        [
          "NP",
          "NP"
        ],
        [
          "co-NP",
          "co-NP"
        ]
      ],
      "qualifier": "computational complexity theory",
      "raw_glosses": [
        "(computer science, computational complexity theory) A nondeterministic Turing machine containing a rule for accepting computations that generalizes the rules used in the definition of the complexity classes NP and co-NP."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "alternating Turing machine"
}

Download raw JSONL data for alternating Turing machine meaning in All languages combined (1.6kB)


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-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.