What does undecidability mean?
Undecidability is the condition of a question, proposition, or problem that cannot be decided or settled. In ordinary discussion, it can describe an issue whose resolution is exceptionally difficult or appears practically impossible. In mathematical logic and theoretical computer science, it has a stronger technical meaning: a statement or class of problems is undecidable when no algorithm can always determine whether it satisfies a specified condition. This concept underlies famous results such as the undecidability of the halting problem and of Entscheidungsproblem, the general decision problem for first-order logic. The word is formal and mainly used in academic and technical contexts. Its importance lies in showing that some limitations are not simply consequences of insufficient computing power or human effort; they are fundamental features of the problems themselves.
nounThe state of being unable to be decided or settled. In logic and computer science, it refers to a proposition or problem for which no procedure can determine whether a given condition holds.
- The state of a question, issue, or proposition being impossible or impracticable to decide.
- In mathematical logic and theoretical computer science, the property of a problem or statement for which no algorithm can determine whether it is true or false.
"The undecidability of the general halting problem became a fundamental result in theoretical computer science."
"The committee acknowledged the undecidability of several unresolved practical questions."
"Church's theorem established the undecidability of Entscheidungsproblem, the decision problem for first-order logic."
Rare; the word is normally used as an uncountable abstract noun.
"The paper examined several apparent undecidabilities arising from incomplete or contradictory information."
Some questions are not merely difficult to answer: in formal logic, they are provably impossible for any algorithm to decide.
Reviewed by Deb Chak, Editor. AI-assisted content curated by RJS Tech Solutions LLP.
Where does undecidability come from?
Undecidability was formed in English by combining the prefix un- with decidability, which in turn derives from decide. Decide comes through French from Latin decidere, formed from de- and cidere, meaning to strike or decide. The negative construction developed as the noun corresponding to the adjective undecidable, and the word became particularly prominent through twentieth-century work in mathematical logic and computability theory.
How undecidability is actually used
A formal and chiefly academic term. It is especially common in mathematical logic, computability theory, philosophy of mathematics, and the theory of algorithms, where it has a precise technical meaning.
Easily confused with undecidability
Indecision is difficulty in making a personal choice, whereas undecidability usually refers to a proposition or problem that cannot be settled or decided.