429 search results - page 44 / 86 » Turing computations on ordinals |
CIE
2005
Springer
15 years 3 months ago
2005
Springer
We argue that there is currently no satisfactory general framework for comparing the extensional computational power of arbitrary computational models operating over arbitrary doma...
MFCS
1989
Springer
15 years 1 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
ICALP
2004
Springer
15 years 3 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...
RTA
2010
Springer
15 years 1 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
FUIN
2006
14 years 9 months ago
2006
Abstract. With inspiration from the economic reality, where numbers are basic entities to work with, we propose a genuinely new kind of P systems, where numerical variables evolve,...