2272 search results - page 249 / 455 » A Calculus for |
118
click to vote
APAL
2006
15 years 4 months ago
2006
We aim at a conceptually clear and technical smooth investigation of Ackermann's substitution method. Our analysis provides a direct classification of the provable recursive ...
124
Voted
BSL
2006
15 years 4 months ago
2006
We give a self-contained and streamlined version of the classification of the provably computable functions of PA. The emphasis is put on illuminating as good as seems possible th...
114
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
In this paper we present the derivation details, logic, and motivation for the three loop calculus introduced in Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R)). Generating ...
122
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
138
click to vote
JFP
2008
15 years 4 months ago
2008
Most programming languages adopt static binding, but for distributed programming an exclusive reliance on static binding is too restrictive: dynamic binding is required in various...