The new promise of analog computation

Abstract

We show that, using our more or less established framework of inductive definition of real-valued functions (work started by Cristopher Moore in [9]) together with ideas and concepts of standard computability we can prove theorems of Analysis. Then we will consider our ideas as a bridging tool between the standard Theory of Computability (and Complexity) on one side and Mathematical Analysis on the other, making real recursive functions a possible branch of Descriptive Set Theory. What follows is an Extended Abstract directed to a large audience of CiE 2007, Special Session on Logic and New Paradigms of Computability. (Proofs of statements can be found in a detailed long paper at the address http://fgc.math.ist.utl.pt/papers/hierarchy.pdf.) © Springer-Verlag Berlin Heidelberg 2007.