recursive function

English

Noun

recursive function (plural recursive functions)

1. (computing) Any function that uses recursion and can call itself until a certain condition is met.
2. (mathematics) Any function whose value may be obtained using a finite number of operations using a precisely specified algorithm.

Hypernyms

• function

 

Hyponyms

• partial recursive function
• primitive recursive function

 

Translations

Translations

• French: fonction récursive (fr) f

References

• recursive function on Wikipedia.Wikipedia