Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2002

Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time

Résumé

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.
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : inria-00101068 , version 1

Citer

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 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More