See computability theory in All languages combined, or Wiktionary
{ "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": "85 15", "kind": "other", "name": "English entries with incorrect language header", "parents": [ "Entries with incorrect language header", "Entry maintenance" ], "source": "w+disamb" }, { "_dis": "87 13", "kind": "other", "name": "Pages with 1 entry", "parents": [], "source": "w+disamb" }, { "_dis": "88 12", "kind": "other", "name": "Pages with entries", "parents": [], "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", "Pages with 1 entry", "Pages with entries" ], "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" }
Download raw JSONL data for computability theory meaning in English (1.3kB)
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-11-06 from the enwiktionary dump dated 2024-10-02 using wiktextract (fbeafe8 and 7f03c9b). 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.