Recursive definitions specify an object in terms of itself, establishing a base case and a rule for generating the rest of the sequence. They are fundamental in computer science and mathematics for defining sequences, data structures, and algorithms that exhibit self-similarity or iterative processes.