Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,732,001 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Arithmetical hierarchy
Gödel numbering
Gödel numbering for sequences
Mutual recursion
Expand
Broader (1)
Computability theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Structured Sharing for Dynamic Programming Extended Abstract
Nicolas Wu
2013
Corpus ID: 55880517
Dynamic programming is a technique for designing algorithms to solve certain optimisation problems. It is similar to the…
Expand
2011
2011
Taylor Library: Copyright @ Fontbonne University: Course Reserves & Permissions
Rebecca van Kniest
2011
Corpus ID: 230362407
2004
2004
A Functional Language for Logarithmic Space
Peter Møller Neergaard
Asian Symposium on Programming Languages and…
2004
Corpus ID: 14723036
More than being just a tool for expressing algorithms, a well-designed programming language allows the user to express her ideas…
Expand
1998
1998
A restricted computation model on Scott domains and its partial primitive recursive functionals
Karl-Heinz Niggl
Archive for Mathematical Logic
1998
Corpus ID: 39562362
Abstract. The paper builds on both a simply typed term system ${\cal PR}^\omega$ and a computation model on Scott domains via so…
Expand
1998
1998
On a relation between uniform coding and problems of the form DTIMEF( $\cal F$) =? DSPACEF( $\cal F)$
S. Caporaso
,
M. Zito
Acta Informatica
1998
Corpus ID: 15147035
Abstract. If uniform coding (Gödelization) of potentially infinite sequences of numbers can be performed in PSPACEF, then PSPACE…
Expand
1997
1997
A Safe Recursion Scheme for Exponential Time
P. Clote
Symposium on Logical Foundations of Computer…
1997
Corpus ID: 38173507
Using a function algebra characterization of exponential time due to Monien [5], in the style of Bellantoni-Cook [2], we…
Expand
1997
1997
Non-definability of the Ackermann function with type 1 partial primitive recursion
Karl-Heinz Niggl
Archive for Mathematical Logic
1997
Corpus ID: 206886521
Abstract. The paper builds on a simply typed term system ${\cal PR}^\omega $ providing a notion of partial primitive recursive…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE