Introduction

Computability theory is the branch of theoretical computer science

that studies which problems are computationally solvable using
different computation models. It is 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.

Computability theory, also known as recursion theory, is the area of

mathematics dealing with the concept of an effective procedure – a
procedure that can be carried out by following specific rules. For
example, we might ask whether there is some effective procedure –
some algorithm – that, given a sentence about the integers, will decide
whether that sentence is true or false.
Computability theory differs from the related discipline
of computational complexity theory in asking whether a problem can
be solved at all, given any finite but arbitrarily large amount of
resources.
A common model of computation is based on an abstract machine,
the Turing machine