Course-of-value recursion

From Wikipedia, the free encyclopedia

You have new messages (last change).
There are very few or no other articles that link to this one.
Please help introduce links in articles on related topics. After links have been created, remove this message.
This article has been tagged since October 2006.

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]

[edit] Notes

  1. ^ Odifreddi, I.7.1.

[edit] References

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


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../c/o/u/Course-of-value_recursion.html"