1. the quality or state of being computable; the ability to be calculated or solved by a computer or algorithm.
Usage: technical; primarily used in computer science and mathematics
2. in theoretical computer science, the property of a function or problem that can be solved by a Turing machine or equivalent computational model.
Usage: formal; specialized in computability theory

Examples

• The computability of the algorithm determines whether it can run on modern computers.
• Researchers study the computability of mathematical functions to understand their limits.
• The Halting Problem is a famous example of a question whose computability remains undecidable.
• Computability theory explores which problems can be solved by computational means.
• The computability of this equation makes it suitable for numerical analysis.