Safe Recursion and Calculus over an Arbitrary Structure - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Safe Recursion and Calculus over an Arbitrary Structure

Abstract

In this paper, we show that the Bellantoni and Cook characterization of polynomial time computable functions in term of safe recursive functions can be transfered to the model of computation over an arbitrary structure developped by L. Blum, M. Shub and S. Smale. Hence, we provide an implicit complexity characterization of functions computable in polynomial time over any arbitrary structure.
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00100884 , version 1

Cite

Olivier Bournez, Paulin de Naurois, Jean-Yves Marion. Safe Recursion and Calculus over an Arbitrary Structure. Implicit Computational Complexity - ICC'2002, Jul 2002, Copenhagen, Denmark, 12 p. ⟨inria-00100884⟩
59 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More