Recursive functions are functions that call themselves. But can we stop the definition at that? I think a word about the exit condition is as important as the first part of the definition.
Recursive functions are used not just in Computer Science but also in Mathematical Logic. So having an understanding from the perspective also helps.
Referenced in:
All notes