Recursion is a method in mathematics and computer science where a function or process calls itself to solve a problem by breaking it down into smaller and simpler sub-problems, making it possible to solve complex problems by decomposing them into smaller and more manageable parts.