{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:10Z","timestamp":1725663850614},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571827"},{"type":"electronic","value":"9783540479277"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57182-5_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:10:27Z","timestamp":1330258227000},"page":"413-422","source":"Crossref","is-referenced-by-count":2,"title":["Real number computability and domain theory"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Gianantonio","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"33_CR1","first-page":"189","volume":"27","author":"L. E. J. J. Brouwer","year":"1924","unstructured":"L.E.J. Brouwer, \u201cBeweis, dass jede volle Funktion gleichm\u00e4ssig stetig ist\u201d Proc. Amsterdam 27 (1924) 189\u2013194.","journal-title":"Proc. Amsterdam"},{"key":"33_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68952-9","volume-title":"Foundation of Constructive Mathematics","author":"M. J. Beeson","year":"1985","unstructured":"M.J. Beeson, \u201cFoundation of Constructive Mathematics\u201d Spriger-Verlag, Berlin, 1985."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"H.-J. Boehm, R. Cartwright, M. Riggle, and M.J. O'Donell, \u201cExact Real Arithmetic: A Case Study in Higher Order Programming.\u201d 1986 ACM Symposium on Lisp and Functional Programming.","DOI":"10.1145\/319838.319860"},{"key":"33_CR4","unstructured":"H.-J. Boehm, R. Cartwright, \u201cExact Real Arithmetic: Formulating Real Numbers as Functions\u201d in \u201cResearch Topics in Functional Programming\u201d David Turner editor, Addison-Wesley, 1990, pp. 43\u201364"},{"key":"33_CR5","volume-title":"Constructive Analysis","author":"D. Bridges","year":"1985","unstructured":"D. Bridges and E. Bishop, \u201cConstructive Analysis\u201d. Springer-Verlag, Berlin, 1985."},{"key":"33_CR6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.4064\/fm-44-1-61-71","volume":"44","author":"A. Grzegorczyk","year":"1957","unstructured":"A. Grzegorczyk, \u201cOn the Definition of Computable Real Continuous Functions\u201d. Fund. Math. 44 (1957) 61\u201377.","journal-title":"Fund. Math."},{"key":"33_CR7","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0304-3975(82)80003-0","volume":"20","author":"K. Ko","year":"1982","unstructured":"K. Ko and Friedmann, \u201cComputational Complexity of Real Functions\u201d. Theoret. Comput. Sci. 20 (1982) 323\u2013352.","journal-title":"Theoret. Comput. Sci."},{"key":"33_CR8","unstructured":"D. Lacombe, \u201cQuelques proc\u00e9d\u00e9s de d\u00e9finitions en topologie recursif.\u201d in: Constructivity in Mathematics, North-Holland (1959) 129\u2013158."},{"key":"33_CR9","volume-title":"Note on Constructive Mathematics","author":"P. Martin-L\u00f6f","year":"1970","unstructured":"P. Martin-L\u00f6f, \u201cNote on Constructive Mathematics\u201d. Almqvist and Wiksell, Stockholm (1970)."},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"J. Myhill, \u201cWhat is a Real Number?\u201d America Mathematical Monthly (1979) 748\u2013754.","DOI":"10.1080\/00029890.1972.11993116"},{"key":"33_CR11","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","volume":"5","author":"H. G. Rice","year":"1954","unstructured":"H.G. Rice, \u201cRecursive Real Numbers\u201d. Proc. Amer. Math. Soc 5 (1954) 784\u2013791.","journal-title":"Proc. Amer. Math. Soc"},{"key":"33_CR12","unstructured":"D. Scott, \u201cOutline of the Mathematical Theory of Computation\u201d. Proc. 4th Princeton Conference on Information Science (1970)."},{"key":"33_CR13","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D. Scott","year":"1976","unstructured":"D. Scott, \u201cData Types as Lattices\u201d. SIAM J. Comput. 5 (1976) 522\u2013587.","journal-title":"SIAM J. Comput."},{"key":"33_CR14","volume-title":"Constructivism in Mathematics","author":"A. S. Troelstra","year":"1988","unstructured":"A.S. Troelstra and D. van Dalen, \u201cConstructivism in Mathematics\u201d. North-Holland, Amsterdam (1988)."},{"key":"33_CR15","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"42","author":"A. M. Turing","year":"1937","unstructured":"A.M. Turing, \u201cOn Computable Numbers, with an Application to the Entscheidungs Problem\u201d. Proc. London Math. Soc. 42 (1937) 230\u2013265.","journal-title":"Proc. London Math. Soc."},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"J. Vuillemin, \u201cExact Real Computer Arithmetic with Continued Fraction\u201d. Proc. A.C.M. conference on Lisp and functional Programming (1988) 14\u201327.","DOI":"10.1145\/62678.62681"},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0304-3975(81)90027-X","volume":"16","author":"K. Weihrauch","year":"1981","unstructured":"K. Weihrauch, U. Schreiber, \u201cEmbeding Metric Spaces into cpo's\u201d Theoret. Comp. Sci. 16 (1981) 5\u201334.","journal-title":"Theoret. Comp. Sci."},{"key":"33_CR18","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0168-0072(87)90065-0","volume":"35","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch and C. Kreitz, \u201cRepresentation of the Real Numbers and of the Open Subsets of the Set of Real Numbers\u201d. Annals of Pure and Applied Logic 35 (1987) 247\u2013260.","journal-title":"Annals of Pure and Applied Logic"},{"key":"33_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch, \u201cComputability\u201d. Springer-Verlag, Berlin, 1987."},{"key":"33_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(80)90011-0","volume":"10","author":"E. Wiedmer","year":"1980","unstructured":"E. Wiedmer, \u201cComputing with Infinite Objects\u201d. Theoret. Comp. Sci. 10 (1980) 133\u2013155.","journal-title":"Theoret. Comp. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1993"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57182-5_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:39Z","timestamp":1605647319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57182-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571827","9783540479277"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-57182-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}