"computability theory" meaning in English

See computability theory in All languages combined, or Wiktionary

Noun

Head templates: {{en-noun|-}} computability theory (uncountable)
  1. (logic) Recursion theory. Tags: uncountable Categories (topical): Logic
    Sense id: en-computability_theory-en-noun-hVK6X9iQ Categories (other): English entries with incorrect language header Disambiguation of English entries with incorrect language header: 84 16 Topics: human-sciences, logic, mathematics, philosophy, sciences
  2. (computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models. Tags: uncountable Categories (topical): Computer science
    Sense id: en-computability_theory-en-noun-pXD41284 Topics: computer, computing, engineering, mathematics, natural-sciences, physical-sciences, science, sciences

Download JSON data for computability theory meaning in English (1.7kB)

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "computability theory (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        },
        {
          "_dis": "84 16",
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w+disamb"
        }
      ],
      "glosses": [
        "Recursion theory."
      ],
      "id": "en-computability_theory-en-noun-hVK6X9iQ",
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "Recursion theory",
          "recursion theory"
        ]
      ],
      "raw_glosses": [
        "(logic) Recursion theory."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    },
    {
      "categories": [
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The branch of the theory of computation that studies which problems are computationally solvable using different models."
      ],
      "id": "en-computability_theory-en-noun-pXD41284",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "computation",
          "computation"
        ],
        [
          "model",
          "model"
        ]
      ],
      "raw_glosses": [
        "(computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "computability theory"
  ],
  "word": "computability theory"
}
{
  "categories": [
    "English entries with incorrect language header",
    "English lemmas",
    "English multiword terms",
    "English nouns",
    "English uncountable nouns"
  ],
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "computability theory (uncountable)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "en:Logic"
      ],
      "glosses": [
        "Recursion theory."
      ],
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "Recursion theory",
          "recursion theory"
        ]
      ],
      "raw_glosses": [
        "(logic) Recursion theory."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    },
    {
      "categories": [
        "en:Computer science"
      ],
      "glosses": [
        "The branch of the theory of computation that studies which problems are computationally solvable using different models."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "computation",
          "computation"
        ],
        [
          "model",
          "model"
        ]
      ],
      "raw_glosses": [
        "(computer science) The branch of the theory of computation that studies which problems are computationally solvable using different models."
      ],
      "tags": [
        "uncountable"
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "wikipedia": [
    "computability theory"
  ],
  "word": "computability theory"
}

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