Recursive functions are functions that call themselves in order to solve a problem by breaking it into smaller, more manageable sub-problems. They are widely used in computer science for tasks such as traversing data structures, solving puzzles, and implementing algorithms like quicksort and mergesort.