FAQ

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

Related topics

Related topics

7 relations
Arithmetical hierarchyComputability theoryGödel numberingMutual recursion
(More)

Related mentions per year

Related mentions per year

1939-2018
19401960198020002020
Course-of-values recursion
Recursion
Arithmetical hierarchy
Computability theory
Primitive recursive function
Mutual recursion

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2004
2004
On a relation between uniform coding and problems of the form DTIMEF ( F ) = ? DSPACEF ( F ) Salvatore
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
On a relation between uniform coding and problems of the form DTIMEF( $\cal F$ ) =? DSPACEF( $\cal F)$
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
A Safe Recursion Scheme for Exponential Time
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
Non-definability of the Ackermann function with type 1 partial primitive recursion
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
A Recursive Introduction to the Theory of Computation
complexity measure 137 acceptable programming system 33, 48, 49, 50, 52, 68, 71, 78, 84,89 arbitrarily complex functions 75… (More)
Is this relevant?