See computable in All languages combined, or Wiktionary
Download JSON data for computable meaning in English (5.8kB)
{
"antonyms": [
{
"word": "non-computable"
},
{
"word": "uncomputable"
}
],
"derived": [
{
"_dis1": "0 0 0 0",
"word": "computably"
},
{
"_dis1": "0 0 0 0",
"word": "computability"
},
{
"_dis1": "0 0 0 0",
"word": "computable function"
},
{
"_dis1": "0 0 0 0",
"word": "computable analysis"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "compute",
"3": "able"
},
"expansion": "compute + -able",
"name": "suffix"
}
],
"etymology_text": "compute + -able",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "computable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"categories": [
{
"_dis": "10 34 36 20",
"kind": "other",
"name": "English terms suffixed with -able",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Capable of being computed, or enumerated."
],
"id": "en-computable-en-adj-3uaRO7k6",
"links": [
[
"Capable",
"capable"
],
[
"compute",
"compute"
],
[
"enumerated",
"enumerated"
]
],
"tags": [
"not-comparable"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "8 52 19 20",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "10 34 36 20",
"kind": "other",
"name": "English terms suffixed with -able",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable."
],
"id": "en-computable-en-adj-vwUxgRy2",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"problem",
"problem"
],
[
"solvable",
"solvable"
],
[
"Turing machine",
"Turing machine"
],
[
"Turing-equivalent",
"Turing-equivalent"
],
[
"model",
"model"
],
[
"Turing-computable",
"Turing-computable"
]
],
"raw_glosses": [
"(computing theory) Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable."
],
"synonyms": [
{
"word": "decidable"
}
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "10 34 36 20",
"kind": "other",
"name": "English terms suffixed with -able",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"of a number, able to be approximated to arbitrary precision by a computable function"
],
"id": "en-computable-en-adj-3WT15-0C",
"links": [
[
"mathematics",
"mathematics"
],
[
"number",
"number"
],
[
"approximate",
"approximate"
],
[
"arbitrary",
"arbitrary"
],
[
"precision",
"precision"
],
[
"computable function",
"computable function"
]
],
"raw_glosses": [
"(mathematics) of a number, able to be approximated to arbitrary precision by a computable function"
],
"synonyms": [
{
"word": "recursive"
},
{
"word": "effective"
}
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
],
"translations": [
{
"_dis1": "29 12 53 5",
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "able to be computed",
"word": "可计算的"
},
{
"_dis1": "29 12 53 5",
"code": "et",
"lang": "Estonian",
"sense": "able to be computed",
"word": "arvutatav"
},
{
"_dis1": "29 12 53 5",
"code": "fi",
"lang": "Finnish",
"sense": "able to be computed",
"word": "laskettava"
},
{
"_dis1": "29 12 53 5",
"code": "de",
"lang": "German",
"sense": "able to be computed",
"word": "berechenbar"
},
{
"_dis1": "29 12 53 5",
"code": "gv",
"lang": "Manx",
"sense": "able to be computed",
"word": "so-choearroo"
},
{
"_dis1": "29 12 53 5",
"code": "gv",
"lang": "Manx",
"sense": "able to be computed",
"word": "so-choontey"
},
{
"_dis1": "29 12 53 5",
"code": "ro",
"lang": "Romanian",
"sense": "able to be computed",
"word": "computabil"
},
{
"_dis1": "29 12 53 5",
"code": "ro",
"lang": "Romanian",
"sense": "able to be computed",
"word": "calculabil"
},
{
"_dis1": "29 12 53 5",
"code": "sk",
"lang": "Slovak",
"sense": "able to be computed",
"word": "vypočítateľný"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Set theory",
"orig": "en:Set theory",
"parents": [
"Mathematics",
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "10 34 36 20",
"kind": "other",
"name": "English terms suffixed with -able",
"parents": [],
"source": "w+disamb"
}
],
"glosses": [
"Of a countably infinite set, having a computable indicator function."
],
"id": "en-computable-en-adj-wRGMjk2h",
"links": [
[
"mathematics",
"mathematics"
],
[
"set theory",
"set theory"
],
[
"countably infinite",
"countably infinite"
],
[
"computable",
"computable function"
],
[
"indicator function",
"indicator function"
]
],
"raw_glosses": [
"(mathematics, set theory) Of a countably infinite set, having a computable indicator function."
],
"synonyms": [
{
"word": "recursive"
},
{
"word": "decidable"
}
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
}
],
"sounds": [
{
"ipa": "/kəmˈpjuːtəbəl/"
},
{
"ipa": "/ˈkɒmpjʊtəbəl/",
"tags": [
"obsolete"
]
},
{
"audio": "LL-Q1860 (eng)-Vealhurl-computable.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/56/LL-Q1860_%28eng%29-Vealhurl-computable.wav/LL-Q1860_%28eng%29-Vealhurl-computable.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/56/LL-Q1860_%28eng%29-Vealhurl-computable.wav/LL-Q1860_%28eng%29-Vealhurl-computable.wav.ogg",
"tags": [
"Southern-England"
],
"text": "Audio (Southern England)"
}
],
"word": "computable"
}
{
"antonyms": [
{
"word": "non-computable"
},
{
"word": "uncomputable"
}
],
"categories": [
"English 4-syllable words",
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms suffixed with -able",
"English terms with IPA pronunciation",
"English terms with audio links",
"English uncomparable adjectives"
],
"derived": [
{
"word": "computably"
},
{
"word": "computability"
},
{
"word": "computable function"
},
{
"word": "computable analysis"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "compute",
"3": "able"
},
"expansion": "compute + -able",
"name": "suffix"
}
],
"etymology_text": "compute + -able",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "computable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"senses": [
{
"glosses": [
"Capable of being computed, or enumerated."
],
"links": [
[
"Capable",
"capable"
],
[
"compute",
"compute"
],
[
"enumerated",
"enumerated"
]
],
"tags": [
"not-comparable"
]
},
{
"categories": [
"en:Theory of computing"
],
"glosses": [
"Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"problem",
"problem"
],
[
"solvable",
"solvable"
],
[
"Turing machine",
"Turing machine"
],
[
"Turing-equivalent",
"Turing-equivalent"
],
[
"model",
"model"
],
[
"Turing-computable",
"Turing-computable"
]
],
"raw_glosses": [
"(computing theory) Of a problem, solvable by a Turing machine or any thereto Turing-equivalent model; Turing-computable."
],
"synonyms": [
{
"word": "decidable"
}
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"of a number, able to be approximated to arbitrary precision by a computable function"
],
"links": [
[
"mathematics",
"mathematics"
],
[
"number",
"number"
],
[
"approximate",
"approximate"
],
[
"arbitrary",
"arbitrary"
],
[
"precision",
"precision"
],
[
"computable function",
"computable function"
]
],
"raw_glosses": [
"(mathematics) of a number, able to be approximated to arbitrary precision by a computable function"
],
"synonyms": [
{
"word": "recursive"
},
{
"word": "effective"
}
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Mathematics",
"en:Set theory"
],
"glosses": [
"Of a countably infinite set, having a computable indicator function."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"set theory",
"set theory"
],
[
"countably infinite",
"countably infinite"
],
[
"computable",
"computable function"
],
[
"indicator function",
"indicator function"
]
],
"raw_glosses": [
"(mathematics, set theory) Of a countably infinite set, having a computable indicator function."
],
"synonyms": [
{
"word": "recursive"
},
{
"word": "decidable"
}
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences",
"set-theory"
]
}
],
"sounds": [
{
"ipa": "/kəmˈpjuːtəbəl/"
},
{
"ipa": "/ˈkɒmpjʊtəbəl/",
"tags": [
"obsolete"
]
},
{
"audio": "LL-Q1860 (eng)-Vealhurl-computable.wav",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/56/LL-Q1860_%28eng%29-Vealhurl-computable.wav/LL-Q1860_%28eng%29-Vealhurl-computable.wav.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/56/LL-Q1860_%28eng%29-Vealhurl-computable.wav/LL-Q1860_%28eng%29-Vealhurl-computable.wav.ogg",
"tags": [
"Southern-England"
],
"text": "Audio (Southern England)"
}
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "able to be computed",
"word": "可计算的"
},
{
"code": "et",
"lang": "Estonian",
"sense": "able to be computed",
"word": "arvutatav"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "able to be computed",
"word": "laskettava"
},
{
"code": "de",
"lang": "German",
"sense": "able to be computed",
"word": "berechenbar"
},
{
"code": "gv",
"lang": "Manx",
"sense": "able to be computed",
"word": "so-choearroo"
},
{
"code": "gv",
"lang": "Manx",
"sense": "able to be computed",
"word": "so-choontey"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "able to be computed",
"word": "computabil"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "able to be computed",
"word": "calculabil"
},
{
"code": "sk",
"lang": "Slovak",
"sense": "able to be computed",
"word": "vypočítateľný"
}
],
"word": "computable"
}
This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.