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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1994-2004
01219942004

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE = EXPTIME… (More)
Is this relevant?
1998
1998
If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE = EXPTIME… (More)
Is this relevant?
1997
1997
Using a function algebra characterization of exponential time due to Monien 5], in the style of Bellantoni-Cook 2], we… (More)
Is this relevant?
1997
1997
The paper builds on a simply typed term system PR providing a notion of partial primitive recursive functional on arbitrary Scott… (More)
Is this relevant?
1994
1994
complexity measure 137 acceptable programming system 33, 48, 49, 50, 52, 68, 71, 78, 84,89 arbitrarily complex functions 75… (More)
Is this relevant?