Jump to content

Recursive function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Epbr123 (talk | contribs) at 16:46, 6 June 2008 (Reverted edits by 70.20.128.142 to last version by Xyzzyplugh (huggle)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Recursive function may refer to:

  • A recursive function: a procedure or subroutine, implemented in a programming language, whose implementation references itself
  • A μ-recursive function, defined from a particular formal model of computable functions using primitive recursion and the μ operator
  • A function computable by a Turing machine, as a synonym for computable function
  • A function using some other form of recursion