As all of us know, Google is using “Did you mean” feature that can normally correct your misspellings for defining the word “recursion” using “see recursion” and pointing to the same definition.
A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can then be built up from a few initial values and a small number of rules.

Click to search Google in reverse order

The Fibonacci numbers are most commonly defined recursively. Care, however, must be taken to avoid self-recursion, in which an object is defined in terms of itself, leading to an infinite nesting.

[ Source ]