The property of being computable by purely mechanical means.(noun)
Wiktionary.org : Text is available under the Creative Commons Attribution-ShareAlike License
Use "computability" in a sentence
"The halting problem is a question in computability theory which asks if an algorithm can be found that decides whether a program (a Turning machine) will finish, or run forever, once given a description of such a program and a finite amount of input."
"Ada Lovelace, Haskell Curry, and Noam Chomsky all worked heavily on the foundations of computation/computability theory, and algorithmic programming."
"Nicolas Bourbaki, who never existed, is named in the Bourbaki-Witt theorem, used in computability theory and domain theory."