Computability theory (also called recursion theory) studies the fundamental limits of what can be computed by any algorithm, regardless of time or memory constraints. It asks: which problems are solvable at all? " The Church-Turing thesis asserts that any function computable by any reasonable process is computable by a Turing machine.