Article ID Journal Published Year Pages File Type
426965 Information and Computation 2006 21 Pages PDF
Abstract

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 safe recursion with digital predicative substitutions.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics