See undecidable on Wiktionary
Download JSON data for undecidable meaning in All languages combined (5.8kB)
{
"antonyms": [
{
"word": "decidable"
}
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "un",
"3": "decidable"
},
"expansion": "un- + decidable",
"name": "prefix"
}
],
"etymology_text": "un- + decidable",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "undecidable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"_dis1": "0 0",
"word": "noncomputable"
}
],
"senses": [
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"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": "67 33",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "57 43",
"kind": "other",
"name": "English terms prefixed with un-",
"parents": [],
"source": "w+disamb"
}
],
"examples": [
{
"ref": "1982, Wolfgang Bibel, Automated Theorem Proving, Braunschweig: Friedr. Vieweg & Sohn, page 83",
"text": "The first-order procedure SP differs from the proposi-\ntional procedure CP°₁ in an essential feature. Namely, CP°₁\nalways terminates while SP may run forever as we have seen with\nthe example immediately after (3.7). This is not a specific\ndefect of SP. Rather it is known that first-order logic is an\nundecidable theory while propositional logic is a decidable\ntheory. This means that for the latter there are decision pro-\ncedures which for any formula decide whether it is valid or\nnot — and CP°₁ in fact is such a decision procedure — while\nfor the former such decision procedures do not exist in princi-\nple. Thus SP, according to these results for which the reader\nis referred to any logic texts such as [End], [DrG] or [Lew],\nis of the kind which we may expect, it is a semi-decision\nprocedure which confirms if a formula is valid but may run\nforever for invalid formulas. Therefore, termination by running\nout of time or space after any finite number of steps will\nleave the question for the validity of a formula unsettled. [...]",
"type": "quotation"
}
],
"glosses": [
"Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"id": "en-undecidable-en-adj-Cc4G40e4",
"links": [
[
"mathematics",
"mathematics"
],
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"algorithm",
"algorithm"
],
[
"finite",
"finite"
],
[
"string",
"string"
],
[
"computer",
"computer"
],
[
"memory",
"memory"
]
],
"raw_glosses": [
"(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
],
"translations": [
{
"_dis1": "83 17",
"code": "cs",
"lang": "Czech",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nerozhodnutelný"
},
{
"_dis1": "83 17",
"code": "fi",
"lang": "Finnish",
"sense": "incapable of being algorithmically decided",
"word": "ratkeamaton"
},
{
"_dis1": "83 17",
"code": "de",
"lang": "German",
"sense": "incapable of being algorithmically decided",
"word": "unentscheidbar"
},
{
"_dis1": "83 17",
"code": "he",
"lang": "Hebrew",
"roman": "í-karí'a",
"sense": "incapable of being algorithmically decided",
"word": "אי-כריע"
},
{
"_dis1": "83 17",
"code": "pl",
"lang": "Polish",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nierozstrzygalny"
},
{
"_dis1": "83 17",
"code": "ro",
"lang": "Romanian",
"sense": "incapable of being algorithmically decided",
"word": "nedecidabil"
},
{
"_dis1": "83 17",
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "incapable of being algorithmically decided",
"word": "neodlučiv"
},
{
"_dis1": "83 17",
"code": "es",
"lang": "Spanish",
"sense": "incapable of being algorithmically decided",
"word": "indecidible"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Mathematics",
"orig": "en:Mathematics",
"parents": [
"Formal sciences",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"(of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"id": "en-undecidable-en-adj-7RhXqDqc",
"links": [
[
"mathematics",
"mathematics"
],
[
"WFF",
"WFF"
],
[
"logically independent",
"logically independent"
],
[
"axiom",
"axiom"
]
],
"raw_glosses": [
"(mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
]
}
],
"sounds": [
{
"audio": "en-us-undecidable.ogg",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/5d/En-us-undecidable.ogg/En-us-undecidable.ogg.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/5/5d/En-us-undecidable.ogg",
"tags": [
"US"
],
"text": "Audio (US)"
}
],
"wikipedia": [
"undecidable"
],
"word": "undecidable"
}
{
"antonyms": [
{
"word": "decidable"
}
],
"categories": [
"English adjectives",
"English entries with incorrect language header",
"English lemmas",
"English terms prefixed with un-",
"English terms with audio links",
"English uncomparable adjectives"
],
"etymology_templates": [
{
"args": {
"1": "en",
"2": "un",
"3": "decidable"
},
"expansion": "un- + decidable",
"name": "prefix"
}
],
"etymology_text": "un- + decidable",
"head_templates": [
{
"args": {
"1": "-"
},
"expansion": "undecidable (not comparable)",
"name": "en-adj"
}
],
"lang": "English",
"lang_code": "en",
"pos": "adj",
"related": [
{
"word": "noncomputable"
}
],
"senses": [
{
"categories": [
"English terms with quotations",
"en:Mathematics",
"en:Theory of computing"
],
"examples": [
{
"ref": "1982, Wolfgang Bibel, Automated Theorem Proving, Braunschweig: Friedr. Vieweg & Sohn, page 83",
"text": "The first-order procedure SP differs from the proposi-\ntional procedure CP°₁ in an essential feature. Namely, CP°₁\nalways terminates while SP may run forever as we have seen with\nthe example immediately after (3.7). This is not a specific\ndefect of SP. Rather it is known that first-order logic is an\nundecidable theory while propositional logic is a decidable\ntheory. This means that for the latter there are decision pro-\ncedures which for any formula decide whether it is valid or\nnot — and CP°₁ in fact is such a decision procedure — while\nfor the former such decision procedures do not exist in princi-\nple. Thus SP, according to these results for which the reader\nis referred to any logic texts such as [End], [DrG] or [Lew],\nis of the kind which we may expect, it is a semi-decision\nprocedure which confirms if a formula is valid but may run\nforever for invalid formulas. Therefore, termination by running\nout of time or space after any finite number of steps will\nleave the question for the validity of a formula unsettled. [...]",
"type": "quotation"
}
],
"glosses": [
"Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"links": [
[
"mathematics",
"mathematics"
],
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"algorithm",
"algorithm"
],
[
"finite",
"finite"
],
[
"string",
"string"
],
[
"computer",
"computer"
],
[
"memory",
"memory"
]
],
"raw_glosses": [
"(mathematics, computing theory) Incapable of being algorithmically decided in finite time. For example, a set of strings is undecidable if it is impossible to program a computer (even one with infinite memory) to determine whether or not specified strings are included."
],
"tags": [
"not-comparable"
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
},
{
"categories": [
"en:Mathematics"
],
"glosses": [
"(of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"links": [
[
"mathematics",
"mathematics"
],
[
"WFF",
"WFF"
],
[
"logically independent",
"logically independent"
],
[
"axiom",
"axiom"
]
],
"raw_glosses": [
"(mathematics) (of a WFF) logically independent from the axioms of a given theory; i.e., that it can never be either proved or disproved (i.e., have its negation proved) on the basis of the axioms of the given theory. (Note: this latter definition is independent of any time bounds or computability issues, i.e., more Platonic.)"
],
"tags": [
"not-comparable"
],
"topics": [
"mathematics",
"sciences"
]
}
],
"sounds": [
{
"audio": "en-us-undecidable.ogg",
"mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/5/5d/En-us-undecidable.ogg/En-us-undecidable.ogg.mp3",
"ogg_url": "https://upload.wikimedia.org/wikipedia/commons/5/5d/En-us-undecidable.ogg",
"tags": [
"US"
],
"text": "Audio (US)"
}
],
"translations": [
{
"code": "cs",
"lang": "Czech",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nerozhodnutelný"
},
{
"code": "fi",
"lang": "Finnish",
"sense": "incapable of being algorithmically decided",
"word": "ratkeamaton"
},
{
"code": "de",
"lang": "German",
"sense": "incapable of being algorithmically decided",
"word": "unentscheidbar"
},
{
"code": "he",
"lang": "Hebrew",
"roman": "í-karí'a",
"sense": "incapable of being algorithmically decided",
"word": "אי-כריע"
},
{
"code": "pl",
"lang": "Polish",
"sense": "incapable of being algorithmically decided",
"tags": [
"masculine"
],
"word": "nierozstrzygalny"
},
{
"code": "ro",
"lang": "Romanian",
"sense": "incapable of being algorithmically decided",
"word": "nedecidabil"
},
{
"code": "sh",
"lang": "Serbo-Croatian",
"sense": "incapable of being algorithmically decided",
"word": "neodlučiv"
},
{
"code": "es",
"lang": "Spanish",
"sense": "incapable of being algorithmically decided",
"word": "indecidible"
}
],
"wikipedia": [
"undecidable"
],
"word": "undecidable"
}
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-05-03 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.