Jump to content

Recursive function

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Trovatore (talk | contribs) at 06:11, 22 August 2017 (why "total" specifically? Partial recursive == partial computable, total recursive == total computable. I'm not aware of any convention requiring recursive functions to be total and computable ones not.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Recursive function may refer to:

See also

  • μ-recursive function, defined from a particular formal model of computable functions using primitive recursion and the μ operator
  • Recurrence relation, in mathematics, an equation that defines a sequence recursively