+Recursion Theory, also known as Computability Theory, is the study of [Computable Functions](/wiki/computable_functions) and the intrinsic limits of mechanical calculation. It explores which problems can be solved by an algorithm and which are fundamentally unsolvable, often using abstract models like the [Turing Machine](/wiki/turing_machine).
+## See also
+- [Complexity Theory](/wiki/complexity_theory)
+- [Formal Logic](/wiki/formal_logic)
+- [Church-Turing Thesis](/wiki/church-turing_thesis)
... 1 more lines