The new promise of analog computation

• Type: Article in International Conference Proceedings Book
• Date: 2007

Authors

Costa, JF (Author) Other; Loff, B (Author) Other; Mycka, J (Author) Other

Conference proceedings International

Title: COMPUTATION AND LOGIC IN THE REAL WORLD, PROCEEDINGS

Pages: 189-195

3rd Conference on Computability in Europe (CiE 2007)

Siena, ITALY, JUN 18-23, 2007

Indexing

ISI Web of Knowledge - 1 Citation

Scopus - 0 Citations

Other information

Authenticus ID: P-004-CT0

DOI: 10.1007/978-3-540-73001-9_20

Abstract (EN): 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/iiierarchy.pdf.).

Language: English

Type (Professor's evaluation): Scientific

No. of pages: 7