Skip to search formSkip to main contentSkip to account menu

Course-of-values recursion

Known as: Course of values recursion, Course-of-value recursion 
In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Dynamic programming is a technique for designing algorithms to solve certain optimisation problems. It is similar to the… 
2004
2004
More than being just a tool for expressing algorithms, a well-designed programming language allows the user to express her ideas… 
1998
1998
Abstract. The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so… 
1998
1998
Abstract. If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE… 
1997
1997
Using a function algebra characterization of exponential time due to Monien [5], in the style of Bellantoni-Cook [2], we… 
1997
1997
Abstract. The paper builds on a simply typed term system ${\cal PR}^\omega $ providing a notion of partial primitive recursive…