Sciweavers

40 search results - page 3 / 8
» Unary Primitive Recursive Functions
Sort
View
JSYML
2010
114views more  JSYML 2010»
13 years 9 months ago
The Ackermann functions are not optimal, but by how much?
By taking a closer look at the construction of an Ackermann function we see that between any primitive recursive degree and its Ackermann modification there is a dense chain of p...
Harold Simmons
MSCS
2006
100views more  MSCS 2006»
13 years 10 months ago
Modified bar recursion
Modified bar recursion has been used to give a realizability interpretation of the classical axioms of countable and dependent choice. In this paper we survey the main results con...
Ulrich Berger, Paulo Oliva
JUCS
2007
120views more  JUCS 2007»
13 years 10 months ago
Compile-time Computation of Polytime Functions
: We investigate the computational power of C++ compilers. In particular, it is known that any partial recursive function can be computed at compile time, using the template mechan...
Emanuele Covino, Giovanni Pani, Daniele Scrimieri
AML
1999
86views more  AML 1999»
13 years 10 months ago
Subrecursive functions on partial sequences
The paper studies a domain theoretical notion of primitive recursion over partial sequences in the context of Scott domains. Based on a non-monotone coding of partial sequences, t...
Karl-Heinz Niggl
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 12 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao