Complexity theory on real numbers and functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 145 LNCS, Issue , 1982, Pages 165-174

  Kreitz, Christoph ^a   Weihrauch, Klaus ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY;

COMPLEXITY THEORY; COMPUTABLE REAL NUMBERS; REAL NUMBERS AND FUNCTIONS;

MATHEMATICAL TECHNIQUES;

EID: 0020219723     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036478     Document Type: Conference Paper

References (19)

1. O. Aberth, Computable Analysis, McGraw-Hill, 1980.
2. E. Bishop, Foundations of constructive analysis, McGraw-Hill, 1967.
3. M. Blum, A machine-independant theory of the complexity of recursive functions, J. ACM 14 (1967) 332-336.
4. A. Borodin, Complexity classes of recursive functions and the existence of complexity gaps, Conf. Rec. ACM Symp. on Theory of Computing (1969), 67-78.
5. G.S. Ceitin, Algorithmic operators in constructive complete separable metric spaces (Russian), Doklady Akad. Nauk 128 (1959), 49-52.
6. A. Grzegorczyk, On the definitions of computable real continuous functions, Fundamenta mathematicae 44 (1957) 61-71.
7. K. Ko & M. Friedman, Computational complexity of real functions, TCS 20 (1982), 323-352.
8. C. Kreitz & K. Weihrauch, Komplexitätstheorie auf reellen Zahlen und Funktionen, Informatik Bericht Nr. 28 (1982), Fernuniversität Hagen.
9. K. Kuratowski, Topology (Vol. 1), Academic Press, 1966.
10. D. Lacombe, Extension de la notion de function recursive aux functions d’une au plusieurs variables réelles, Comptes Rendus Acad. Sci. Paris 240 (1955), 2478-2480, Vol. 241 (1955), 13-14, 151-153, 1250-1252.
11. A.A. Markov, On the continuity of constructive functions, Uspehi, Math. Nauk. 9 (1954), 226-230.
12. P. Martin-Löf, Notes on constructive mathematics, Almquist & Wiksell, 1970.
13. S. Mazur, Computable Analysis, Warschau 1963.
14. H.G. Rice, Recursive real numbers, Proc. Amer. Soc. 5 (1954), 784-791.
15. H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, 1967.
16. E. Specker, Nicht konstruktiv beweisbare Sätze der Analysis, J. Symb. Logic 14 (1949), 145-158.
17. A.M. Turing, On computable numbers with an application to the entscheidungsproblem, Proc. London Math. Soc. 42 (1937), 230-265.
18. K. Weihrauch, Recursion and complexity theory on cpo’s, Proc. 5th GI-Conf. (P. Deussen ed.), LNCS 104, Springer (1981), 195-202.
19. K. Weihrauch, Complexity on metric spaces, Informatik Bericht Nr. 21 (1981), Fernuniversität Hagen.