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

Hyponyms
  • partial recursive function
  • primitive recursive function

References
This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.