Definition of Recursive

Something is recursive if it is applied to its own results over and over again.

In mathematics, we often deal with recursive sequences, or recursive functions.

For example, the sequence \(3,6,12,24,\dots\) has a recursive definition. We start with \(3\) and find each term by doubling the term before it.

Another recursive sequence is \(1,3,5,6,\dots\), where each term is found by adding \(2\) to the previous term (You start with \(1\) and add \(2\). You then add \(2\) to the result. You then add \(2\) to the result of the result, and so on).

Computer scientists also talk about recursive processes. Once the output of the process is found, the process begins again, using the output values of the previous process as input values.