inria-00421561, version 1

## Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions

Olivier Bournez () 1, Walid Gomaa () 23, Emmanuel Hainry () a2

(2009)

Résumé : Recursive analysis is the most classical approach to model and discuss computations over the reals. It is usually presented using Type 2 or higher order Turing machines. Recently, it has been shown that computability classes of functions computable in recursive analysis can also be defined (or characterized) in an algebraic machine independent way, without resorting to Turing machines. In particular nice connections between the class of computable functions (and some of its sub- and sup-classes) over the reals and algebraically defined (sub- and sup-) classes of $\R$-recursive functions à la Moore 96 have been obtained. However, until now, this has been done only at the computability level, and not at the complexity level. In this paper we provide a framework that allows us to dive into the complexity level of functions over the reals. In particular we provide the first algebraic characterization of polynomial time computable functions over the reals. This framework opens the field of implicit complexity of functions over the reals, and also provide a new reading of some of the existing characterizations at the computability level.

• Domaine : Sciences cognitives/Informatique
Informatique/Complexité

• inria-00421561, version 1
• oai:hal.inria.fr:inria-00421561
• Contributeur :
• Soumis le : Lundi 5 Octobre 2009, 16:02:33
• Dernière modification le : Vendredi 23 Octobre 2009, 16:52:36