Skip to main content
decidable

decidable

1 9.9
A problem that a method can always answer as true or false
  • adjective
  • /dɪˈsaɪdəbl/
  • Specialized
translation icon : decidible
  • The researchers proved that the question of whether certain equations have solutions is decidable within their framework.
  • decidable classes

Examples

  • For systems with finitely many states, these problems are decidable, i.e., can be solved by a computer in a finite number of steps, since they reduce to searches on finite graphs.

    Academic text (2010)
  • In mathematics, a problem is decidable if there is a procedure that can determine its truth or falsity.

  • Well, you know, and now the question is, is that decidable or not?

  • So I said to him, "But it's decidable, you think?"

    Fiction book (1999)
  • There are some problems you can set in computing that just are not decidable at all, not by any algorithm.

  • Therefore, in this case, the reachability problem for a continuous or hybrid system becomes decidable.

    Academic text (2010)
  • When designing algorithms, it's important to identify which problems are decidable to ensure they can be effectively solved.

Antonyms

undecidable
  • Specialized
1 9.9

A problem you cannot show true or false using the rules of a system

How Decidable

decidable
  • Specialized
1 9.9
undecidable
  • Specialized
1 9.9

Surface Forms

decidable positive

Morphology

decidable = decide (transparent) = decide + able

Productive and regular adjective formation from the verb 'decide' with '-able', meaning 'capable of being decided'.

Etymology

Decidable comes from decide, which comes from Latin parts de- 'off' and cidere 'to cut', so to decide is like 'cutting off' other choices. So something decidable is a problem you can follow a fixed method to answer with a clear 'yes' or 'no'.