Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2002

Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time

Abstract

In this paper, 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 computable functions over any arbitrary structure can be characterized in term of safe recursive functions. We show that polynomial parallel time decision problems over any arbitrary structure can be characterized in terms of safe recursive functions with substitutions.
Not file

Dates and versions

inria-00101068 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00101068 , version 1

Cite

Olivier Bournez, Paulin de Naurois, Jean-Yves Marion. Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time. [Intern report] A02-R-322 || bournez02d, 2002, 24 p. ⟨inria-00101068⟩
125 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More