Recursion theory, fundamentally, explores the extent to which problems or functions can be solved or computed using algorithms. It revolves around classifying problems based on their solvability or unsolvability and levels of computational complexity. Central concepts include recursive functions, recursively enumerable sets, and the halting problem.