Recursion theory, also known as computability theory, is a branch of mathematical logic and computer science that studies the capabilities and limitations of algorithms in terms of what problems can be solved by them. It explores the concept of recursive functions and the classification of problems based on their solvability and computational complexity.