Skip to Main content Skip to Navigation

Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time

Olivier Bournez 1 Paulin de Naurois 1 Jean-Yves Marion 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00101068
Contributor : Publications Loria <>
Submitted on : Tuesday, September 26, 2006 - 2:55:44 PM
Last modification on : Thursday, January 11, 2018 - 6:19:57 AM

Identifiers

  • HAL Id : inria-00101068, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

174