Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time

Résumé

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-00099618 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00099618 , version 1

Citer

Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, Jean-Yves Marion. Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time. Foundations of Software Science and Computation Structures - FOSSACS'03, Apr 2003, Warsaw, Poland, pp.185-199. ⟨inria-00099618⟩
54 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More