1. the quality or state of being decidable; the property of a problem or proposition that can be determined to be true or false by a finite algorithmic procedure.
Usage: formal; logic and computer science

Examples

• The decidability of a mathematical problem determines whether an algorithm can solve it in finite time.
• In formal logic, decidability is a key property that separates tractable from intractable problems.
• Computer scientists study the decidability of various computational problems to understand their complexity.
• The decidability of first-order logic remains an important topic in mathematical logic.
• Not all mathematical questions have decidability; some are fundamentally undecidable.