Recursive Analysis Characterized as a Class of Real Recursive Functions

Recently, using a limit schema, we presented an analog and machine independent algebraic characterization of elementary functions over the real numbers in the sense of recursive analysis. In a different and orthogonal work, we proposed a minimalization 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, minimalization and limit schema.

• Type: Journal
• Year: 2006
• Where: FUIN
• Authors: Olivier Bournez, Emmanuel Hainry
• Keywords: Computable Functions, FUIN 2006, Real Numbers, Recursive Analysis