Preview
Unable to display preview. Download preview PDF.
References
D. Scott, Outline of a mathematical theory of computation, Technical Monograph PRG-2, Nov. 1970, Oxford University Computing Laboratory.
H. Egli, R.L. Constable, Computability concepts for programming language semantics, Theoretical Computer Science 2 (1976) 133–145.
M.B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977) 257–274.
A. Kanda, D. Park, When are two effectively given domains identical, in: K. Weihrauch (Hrsg.), Theoretical Computer Science 4th GI-Conference, S. 170–181, Springer, Berlin 1979.
E. Sciore, A. Tang, Admissible coherent c.p.o.'s, in: Automata, Languages and Programming, 5th Colloquium, 1978, Lecture notes in Computer Science 62, Springer, Berlin 1978.
M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM 14 (1967) 322–336.
H. Rogers, Gödel numberings of partial recursive functions, Journal of Symbolic Logic 23 (1958) 331–341.
U. Schreiber, K. Weihrauch, Embedding metric spaces into cpo-s, to appear in Theoretical Computer Science.
H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, New York 1967.
J.L. Ersov, Theorie der Numerierungen I, Zeitschr. f. math. Logik und Grundlagen d. Math. 19 (1973) 289–388.
K. Weihrauch, T. Deil, Berechenbarkeit auf cpo-s, Informatik Berichte, RWTH Aachen, 1980 (to appear).
O. Aberth, Computable Analysis, McGraw-Hill, New York, 1980.
K. Weihrauch, Rekursionstheorie und Komplexitätstheorie auf effektiven cpo-s, Informatik-Berichte Nr. 9, Fernuniversität Hagen, 1980.
A. Borodin, Complexity classes of recursive functions and the existence of complexity gaps, Conf. Rec. ACM Symp. on Theory of Computing (1969) 67–78.
E. Specker, Nicht konstruktiv beweisbare Sätze der Analysis, J. Symbolic Logic 14 (1949) 145–158.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihrauch, K. (1981). Recursion and complexity theory on CPO-S. In: Deussen, P. (eds) Theoretical Computer Science. Lecture Notes in Computer Science, vol 104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017311
Download citation
DOI: https://doi.org/10.1007/BFb0017311
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10576-3
Online ISBN: 978-3-540-38561-5
eBook Packages: Springer Book Archive