{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:51:21Z","timestamp":1725612681119},"publisher-location":"London","reference-count":14,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781852335267"},{"type":"electronic","value":"9781447107170"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/978-1-4471-0717-0_16","type":"book-chapter","created":{"date-parts":[[2011,9,21]],"date-time":"2011-09-21T02:07:54Z","timestamp":1316570874000},"page":"187-201","source":"Crossref","is-referenced-by-count":2,"title":["Monotonically Computable Real Numbers"],"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":"von Braunm\u00fchl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_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."},{"key":"16_CR2","unstructured":"C. Calude. A characterization of c.e. random reals. CDMTCS Research Report Series 095, March 1999."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"C. Calude, P. Hertling, B. Khoussainov, and Y. Wang. Recursive enumerable reals and Chaintin\u2019s 12-number, in STACS\u201998,pp596\u2013606.","DOI":"10.1007\/BFb0028594"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"105","DOI":"10.3233\/FI-1998-33201","volume":"33","author":"C Calude","year":"1998","unstructured":"C. Calude and P. Hertling. Computable approximations of reals: An information-theoretic analysis. Fundamenta Informaticae 33 (1998), 105\u2013120.","journal-title":"Fundamenta Informaticae"},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(84)90129-4","volume":"31","author":"Ker-I Ko","year":"1984","unstructured":"Ker-I Ko. Reducibilities of real numbers, Theoret. Comp. Sci. 31 (1984) 101\u2013123.","journal-title":"Theoret. Comp. Sci."},{"key":"16_CR6","volume-title":"Complexity Theory of Real Functions","author":"K Ker-I","year":"1991","unstructured":"Ker-I Ko. Complexity Theory of Real Functions, Birkh\u00e4user, Berlin, 1991."},{"key":"16_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21717-7","volume-title":"Computability in Analysis and Physics. Springer-Verlag","author":"M Pour-El","year":"1989","unstructured":"M. Pour-El & J. Richards. Computability in Analysis and Physics. Springer-Verlag, Berlin, Heidelberg, 1989."},{"key":"16_CR8","first-page":"784","volume":"5","author":"HG Rice","year":"1954","unstructured":"H. G. Rice. Recursive real numbers, Proc. Amer. Math. Soc. 5 (1954), 784\u2013791.","journal-title":"Math. Soc"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"280","DOI":"10.2307\/2267933","volume":"16","author":"RM Robinson","year":"1951","unstructured":"R. M. Robinson. Review of \u201cR. Peter: `Rekursive Funktionen\u2019, Akad. Kiado. Budapest, 1951\u201d, J. Symb. Logic 16 (1951), 280.","journal-title":"J. Symb. Logic"},{"key":"16_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees, Springer-Verlag","author":"R Soare","year":"1987","unstructured":"R. Soare. Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E Specker","year":"1949","unstructured":"E. Specker. Nicht konstruktive beweisbare S\u00e4tze der Analysis, J. Symbolic Logic 14 (1949), 145\u2013158.","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"16_CR12","first-page":"230","volume":"43","author":"AM Turing","year":"1936","unstructured":"A. M. Turing. On computable numbers, 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":"16_CR13","volume-title":"Computable Analysis. Texts in Theoretical Computer Science","author":"K Weihrauch","year":"2000","unstructured":"K. Weihrauch. Computable Analysis. Texts in Theoretical Computer Science, Springer-Verlage, Heidelberg 2000."},{"key":"16_CR14","first-page":"798","volume-title":"A finite hierarchy of the recursively enumerable real numbers","author":"K Weihrauch","year":"1998","unstructured":"K. Weihrauch & X. Zheng. A finite hierarchy of the recursively enumerable real numbers, MFCS\u201998 Brno, Czech Republic, August 1998, pp 798\u2013806."}],"container-title":["Combinatorics, Computability and Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-0717-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T11:24:54Z","timestamp":1592997894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-0717-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9781852335267","9781447107170"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-0717-0_16","relation":{},"subject":[],"published":{"date-parts":[[2001]]}}}