{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:17:28Z","timestamp":1725455848896},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010576X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0017311","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:22:34Z","timestamp":1132644154000},"page":"195-202","source":"Crossref","is-referenced-by-count":0,"title":["Recursion and complexity theory on CPO-S"],"prefix":"10.1007","author":[{"given":"Klaus","family":"Weihrauch","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"D. Scott, Outline of a mathematical theory of computation, Technical Monograph PRG-2, Nov. 1970, Oxford University Computing Laboratory."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(76)90029-3","volume":"2","author":"H. Egli","year":"1976","unstructured":"H. Egli, R.L. Constable, Computability concepts for programming language semantics, Theoretical Computer Science 2 (1976) 133\u2013145.","journal-title":"Theoretical Computer Science"},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0304-3975(77)90045-7","volume":"5","author":"M.B. Smyth","year":"1977","unstructured":"M.B. Smyth, Effectively given domains, Theoretical Computer Science 5 (1977) 257\u2013274.","journal-title":"Theoretical Computer Science"},{"key":"23_CR4","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-09118-1_19","volume-title":"Theoretical Computer Science 4th GI-Conference","author":"A. Kanda","year":"1979","unstructured":"A. Kanda, D. Park, When are two effectively given domains identical, in: K. Weihrauch (Hrsg.), Theoretical Computer Science 4th GI-Conference, S. 170\u2013181, Springer, Berlin 1979."},{"key":"23_CR5","series-title":"Lecture notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"E. Sciore","year":"1978","unstructured":"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."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM 14 (1967) 322\u2013336.","journal-title":"J. ACM"},{"key":"23_CR7","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","volume":"23","author":"H. Rogers","year":"1958","unstructured":"H. Rogers, G\u00f6del numberings of partial recursive functions, Journal of Symbolic Logic 23 (1958) 331\u2013341.","journal-title":"Journal of Symbolic Logic"},{"key":"23_CR8","unstructured":"U. Schreiber, K. Weihrauch, Embedding metric spaces into cpo-s, to appear in Theoretical Computer Science."},{"key":"23_CR9","volume-title":"Theory of recursive functions and effective computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers, Theory of recursive functions and effective computability, McGraw-Hill, New York 1967."},{"key":"23_CR10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19730191901","volume":"19","author":"J.L. Ersov","year":"1973","unstructured":"J.L. Ersov, Theorie der Numerierungen I, Zeitschr. f. math. Logik und Grundlagen d. Math. 19 (1973) 289\u2013388.","journal-title":"Zeitschr. f. math. Logik und Grundlagen d. Math."},{"key":"23_CR11","unstructured":"K. Weihrauch, T. Deil, Berechenbarkeit auf cpo-s, Informatik Berichte, RWTH Aachen, 1980 (to appear)."},{"key":"23_CR12","volume-title":"Computable Analysis","author":"O. Aberth","year":"1980","unstructured":"O. Aberth, Computable Analysis, McGraw-Hill, New York, 1980."},{"key":"23_CR13","unstructured":"K. Weihrauch, Rekursionstheorie und Komplexit\u00e4tstheorie auf effektiven cpo-s, Informatik-Berichte Nr. 9, Fernuniversit\u00e4t Hagen, 1980."},{"key":"23_CR14","unstructured":"A. Borodin, Complexity classes of recursive functions and the existence of complexity gaps, Conf. Rec. ACM Symp. on Theory of Computing (1969) 67\u201378."},{"key":"23_CR15","doi-asserted-by":"crossref","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"E. Specker, Nicht konstruktiv beweisbare S\u00e4tze der Analysis, J. Symbolic Logic 14 (1949) 145\u2013158.","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0017311.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:38:12Z","timestamp":1607549892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0017311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010576X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0017311","relation":{},"subject":[]}}