{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T01:07:06Z","timestamp":1660266426428},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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,1]]},"DOI":"10.1016\/s0304-3975(01)00027-5","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T13:27:27Z","timestamp":1034688447000},"page":"3-14","source":"Crossref","is-referenced-by-count":21,"title":["A characterization of c.e. random reals"],"prefix":"10.1016","volume":"271","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00027-5_BIB1","series-title":"Information and Randomness. An Algorithmic Perspective","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB2","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1038\/22435","article-title":"Randomness everywhere","volume":"400","author":"Calude","year":"1999","journal-title":"Nature"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB3","series-title":"Jewels are Forever","first-page":"225","article-title":"Program-size complexity of initial segments and domination relation reducibility","author":"Calude","year":"1999"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB4","first-page":"306","article-title":"Kraft-Chaitin inequality revisited","volume":"5","author":"Calude","year":"1996","journal-title":"J. Univ. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00027-5_BIB5","doi-asserted-by":"crossref","unstructured":"C.S. Calude, P. Hertling, B. Khoussainov, Y. Wang, Recursively enumerable reals and Chaitin \u03a9 numbers, in: M. Morvan, C. Meinel, D. Krob (Eds.), Proc. 15th Symp. on Theoretical Aspects of Computer Science, Paris, Springer, Berlin, 1998, pp. 596\u2013606. Theoret. Comput. Sci., Full paper to appear.","DOI":"10.1007\/BFb0028594"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB6","series-title":"Results and Trends in Theoretical Computer Science","first-page":"44","article-title":"Randomness as an invariant for number representations","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB7","first-page":"1161","article-title":"Chaitin \u03a9 numbers and strong reducibilities","volume":"3","author":"Calude","year":"1997","journal-title":"J. Univ. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00027-5_BIB8","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (1975) 329\u2013340. (Reprinted in: [10], pp. 113\u2013128).","DOI":"10.1145\/321892.321894"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB9","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Algorithmic information theory, IBM J. Res. Develop. 21 (1977) 350\u2013359, 496. (Reprinted in: [10], pp. 44\u201358).","DOI":"10.1147\/rd.214.0350"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB10","series-title":"Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory","author":"Chaitin","year":"1987"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB11","series-title":"The Limits of Mathematics","author":"Chaitin","year":"1997"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB12","series-title":"The Unknowable","author":"Chaitin","year":"1999"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB13","first-page":"118","volume":"vol. 2","author":"Freund","year":"1996"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB14","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)00027-5_BIB15","unstructured":"T.A. Slaman, Random implies \u03a9-like, manuscript, 14 December 1998, 2 pp. Full paper, Randomness and recursive enumerability, to appear in SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00027-5_BIB16","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0304-3975(01)00027-5_BIB17","unstructured":"R. Solovay, Draft of a paper (or series of papers) on Chaitin's work \u2026 done for the most part during the period of September\u2013December 1974, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000275?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000275?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:23:43Z","timestamp":1556879023000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000275"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00027-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}