In computability theory, course-of-values recursion is a technique for defining number-theoretic functions by recursion. In a definition of aâ€¦Â (More)

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

- Salvatore Caporaso, Michele Zito
- Acta Informatica
- 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

- Peter Clote
- LFCS
- 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

- Karl-Heinz Niggl
- Arch. Math. Log.
- 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

- Carl H. Smith
- Graduate Texts in Computer Science
- 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?