{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:47:39Z","timestamp":1725486459890},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540413486"},{"type":"electronic","value":"9783540444114"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44411-4_34","type":"book-chapter","created":{"date-parts":[[2007,6,18]],"date-time":"2007-06-18T22:52:31Z","timestamp":1182207151000},"page":"450-458","source":"Crossref","is-referenced-by-count":4,"title":["Computing the Dimension of Linear Subspaces"],"prefix":"10.1007","author":[{"given":"Martin","family":"Ziegler","sequence":"first","affiliation":[]},{"given":"Vasco","family":"Brattka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,1,22]]},"reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Errett Bishop and Douglas S. Bridges. Constructive Analysis, Springer, Berlin, 1985. 451","DOI":"10.1007\/978-3-642-61667-9"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0304-3975(98)00284-9","volume":"219","author":"V. Brattka","year":"1999","unstructured":"Vasco Brattka and Klaus Weihrauch. Computability on subsets of Euclidean space I: Closed and compact subsets. Theoretical Computer Science, 219:65\u201393, 1999. 451, 452, 455, 456, 457","journal-title":"Theoretical Computer Science"},{"key":"34_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-58140-5_12","volume-title":"Logical Foundations of Computer Science","author":"X. Ge","year":"1994","unstructured":"Xiaolin Ge and Anil Nerode. On extreme points of convex compact Turing located sets. InAnil Nerode and Yu. V. Matiyasevich, editors, Logical Foundations of Computer Science, vol. 813 of LNCS, 114\u2013128, Berlin, 1994. Springer. 457"},{"key":"34_CR4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A. Grzegorczyk","year":"1957","unstructured":"Andrzej Grzegorczyk. On the definitions of computable real continuous functions. Fundamenta Mathematicae, 44:61\u201371, 1957. 450","journal-title":"Fundamenta Mathematicae"},{"key":"34_CR5","unstructured":"Ker-I Ko. Complexity Theory of Real Functions. Progress in Theoretical Computer Science. Birkh\u00e4user, Boston, 1991. 450"},{"key":"34_CR6","first-page":"28","volume":"246","author":"D. Lacombe","year":"1958","unstructured":"Daniel Lacombe. Les ensembles r\u00e9cursivement ouverts ou ferm\u00e9s, et leurs applications \u00e0 l\u2019Analyse r\u00e9cursive. Comp. Rend. Acad. des Sci. Paris, 246:28\u201331, 1958. 450","journal-title":"Comp. Rend. Acad. des Sci. Paris"},{"key":"34_CR7","unstructured":"Andr\u00e8 Lieutier. Toward a data type for solid modeling based on domain theory. In K.-I Ko, A. Nerode, M. B. Pour-El, K. Weihrauch, and J. Wiedermann, eds, Computability and Complexity in Analysis, vol. 235 of Informatik Berichte, pages 51\u201360. FernUniversit\u00e4t Hagen, August 1998. 451, 457"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Marian B. Pour-El and J. Ian Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989. 450","DOI":"10.1007\/978-3-662-21717-7"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Alan M. Turing. On computable numbers, with an application to the \u201cEntschei-dungsproblem\u201d. Proceedings of the London Mathematical Society, 42(2):230\u2013265, 1936. 450","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Klaus Weihrauch. Computable Analysis. Springer, Berlin, 2000. 450, 451, 452, 453, 456","DOI":"10.1007\/978-3-642-56999-9"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0304-3975(97)00008-X","volume":"197","author":"N. Zhong","year":"1998","unstructured":"Ning Zhong. Recursively enumerable subsets of Rq in two computing models: Blum-Shub-Smale machine and Turing machine. Theoretical Computer Science, 197:79\u201394, 1998. 457","journal-title":"Theoretical Computer Science"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/malq.19960420132","volume":"42","author":"Q. Zhou","year":"1996","unstructured":"Qing Zhou. Computable real-valued functions on recursive open and closed subsets of Euclidean space. Mathematical Logic Quarterly, 42:379\u2013409, 1996. 457","journal-title":"Mathematical Logic Quarterly"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2000: Theory and Practice of Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44411-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T04:22:50Z","timestamp":1556511770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44411-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540413486","9783540444114"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-44411-4_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}