{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,22]],"date-time":"2024-03-22T16:16:31Z","timestamp":1711124191541},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4034,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0304-3975(01)00110-4","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T15:39:34Z","timestamp":1034177974000},"page":"539-555","source":"Crossref","is-referenced-by-count":11,"title":["Presentations of computably enumerable reals"],"prefix":"10.1016","volume":"284","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[]},{"given":"Geoffrey L.","family":"LaForte","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00110-4_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/S0002-9947-1984-0719661-8","article-title":"An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees","volume":"281","author":"Ambos-Spies","year":"1984","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB2","series-title":"Information Theory and Randomness, an Algorithmic Perspective","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB3","doi-asserted-by":"crossref","unstructured":"C. Calude, R. Coles, P. Hertling, B. Khoussainov, Degree-theoretic aspects of computably enumerable reals, in: Cooper, Truss (Eds.), Models and Computability, Cambridge University Press, Cambridge, 1999.","DOI":"10.1017\/CBO9780511565670.003"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB4","unstructured":"C. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin's \u03a9 number, STACS \u201998, Springer Lecture Notes in Computer Science, Vol. 1373, 1998, Springer, Berlin, pp. 596\u2013606."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB5","unstructured":"C. Calude, A. Nies, Chaitin's \u03a9 numbers and strong reducibilities, J. Universal Comput. Sci. 1997."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB6","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A theory of program size formally identical to information theory","volume":"22","author":"Chaitin","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB7","unstructured":"D. Hirschfeldt, R. Downey, G. Laforte, Randomness and Reducibility, in preparation."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB8","doi-asserted-by":"crossref","unstructured":"R. Downey, Computability, definability, and algebraic structures, Proc. 7th Asian Logic Conf., Taiwan, to appear.","DOI":"10.1142\/9789812705815_0004"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0168-0072(89)90051-1","article-title":"Classification of degree classes associated with r.e. subspaces","volume":"42","author":"Downey","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB10","doi-asserted-by":"crossref","unstructured":"Chun-Kuen Ho, Relatively recursive reals and real functions, Theoret. Comput. Sci. 219 (1999) 99\u2013120.","DOI":"10.1016\/S0304-3975(98)00098-X"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB11","doi-asserted-by":"crossref","unstructured":"Ker-I Ko, On the continued fraction representation of computable real numbers, Theoret. Comput. Sci. A 47 (1986) 299\u2013313.","DOI":"10.1016\/0304-3975(86)90154-4"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB12","unstructured":"Ker-I Ko, Complexity of Real Functions, Birkhauser, Berlin, 1991."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB13","doi-asserted-by":"crossref","unstructured":"Ker-I Ko, H. Friedman, On the computational complexity of real functions, Theoret. Comput. Sci. 20 (1982) 323\u2013352.","DOI":"10.1016\/S0304-3975(82)80003-0"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB14","unstructured":"Ming Li, P. Vitanyi, Kolmogorov Complexity and its Applications."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB15","doi-asserted-by":"crossref","first-page":"809","DOI":"10.2307\/2273100","article-title":"Recursively enumerable generic sets","volume":"47","author":"Maass","year":"1982","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB16","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","article-title":"The definition of random sequences","volume":"9","author":"Martin-L\u00f6f","year":"1966","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB17","doi-asserted-by":"crossref","unstructured":"M. Pour-El, From axiomatics to intrinsic characterization, some open problems in computable analysis, Theoret. Comput. Sci. 219 (1999) 319\u2013329.","DOI":"10.1016\/S0304-3975(99)00294-7"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB18","series-title":"Computability in Analysis and Physics","author":"Pour-El","year":"1989"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB19","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1090\/S0002-9939-1954-0063328-5","article-title":"Recursive real numbers","volume":"5","author":"Rice","year":"1954","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB20","first-page":"271","article-title":"Recursion theory and Dedekind cuts","volume":"140","author":"Soare","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"issue":"1","key":"10.1016\/S0304-3975(01)00110-4_BIB21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.2140\/pjm.1969.31.215","article-title":"Cohesive sets and recursively enumerable Dedekind cuts","volume":"31","author":"Soare","year":"1969","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB22","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB23","first-page":"544","article-title":"On computable numbers with an application to the Entscheidungsproblem","volume":"43","author":"Turing","year":"1937","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00110-4_BIB24","series-title":"Computability","author":"Weihrauch","year":"1987"},{"key":"10.1016\/S0304-3975(01)00110-4_BIB25","doi-asserted-by":"crossref","unstructured":"K. Weihrauch, X. Zheng, Arithmetical hierarchy of real numbers, MFCS\u201999, Sklarska Poreba, Poland, September 1999, pp. 23\u201333.","DOI":"10.1007\/3-540-48340-3_3"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001104?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001104?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T11:55:42Z","timestamp":1583841342000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0304397501001104"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00110-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}