# recursive function

Strictly speaking, a recursive function is a function that is computable. However, in the usual sense of the word, a function is said to be recursive
if its definition make reference to itself (see recursion).
For example, factorial can be defined
as *x*! = *x*(*x* - 1)! with the base case of 1! equal
to 1.