Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
- 1 February 2005
- journal article
- Published by Oxford University Press (OUP) in Journal of Logic and Computation
- Vol. 15 (1) , 41-58
- https://doi.org/10.1093/logcom/exh036
Abstract
We provide several machine-independent characterizations of deterministic complexity classes in the model of computation proposed by L. Blum, M. Shub and S. Smale. We provide a characterization of partial recursive functions over any arbitrary structure. We show that polynomial time over an arbitrary structure can be characterized in terms of safe recursion. We show that polynomial parallel time over an arbitrary structure can be characterized in terms of safe recursion with substitutions.Keywords
This publication has 0 references indexed in Scilit: