Jump to content

Course-of-values recursion

Edit links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SmackBot (talk | contribs) at 13:39, 6 January 2007 (Date/fix the maintenance tags using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In mathematics and computing, course-of-value recursion allows the use of any number of values for previous arguments, as opposed to the primitive recursion where only the value for the immediately preceding argument can be used. Although apparently more general, this notion actually turns out to be reducible to the usual primitive recursion as well.[1]

Notes

  1. ^ Odifreddi, I.7.1.

References

  • Odifreddi, P.G., 1989, Classical Recursion Theory, North Holland; second edition, 1999.


Stub icon

This computer science article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Course-of-values_recursion&oldid=98869621"