Sciweavers

Share
CORR
2004
Springer
110views Education» more  CORR 2004»
9 years 1 months ago
On Modal Logics of Partial Recursive Functions
Abstract. The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends pro...
Pavel Naumov
JUCS
2007
120views more  JUCS 2007»
9 years 1 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
books