Recursive Function Theory is a branch of mathematical logic and computer science that deals with the study of computable functions and the classification of problems based on their solvability by algorithms. It lays the foundation for understanding the limits of computation and the nature of algorithmic processes, emphasizing the role of recursion in defining computable functions.