{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:28Z","timestamp":1725514408427},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72504-6_9","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T11:36:39Z","timestamp":1185104199000},"page":"100-114","source":"Crossref","is-referenced-by-count":0,"title":["Computability on Subsets of Locally Compact Spaces"],"prefix":"10.1007","author":[{"given":"Yatao","family":"Xu","sequence":"first","affiliation":[]},{"given":"Tanja","family":"Grubba","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(02)00692-8","volume":"305","author":"V. Brattka","year":"2003","unstructured":"Brattka, V.: Recursive quasi-metric spaces. Theoret. Comput. Sci.\u00a0305, 17\u201342 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR2","unstructured":"Brattka, V., Hertling, P.: Continuity and computability of relations. Informatik Berichte 164, Fern University in Hagen, Hagen (1994)"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(02)00693-X","volume":"305","author":"V. Brattka","year":"2003","unstructured":"Brattka, V., Presser, G.: Computability on subsets of metric spaces. Theoret. Comput. Sci.\u00a0305, 43\u201376 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"Brattka, V., Weihrauch, K.: Computability on subsets of Euclidean space I: Closed and compact subsets. Theoret. Comput. Sci.\u00a0219, 65\u201393 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2005.05.001","volume":"341","author":"P. Collins","year":"2005","unstructured":"Collins, P.: Continuity and computability on reachable sets. Theoret. Comput. Sci.\u00a0341, 162\u2013195 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR6","volume-title":"General Topology","author":"R. Engelking","year":"1989","unstructured":"Engelking, R.: General Topology. Heldermann, Berlin (1989)"},{"key":"9_CR7","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A. Grzegorczyk","year":"1955","unstructured":"Grzegorczyk, A.: Computable functions. Fund. Math.\u00a042, 168\u2013202 (1955)","journal-title":"Fund. Math."},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1007\/11569596_94","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"T. Grubba","year":"2005","unstructured":"Grubba, T., Weihrauch, K.: A computable version of Dini\u2019s theorem for topological spaces. In: Yolum, p., et al. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 927\u2013936. Springer, Heidelberg (2005)"},{"key":"9_CR9","unstructured":"Grubba, T., Weihrauch, K.: On computable metrization. CCA 2006, Third International Conference on Computability and Complexity in Analysis. In: Cenzer, D., et al. (eds.) Informatik Berichte 333, pp. 176\u2013191. Fern University in Hagen, Hagen (2006)"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/malq.19730190804","volume":"19","author":"J. Hauck","year":"1973","unstructured":"Hauck, J.: Berechenbare reelle Funktionen. Z. math. Logik Grundlagen Math.\u00a019, 121\u2013140 (1973)","journal-title":"Z. math. Logik Grundlagen Math."},{"key":"9_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6802-1","volume-title":"Complexity Theory of Real Functions","author":"K.I. Ko","year":"1991","unstructured":"Ko, K.I.: Complexity Theory of Real Functions. Birkhaeuser, Boston (1991)"},{"key":"9_CR12","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0099489","volume-title":"Computation and Proof Theory","author":"C. Kreitz","year":"1984","unstructured":"Kreitz, C., Weihrauch, K.: A unified approach to constructive and recursive analysis. In: Richter, M., et al. (eds.) Computation and Proof Theory. Lecture Notes in Mathematics, vol.\u00a01104, pp. 259\u2013278. Springer, Berlin (1984)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Kusner, B.A.: Lectures on Constructive Mathematical Analysis vol. 60. AMS, Providence (1984)","DOI":"10.1090\/mmono\/060"},{"key":"9_CR14","first-page":"2478","volume":"240","author":"D. Lacombe","year":"1955","unstructured":"Lacombe, D.: Extension de la notion de fonction recursive aux fonctions d\u2019une ou plusieurs variables reelles I. Comptes Rendus Academie des Sciences Paris\u00a0240, 2478\u20132480 (1955)","journal-title":"Comptes Rendus Academie des Sciences Paris"},{"key":"9_CR15","unstructured":"Mazur, S.: Computable Analysis vol. 33. Razprawy Matematyczne, Warsaw (1963)"},{"key":"9_CR16","series-title":"Perspectives in Mathematical Logic","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M.B. Pour-El","year":"1989","unstructured":"Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin (1989)"},{"key":"9_CR17","unstructured":"Schr\u00f6der, M.: Effective metrization of regular spaces. In: Ko, K.I., et al. (eds.) Computability and Complexity in Analysis. Informatik Berichte, vol.\u00a0235, pp. 63\u201380. Fern University in Hagen, Hagen (1998)"},{"key":"9_CR18","unstructured":"Scott, D.: Outline of a mathematical theory of computation. Tech. Mono. PRG-2. Oxford University, Oxford (1970)"},{"key":"9_CR19","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/S0304-3975(98)00296-5","volume":"219","author":"V. Stoltenberg-Hansen","year":"1999","unstructured":"Stoltenberg-Hansen, V., Tucker, J.V.: Concrete models of computation for topological algebras. Theoret. Comput. Sci.\u00a0219, 347\u2013378 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc.\u00a042, 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(93)90001-A","volume":"113","author":"K. Weihrauch","year":"1993","unstructured":"Weihrauch, K.: Computability on computable metric spaces. Theoret. Comput. Sci.\u00a0113, 191\u2013210 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)"},{"key":"9_CR23","unstructured":"Weihrauch, K.: Multi-functions on multi-represented sets are closed under flowchart programming. CCA 2005, Second International Conference on Computability and Complexity in Analysis. In: Grubba, T., et al. (eds.) Informatik Berichte 326, pp. 267\u2013300. Fern University in Hagen, Hagen (2005)"},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/S0304-3975(98)00301-6","volume":"219","author":"M. Yasugi","year":"1999","unstructured":"Yasugi, M., Mori, T., Tsujii, Y.: Effective properties of sets and functions in metric spaces with computability structure. Theoret. Comput. Sci.\u00a0219, 467\u2013486 (1999)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"9_CR25","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/792538.792542","volume":"50","author":"N. Zhong","year":"2003","unstructured":"Zhong, N., Weihrauch, K.: Computability theory of generalized functions. J. Asso. for Comp. Mach.\u00a050(4), 469\u2013505 (2003)","journal-title":"J. Asso. for Comp. Mach."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/malq.19960420132","volume":"42","author":"Q. Zhou","year":"1996","unstructured":"Zhou, Q.: Computable real-valued functions on recursive open and closed subsets of Euclidean space. Math. Logic Q.\u00a042, 379\u2013409 (1996)","journal-title":"Math. Logic Q."},{"issue":"Suppl. 1","key":"9_CR27","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/1521-3870(200210)48:1+<157::AID-MALQ157>3.0.CO;2-4","volume":"48","author":"M. Ziegler","year":"2002","unstructured":"Ziegler, M.: Computability on regular subsets of Euclidean space. Math. Logic Q.\u00a048(Suppl. 1), 157\u2013181 (2002)","journal-title":"Math. Logic Q."},{"issue":"4-5","key":"9_CR28","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1002\/malq.200310107","volume":"50","author":"M. Ziegler","year":"2004","unstructured":"Ziegler, M.: Computable operators on regular sets. Math. Logic Q.\u00a050(4-5), 392\u2013404 (2004)","journal-title":"Math. Logic Q."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:38:32Z","timestamp":1619516312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540725039","9783540725046"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_9","relation":{},"subject":[]}}