{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:31Z","timestamp":1725490231398},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424963"},{"type":"electronic","value":"9783540446835"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_55","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T01:32:38Z","timestamp":1188351158000},"page":"633-644","source":"Crossref","is-referenced-by-count":5,"title":["Hierarchy of Monotonically Computable Real Numbers"],"prefix":"10.1007","author":[{"given":"Robert","family":"Rettinger","sequence":"first","affiliation":[]},{"given":"Xizhong","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"55_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":"55_CR2","unstructured":"C. Calude. A characterization of c.e. random reals. CDMTCS Research Report Series 095, March 1999."},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"C. Calude, P. Hertling, B. Khoussainov, and Y. Wang, Recursive enumerable reals and Chaitin\u2019s \u03a9-number, in STACS\u201998, pp596\u2013606.","DOI":"10.1007\/BFb0028594"},{"key":"55_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":"55_CR5","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. J. Chaitin","year":"1975","unstructured":"G. J. Chaitin A theory of program size formally identical to information theory, J. of ACM., 22(1975), 329\u2013340.","journal-title":"J. of ACM"},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"P. Martin-L\u00f6f The definition of random sequences, Information and Control, 9(1966), 602\u2013619.","journal-title":"Information and Control"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"R. Rettinger, X. Zheng, R. Gengler and B. von Braunm\u00fchl Monotonically computable real numbers. DMTCS\u201901, July 2\u20136, 2001, Constan\u00e7ta, Romania.","DOI":"10.1007\/978-1-4471-0717-0_16"},{"key":"55_CR8","doi-asserted-by":"publisher","first-page":"784","DOI":"10.2307\/2031867","volume":"5","author":"H. G. Rice","year":"1954","unstructured":"H. G. Rice Recursive real numbers, Proc. Amer. Math. Soc. 5(1954), 784\u2013791.","journal-title":"Proc. Amer. Math. Soc."},{"key":"55_CR9","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. Symb. Logic 16(1951), 280.","journal-title":"J. Symb. Logic"},{"key":"55_CR10","unstructured":"T. A. Slaman Randomness and recursive enumerability, preprint, 1999."},{"key":"55_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"R. Soare","year":"1987","unstructured":"R. Soare Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"55_CR12","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1995137","volume":"140","author":"R. Soare","year":"1969","unstructured":"R. Soare Recursion theory and Dedekind cuts, Trans, Amer. Math. Soc. 140(1969), 271\u2013294.","journal-title":"Trans, Amer. Math. Soc."},{"issue":"1","key":"55_CR13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","volume":"31","author":"R. Soare","year":"1969","unstructured":"R. Soare Cohesive sets and recursively enumerable Dedekind cuts, Pacific J. of Math. 31(1969), no. 1, 215\u2013231.","journal-title":"Pacific J. of Math."},{"key":"55_CR14","first-page":"215","volume-title":"Draft of a paper (or series of papers) on Chaitin\u2019s work... done for the most part during the period of Sept.\u2013Dec. 1975","author":"R. Solovay","year":"1975","unstructured":"R. Solovay. Draft of a paper (or series of papers) on Chaitin\u2019s work... done for the most part during the period of Sept.\u2013Dec. 1975, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktoen Heights, New York, May 1975, 215pp."},{"key":"55_CR15","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":"55_CR16","first-page":"230","volume":"43","author":"A. M. Turing","year":"1936","unstructured":"A. M. Turing. On computable number, with an application to the \u201cEntschei-dungsproblem\u201d. Proceeding of the London Mathematical Society, 43(1936), no. 2, 230\u2013265.","journal-title":"Proceeding of the London Mathematical Society"},{"key":"55_CR17","series-title":"Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56999-9","volume-title":"An Introduction to Computable Analysis","author":"K. Weihrauch","year":"2000","unstructured":"K. Weihrauch. An Introduction to Computable Analysis. Texts in Theoretical Computer Science, Springer-Verlag, Heidelberg 2000."},{"key":"55_CR18","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.","DOI":"10.1007\/BFb0055831"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T13:16:54Z","timestamp":1629638214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_55","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}