Computability
Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem.

The most widely studied models of computability are the Turing-computable and μ-recursive functions, and the lambda calculus, all of which have computationally equivalent power. Other forms of computability are studied as well: computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field of hypercomputation.
Q818930
computability theory
Concept
Q1166618
mathematical logic
Concept
Q844718
theory of computation
Concept
Q21198
computer science
Concept
Q8366
algorithm
Concept
Q163310
Turing-computable
Concept
Q284164
μ-recursive function
Concept
Q242028
lambda calculus
Concept
Q214526
automata theory
Concept
Q2661997
hypercomputation
UNK
Q818888
Computability
Concept
studies
studies
subclass of
subclass of
part of