computability
Noun
Meaning
computability (countable and uncountable, plural computabilities)
(computing theory) The property of being computable by purely mechanical means.
Synonyms
Examples
Feferman 1999, p. 1 Alonzo Church and Alan Turing proposed formal models of computability, giving independent negative solutions to Hilbert's Entscheidungsproblem in 1936 and 1937, respectively.
Classical recursion theory focuses on the computability of functions from the natural numbers to the natural numbers.
Comments by Gödel on the subject suggest this view, e.g. "the correct definition of mechanical computability was established beyond any doubt by Turing".
Computability theory The first result of computability theory is that it is impossible in general to predict what a Turing-complete program will do over an arbitrarily long time.
Connections with computer science main The study of computability theory in computer science is closely related to the study of computability in mathematical logic.
During this year, Gödel also developed the ideas of computability and recursive functions to the point where he was able to present a lecture on general recursive functions and the concept of truth.