Recursion Theory, also known as Computability Theory, is the study of 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.