{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T05:25:39Z","timestamp":1772861139529,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7351,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1016\/0304-3975(93)90001-a","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"191-210","source":"Crossref","is-referenced-by-count":86,"title":["Computability on computable metric spaces"],"prefix":"10.1016","volume":"113","author":[{"given":"Klaus","family":"Weihrauch","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90001-A_BIB1","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(82)91250-5","article-title":"Processes and the denotational semantic of concurrency","volume":"54","author":"de Bakker","year":"1982","journal-title":"Inform. and Control"},{"key":"10.1016\/0304-3975(93)90001-A_BIB2","series-title":"Constructive Analysis","author":"Bishop","year":"1985"},{"key":"10.1016\/0304-3975(93)90001-A_BIB3","first-page":"49","article-title":"Algorithmic operators in constructive complete separable metric spaces (in Russian)","volume":"128","author":"Ceitin","year":"1959","journal-title":"Dokl. Akad. Nauk"},{"key":"10.1016\/0304-3975(93)90001-A_BIB4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","article-title":"Computational complexity of real functions","volume":"20","author":"Ko","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90001-A_BIB5","series-title":"Dissertation, Informatik-Berichte Nr. 50","article-title":"Theorie der Darstellungen und ihre Anwendung in der konstruktiven Analysis","author":"Kreitz","year":"1984"},{"key":"10.1016\/0304-3975(93)90001-A_BIB6","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0099489","article-title":"A unified approach to constructive and recursive analysis","author":"Kreitz","year":"1984"},{"key":"10.1016\/0304-3975(93)90001-A_BIB7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0304-3975(85)90208-7","article-title":"Theory of representations","volume":"38","author":"Kreitz","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90001-A_BIB8","series-title":"Informatik\u2013Berichted","first-page":"29","article-title":"Compactness in constructive analysis revisited","author":"Kreitz","year":"1984"},{"key":"10.1016\/0304-3975(93)90001-A_BIB9","series-title":"Topology","article-title":"Topology","author":"Kuratowski","year":"1966"},{"key":"10.1016\/0304-3975(93)90001-A_BIB10","series-title":"Lectures on Constructive Mathematical Analysis","author":"Kushner","year":"1985"},{"key":"10.1016\/0304-3975(93)90001-A_BIB11","article-title":"Quelques proc\u00e9d\u00e9s de definition en topologie recursive","author":"Lacombe","year":"1959"},{"key":"10.1016\/0304-3975(93)90001-A_BIB12","first-page":"215","article-title":"Recursive metric spaces","volume":"LV","author":"Moschavakis","year":"1976","journal-title":"Fund. Math."},{"key":"10.1016\/0304-3975(93)90001-A_BIB13","series-title":"Informatik-Berichte Nr. 59","article-title":"Computational complexity of real functions and real number","author":"M\u00fcller","year":"1986"},{"key":"10.1016\/0304-3975(93)90001-A_BIB14","first-page":"284","article-title":"Subpolynomial complexity classes of real functions and real numbers","volume":"226","author":"M\u00fcller","year":"1986"},{"key":"10.1016\/0304-3975(93)90001-A_BIB15","first-page":"435","article-title":"Uniform computational complexity of Taylor series","volume":"267","author":"M\u00fcller","year":"1987"},{"key":"10.1016\/0304-3975(93)90001-A_BIB16","series-title":"Informatik-Bericht 21","article-title":"Computability on metric spaces","author":"Weihrauch","year":"1981"},{"key":"10.1016\/0304-3975(93)90001-A_BIB17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0304-3975(85)90207-5","article-title":"Type 2 recursion theory","volume":"38","author":"Weihrauch","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90001-A_BIB18","series-title":"Computability","author":"Weihrauch","year":"1987"},{"key":"10.1016\/0304-3975(93)90001-A_BIB19","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-51498-8_47","article-title":"Constructivity, computability, and computational complexity in analysis","author":"Weihrauch","year":"1989"},{"key":"10.1016\/0304-3975(93)90001-A_BIB20","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0885-064X(91)90026-T","article-title":"On the complexity of online computations on real functions","volume":"7","author":"Weihrauch","year":"1991","journal-title":"J. Complexity"},{"key":"10.1016\/0304-3975(93)90001-A_BIB21","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0168-0072(87)90065-0","article-title":"Representations of the real numbers and of the open subsets of the set of real numbers","volume":"35","author":"Weihrauch","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(93)90001-A_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90168-2","article-title":"Type 2 computational complexity of functions on Cantor's space","volume":"82","author":"Weihrauch","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90001-A_BIB23","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(81)90027-X","article-title":"Embedding metric spaces into cpo's","volume":"16","author":"Weihrauch","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390001A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759390001A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:58:09Z","timestamp":1555077489000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759390001A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["030439759390001A"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90001-a","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}