{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:38:26Z","timestamp":1725496706798},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_17","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"170-179","source":"Crossref","is-referenced-by-count":2,"title":["Closure Properties of Real Number Classes under Limits and Computable Operators"],"prefix":"10.1007","author":[{"given":"Xizhong","family":"Zheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"17_CR1","unstructured":"K. Ambos-Spies A note on recursively approximable real numbers, Research Report on Mathematical Logic, University of Heidelberg, No. 38, September 1998."},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"C. Calude, P. Hertling, B. Khoussainov, and Y. Wang, Recursive enumerable reals and Chaintin\u2019s-number, in STACS\u201998, pp596\u2013606.","DOI":"10.1007\/BFb0028594"},{"key":"17_CR3","unstructured":"C. Calude. A characterization of c.e. random reals. CDMTCS Research Report Series 095, March 1999."},{"key":"17_CR4","first-page":"263","volume":"20","author":"G. S. Ceitin","year":"1971","unstructured":"G. S. Ceitin A pseudofundamental sequence that is not equivalent to a monotone one. (Russian) Zap. Nau\u010dn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI) 20 1971 263\u2013271, 290.","journal-title":"Zap. Nau\u010dn. Sem. Leningrad. Otdel. Mat. Inst. Steklov. (LOMI)"},{"key":"17_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":"17_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. On the definitions of recursive real continuous functions, Fund. Math. 44(1957), 61\u201371.","journal-title":"Fund. Math."},{"key":"17_CR7","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 of real numbers, Theoret. Comp. Sci. 31(1984) 101\u2013123.","journal-title":"Theoret. Comp. Sci."},{"key":"17_CR8","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":"17_CR9","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":"17_CR10","unstructured":"T. A. Slaman. Randomness and recursive enumerability, preprint, 1999."},{"key":"17_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":"17_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":"17_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":"17_CR14","volume-title":"Draft of a paper (or series of papers) on Chaitin\u2019s work... done for the most part during the period of Sept.-Dec. 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.-Dec. 1975, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktoen Heights, New York, May 1975."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.2307\/2267043","volume":"14","author":"E. Specter","year":"1949","unstructured":"E. Specter Nicht konstruktive beweisbare S\u00e4tze der Analysis, J. Symbolic Logic 14(1949), 145\u2013158","journal-title":"J. Symbolic Logic"},{"key":"17_CR16","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch Computability. EATCS Monographs on Theoretical Computer Science Vol. 9, Springer-Verlag, Berlin, Heidelberg, 1987."},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"K. Weihrauch. An Introduction to Computable Analysis. Springer-Verlag, 2000. (to appear).","DOI":"10.1007\/978-3-642-56999-9_1"},{"key":"17_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"},{"key":"17_CR19","doi-asserted-by":"crossref","unstructured":"K. Weihrauch & X. Zheng Arithmetical hierarchy of ral numbers. in MFCS\u201999, Szklarska Poreba, Poland, September 1999, pp 23\u201333.","DOI":"10.1007\/3-540-48340-3_3"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"X. Zheng. Binary enumerability of real numbers. in Computing and Combinatorics, Proc. of COCOON\u201999, Tokyo, Japan. July 26\u201328, 1999, pp300\u2013309.","DOI":"10.1007\/3-540-48686-0_30"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T04:17:13Z","timestamp":1557029833000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}