Polynomial-time versus recursive models

Abstract

The central problem considered in this paper is whether a given recursive structure is recursively isomorphic to a polynomial-time (p-time) structure. Positive results are obtained for all relational structures, for all Boolean algebras and for the natural numbers with addition, multiplication and the unary function 2x. Counterexamples are constructed for recursive structures with one unary function and for Abelian groups and also for relational structures when the universe of the structure is fixed. Results are also given which distinguish primitive recursive structures, exponential-time structures and structures with honest witnesses. © 1991.