Lambda calculus characterizations of poly-time
Fundamenta Informaticae - Special issue: lambda calculus and type theory
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Descriptive complexity theory over the real numbers
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Complexity and real computation
Complexity and real computation
Ramified Recurrence and Computational Complexity II: Substitution and Poly-Space
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Computational Models and Function Algebras
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
Journal of Logic and Computation
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Efficient first order functional program interpreter with time bound certifications
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
On Relativizations of the P =? NP Question for Several Structures
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We show that the levels of the polynomial hierarchy correspond to safe recursion with predicative minimization and the levels of the digital polynomial hierarchy to safe recursion with digital predicative minimization. Also, we show that polynomial alternating time corresponds to safe recursion with predicative substitutions and that digital polynomial alternating time corresponds to sate recursion with digital predicative substitutions.