Many useful recursively defined functions have domains that are inductively defined sets.

A function or a procedure is said to be recursively defined if it is defined in terms of itself.

A function f is recursively defined if at least one value f(x) is defined in terms of another value f(y), where x ≠ y.

Only finite sequences can be defined recursively.