AI-generated image

incomputability

Pronunciation: /ˌɪnkəmˈpjuːtəbəlti/ noun · British & US
Allowed in UK word games

What does incomputability mean?

Incomputability is the condition of being impossible to compute in the relevant mathematical or computational sense. It usually refers to a class of problems for which no single algorithm can always produce the correct answer or determine whether an answer exists. The most famous example is the halting problem, which asks whether a given program will eventually stop; Alan Turing showed that no general algorithm can answer this question for every possible program. Incomputability does not mean that a particular calculation is difficult, slow, or beyond the capacity of current computers. It means that an algorithmic solution of the required general kind cannot exist at all. Outside computability theory, the term can be used loosely for something that cannot be calculated, though that usage is less exact. For general readers, the word is valuable because it marks a fundamental boundary between routine calculation and questions that resist universal computational treatment.

noun

The quality or state of being unable to be computed or determined by any algorithm or finite procedure. In computability theory, it refers to problems for which no general algorithm can determine whether a solution exists or produce a solution for every valid input.

Senses
  1. The state of being impossible to compute or determine by an algorithm or finite procedure.
  2. In computability theory, the property of a problem for which no algorithm can determine whether a solution exists or produce a solution for every valid input.
Example

"The incomputability of the halting problem led to important limits on what computers can be programmed to do."

More examples

"The researchers proved the incomputability of a broad class of decision problems."

"She explained the significance of the problem's incomputability without resorting to overly technical details."

Did you know?

Incomputability marks the boundary where even the most powerful computer meets a question that no general program can answer.

Reviewed by Deb Chak, Editor. AI-assisted content curated by RJS Tech Solutions LLP.

Where does incomputability come from?

The word is formed from the prefix in-, meaning 'not' or 'without', and computable, which in turn comes from Latin computare, meaning 'to calculate' or 'to reckon'. The noun computability was established in mathematical logic and computer science during the 20th century as scholars formalized the limits of mechanical calculation. Incomputability developed within that tradition, especially through work associated with Alan Turing and the theory of effective procedures.

Related word forms

How incomputability is actually used

This is primarily a technical term in computability theory, logic, and theoretical computer science. In general usage, it may be used more broadly for a quantity or situation that cannot be calculated, but such use is less precise and less common.

Easily confused with incomputability

incalculability

Incomputability means that a problem cannot be solved by a general computational procedure, whereas incalculability usually means that something is too great or complex to calculate.

What's another word for incomputability?

uncomputabilityundecidabilityunsolvability

Words and phrases paired with incomputability

problem of incomputabilityproof of incomputabilityincomputability result

What's the opposite of incomputability?

Rhymes with incomputability