This document provides an introduction to recursion in computer science. It explains that recursion is when a function calls itself, and gives an example of writing a recursive function to calculate the factorial of a number. The factorial function takes a number as a parameter, has a base case where it returns 1 if the number is 1, and recursively calls itself with the number-1 parameter while multiplying the return values to calculate the factorial.