"Turing degree" meaning in English

See Turing degree in All languages combined, or Wiktionary

Noun

Forms: Turing degrees [plural]
Etymology: Named after Alan Turing. Head templates: {{en-noun}} Turing degree (plural Turing degrees)
  1. (computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number. Wikipedia link: Alan Turing, Turing degree Categories (topical): Computer science, Logic Related terms: Turing equivalent

Inflected forms

Download JSON data for Turing degree meaning in English (1.9kB)

{
  "etymology_text": "Named after Alan Turing.",
  "forms": [
    {
      "form": "Turing degrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Turing degree (plural Turing degrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "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": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number."
      ],
      "id": "en-Turing_degree-en-noun-Wy2ARkHJ",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "algorithmic",
          "algorithmic"
        ],
        [
          "unsolvability",
          "unsolvability"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "set",
          "set"
        ],
        [
          "natural number",
          "natural number"
        ]
      ],
      "raw_glosses": [
        "(computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number."
      ],
      "related": [
        {
          "word": "Turing equivalent"
        }
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "human-sciences",
        "logic",
        "mathematics",
        "natural-sciences",
        "philosophy",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Alan Turing",
        "Turing degree"
      ]
    }
  ],
  "word": "Turing degree"
}
{
  "etymology_text": "Named after Alan Turing.",
  "forms": [
    {
      "form": "Turing degrees",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Turing degree (plural Turing degrees)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Turing equivalent"
    }
  ],
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "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",
        "en:Computer science",
        "en:Logic"
      ],
      "glosses": [
        "A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "logic",
          "logic"
        ],
        [
          "algorithmic",
          "algorithmic"
        ],
        [
          "unsolvability",
          "unsolvability"
        ],
        [
          "decision problem",
          "decision problem"
        ],
        [
          "set",
          "set"
        ],
        [
          "natural number",
          "natural number"
        ]
      ],
      "raw_glosses": [
        "(computer science, logic) A measure of the level of algorithmic unsolvability of the decision problem of whether a given set of natural numbers contains any given number."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "human-sciences",
        "logic",
        "mathematics",
        "natural-sciences",
        "philosophy",
        "physical-sciences",
        "science",
        "sciences"
      ],
      "wikipedia": [
        "Alan Turing",
        "Turing degree"
      ]
    }
  ],
  "word": "Turing degree"
}

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