computability

This term is a specialized technical noun used almost exclusively within the fields of theoretical computer science, mathematics, and logic. It describes a binary state: a problem is either computable or non-computable. It is distinct from "efficiency" or "complexity," as it concerns whether a solution exists in principle, regardless of how much time or memory is required.

As an abstract property, the word is uncountable. It does not refer to a countable object or a specific instance of a calculation, but rather to the theoretical capacity for a process to be executed by a machine. Consequently, it is never used in the plural form.