{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:37Z","timestamp":1761611257291},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-44679-6_65","type":"book-chapter","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T12:00:37Z","timestamp":1265716837000},"page":"586-595","source":"Crossref","is-referenced-by-count":12,"title":["Weakly Computable Real Numbers and Total Computable Real Functions"],"prefix":"10.1007","author":[{"given":"Robert","family":"Rettinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romain","family":"Gengler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Burchard","family":"Braunm\u00fchl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1006\/jcom.2000.0561","volume":"16","author":"K. Ambos-Spies","year":"2000","unstructured":"K. Ambos-Spies, K. Weihrauch and X. Zheng Weakly computable real numbers. J. of Complexity. 16 (2000), 676\u2013690.","journal-title":"J. of Complexity"},{"doi-asserted-by":"crossref","unstructured":"C. Calude, P. Hertling, B. Khoussainov, and Y. Wang Recursive enumerable reals and Chaintin\u2019s O-number, in STACS\u201998, pp596\u2013606.","key":"65_CR2","DOI":"10.1007\/BFb0028594"},{"key":"65_CR3","first-page":"263","volume":"20","author":"G.S. Ce?itin","year":"1971","unstructured":"G.S. Ce?itin A pesudofundamental sequence that is not equivalent to a monotone one (Russian), Zap. Nau\u010dn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI), 20(1971), 263\u2013271.","journal-title":"Zap. Nau\u010dn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI)"},{"key":"65_CR4","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 On the definitions of recursive real continuous functions, Fund. Math. 44(1957), 61\u201371.","journal-title":"Fund. Math"},{"key":"65_CR5","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":"Ker-I Ko Complexity Theory of Real Functions, Birkh\u00e4user, Berlin, 1991."},{"key":"65_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics","author":"M. Pour-El","year":"1989","unstructured":"M. Pour-El & J. Richards Computability in Analysis and Physics. Springer-Verlag, Berlin, Heidelberg, 1989."},{"key":"65_CR7","doi-asserted-by":"publisher","first-page":"280","DOI":"10.2307\/2267933","volume":"16","author":"R.M. Robinson","year":"1951","unstructured":"R.M. Robinson Review of \u201cR. Peter: \u2018Rekursive Funktionen\u2019, Akad. Kiado. Budapest, 1951,\u201d J. of Symbolic Logic, 16 (1951), 280.","journal-title":"J. of Symbolic Logic"},{"key":"65_CR8","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specker","year":"1949","unstructured":"E. Specker DeNicht konstruktiv beweisbare S\u00e4tze der Analysis, J. Symbolic Logic 14 (1949), 145\u2013158","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"65_CR9","first-page":"230","volume":"43","author":"A.M. Turing","year":"1936","unstructured":"A.M. Turing On computable number, with an application to the \u201cEntscheidungsproblem\u201d. Proceeding of the London Mathematical Society, 43 (1936), no.2, 230\u2013265.","journal-title":"Proceeding of the London Mathematical Society"},{"key":"65_CR10","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch An Introduction to Computability. EATCS Monographs on Theoretical Computer Science Vol. 9, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"65_CR11","volume-title":"Texts in Theoretical Computer Science","author":"K. Weihrauch","year":"2000","unstructured":"K. Weihrauch Computable Analysis. Texts in Theoretical Computer Science, Springer-Verlag, Heidelberg 2000."},{"doi-asserted-by":"crossref","unstructured":"K. Weihrauch & X. Zheng A finite hierarchy of the recursively enumerable real numbers, MFCS\u201998 Brno, Czech Republic, August 1998, pp798\u2013806.","key":"65_CR12","DOI":"10.1007\/BFb0055831"},{"doi-asserted-by":"crossref","unstructured":"X. Zheng The closure properties on real numbers under limits and computable operations. COCOON\u20192000, Sydney, Australia, July 26-28, 2000. pp170\u2013179.","key":"65_CR13","DOI":"10.1007\/3-540-44968-X_17"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T17:33:07Z","timestamp":1558805587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44679-6_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540424949"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44679-6_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}