{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:14:25Z","timestamp":1725495265050},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540421979"},{"type":"electronic","value":"9783540453352"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45335-0_12","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T12:49:27Z","timestamp":1195044567000},"page":"187-199","source":"Crossref","is-referenced-by-count":0,"title":["\u03b4-Approximable Functions"],"prefix":"10.1007","author":[{"given":"Charles","family":"Meyssonnier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Boldi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastiano","family":"Vigna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,5,22]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"Lenore Blum, Mike Shub, and Steve Smale. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines. Bull. Amer. Math. Soc. (N.S.), 21:1\u201346, 1989.","journal-title":"Bull. Amer. Math. Soc. (N.S.)"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/jcom.1998.0475","volume":"14","author":"P. Boldi","year":"1998","unstructured":"Paolo Boldi and Sebastiano Vigna. \u03b4-uniform BSS machines. J. Complexity, 14(2):234\u2013256, 1998.","journal-title":"J. Complexity"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0304-3975(99)00096-1","volume":"231","author":"P. Boldi","year":"2000","unstructured":"Paolo Boldi and Sebastiano Vigna. The Turing closure of an Archimedean field. Theoret. Comput. Sci., 231:143\u2013156, 2000.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR4","unstructured":"Vasco Brattka. Personal electronic communication, 2001."},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1006\/jcom.1998.0488","volume":"14","author":"V. Brattka","year":"1998","unstructured":"Vasco Brattka and Peter Hertling. Feasible real random access machines. J. Complexity, 14(4):490\u2013526, 1998.","journal-title":"J. Complexity"},{"issue":"1-2","key":"12_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0304-3975(98)00287-4","volume":"219","author":"T. Chadzelek","year":"1999","unstructured":"Thomas Chadzelek and G\u00fcnter Hotz. Analytic machines. Theoret. Comput. Sci., 219(1-2):151\u2013167, 1999.","journal-title":"Analytic machines. Theoret. Comput. Sci."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/S0304-3975(98)00097-8","volume":"210","author":"A. Edalat","year":"1999","unstructured":"Abbas Edalat and Philipp S\u00fcnderhauf. A domain-theoretic approach to computability on the real line. Theoret. Comput. Sci., 210(1):73\u201398, 1999.","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"12_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3975(83)90035-X","volume":"23","author":"R. Freund","year":"1983","unstructured":"Rudolf Freund. Real functions and numbers defined by Turing machines. Theoret. Comput. Sci., 23(3):287\u2013304, May 1983.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(98)00289-8","volume":"219","author":"A. Hemmerling","year":"1999","unstructured":"Armin Hemmerling. On approximate and algebraic computability over the real numbers. Theoret. Comput. Sci., 219:185\u2013223, 1999.","journal-title":"Theoret. Comput. Sci."},{"issue":"1_2","key":"12_CR10","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(84)90129-4","volume":"31","author":"K.-I. Ko","year":"1984","unstructured":"Ker-I Ko. Reducibilities on real numbers. Theoret. Comput. Sci., 31(1_2):101\u2013123, May 1984.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-0208(08)72506-4","volume-title":"Degrees of Unsolvability","author":"J. R. Shoenfield","year":"1971","unstructured":"Joseph R. Shoenfield. Degrees of Unsolvability. North-Holland, Amsterdam, 1971."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1995137","volume":"140","author":"R. I. Soare","year":"1969","unstructured":"Robert I. Soare. Recursion theory and Dedekind cuts. Trans. Amer. Math. Soc., 140:271\u2013294, 1969.","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1-2","key":"12_CR13","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(98)00297-7","volume":"219","author":"J. V. Tucker","year":"1999","unstructured":"John V. Tucker and Jeffery I. Zucker. Computation by \u2018While\u2019 programs on topological partial algebras. Theoret. Comput. Sci., 219(1-2):379\u2013420, 1999.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(95)00247-2","volume":"162","author":"S. Vigna","year":"1996","unstructured":"Sebastiano Vigna. On the relations between distributive computability and the BSS model. Theoret. Comput. Sci., 162:5\u201321, 1996.","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1017\/S0960129500001468","volume":"2","author":"R. F.C. Walters","year":"1992","unstructured":"Robert F.C. Walters. An imperative language based on distributive categories. Math. Struct. Comp. Sci., 2:249\u2013256, 1992.","journal-title":"Math. Struct. Comp. Sci."},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Klaus Weihrauch. Introduction to Computable Analysis. Texts in Theoretical Computer Science. Springer-Verlag, 2000.","DOI":"10.1007\/978-3-642-56999-9"}],"container-title":["Lecture Notes in Computer Science","Computability and Complexity in Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45335-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T08:12:36Z","timestamp":1556957556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45335-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540421979","9783540453352"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45335-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}