268 search results - page 3 / 54 » Recursion Theoretic Operators for Function Complexity Classe... |
STACS
2007
Springer
14 years 8 days ago
2007
Springer
Abstract. In many security protocols, such as group protocols, principals have to perform iterative or recursive computations. We call such protocols recursive protocols. Recently,...
ICALP
2004
Springer
13 years 11 months ago
2004
Springer
Abstract We present an analog and machine-independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis: we p...
CSL
2007
Springer
14 years 9 days ago
2007
Springer
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Ong has shown that the modal mu-calculus model checking problem (equivalently, the alternating parity tree automaton (APT) acceptance problem) of possibly-infinite ranked trees gen...