recursion theory

For the branch of computer science called computability theory, see Computability theory (computer science).Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability and definability. In these areas, recursion theory overlaps with proof theory and effective descriptive set theory.
See more at Wikipedia.org...

<theory> The study of problems that, in principle, cannot be solved by either computers or humans.
[Proper definition?]
(1999-03-01)