On the complexity of computable real sequences
Torán, Jacobo
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987), p. 175-180 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1987-01-01
@article{ITA_1987__21_2_175_0,
     author = {Tor\'an, Jacobo},
     title = {On the complexity of computable real sequences},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {21},
     year = {1987},
     pages = {175-180},
     mrnumber = {894709},
     zbl = {0634.68032},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1987__21_2_175_0}
}

Torán, Jacobo. On the complexity of computable real sequences. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) pp. 175-180. http://gdmltest.u-ga.fr/item/ITA_1987__21_2_175_0/

1. O. Aberth, Computable Analysis, McGraw-Hill, New York, 1980. | Zbl 0461.03015

2. K. Ko and H. Friedman, Computational Complexity of Real Functions, Theoretical Computer Science, Vol. 20, 1982, pp. 323-352. | MR 666209 | Zbl 0498.03047

3. K. Ko, On the Definitions of Some Complexity Classes of Real Numbers, Math. Systems Theory, Vol. 16, 1983, pp. 95-109. | MR 696140 | Zbl 0529.03016

4. A. Mostowski, On Computable Real Sequences, Fund. Math., Vol. 44, 1957, pp. 37-51. | MR 91242 | Zbl 0079.24702

5. H. G. Rice, Recursive Real Numbers, Proc Amer. Math. Soc., Vol. 5, 1954, pp. 784-791. | MR 63328 | Zbl 0058.00602

6. R. M. Robinson, Review of R. Peter's Book, Rekursive Funktionen, J. Symbolic Logic, Vol. 16, 1951, pp. 280-282.

7. E. Specker, Nicht-Konstruktiv beweisbare Sätze des Analysis, J. Symbolic Logic, Vol. 14, 1949, pp. 145-158. | MR 31447 | Zbl 0033.34102

8. J. Torán, Computabilidad y complejidad computacional de algunos problemas del analisis real elemental, Tesina de la Universidad Complutense de Madrid. 1985.

9. A. M. Turing, On Computable Real Numbers with an Application to the Entscheidungs Problem, Proc. London Math. Soc., 1937, pp. 230-265. | JFM 62.1059.03