Recursive Analysis Characterized as a Class of Real Recursive Functions - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Fundamenta Informaticae Année : 2006

Recursive Analysis Characterized as a Class of Real Recursive Functions

Résumé

Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementarily computable functions over the real numbers in the sense of recursive analysis. In a different and orthogonal work, we proposed a minimization schema that allows to provide a class of real recursive functions that corresponds to extensions of computable functions over the integers. Mixing the two approaches we prove that computable functions over the real numbers in the sense of recursive analysis can be characterized as the smallest class of functions that contains some basic functions, and closed by composition, linear integration, minimization and limit schema.
Fichier non déposé

Dates et versions

inria-00000515 , version 1 (26-10-2005)

Identifiants

  • HAL Id : inria-00000515 , version 1

Citer

Olivier Bournez, Emmanuel Hainry. Recursive Analysis Characterized as a Class of Real Recursive Functions. Fundamenta Informaticae, 2006, 74 (4), pp.409-433. ⟨inria-00000515⟩
227 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More