{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:18:40Z","timestamp":1759335520559},"reference-count":20,"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)00068-8","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T19:39:34Z","timestamp":1034192374000},"page":"269-277","source":"Crossref","is-referenced-by-count":16,"title":["Chaitin \u03a9 numbers, Solovay machines, and G\u00f6del incompleteness"],"prefix":"10.1016","volume":"284","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00068-8_BIB1","series-title":"Information and Randomness. An Algorithmic Perspective","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB2","doi-asserted-by":"crossref","unstructured":"C.S. Calude, A characterization of c.e. random reals, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(01)00027-5"},{"issue":"22","key":"10.1016\/S0304-3975(01)00068-8_BIB3","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)00068-8_BIB4","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. 255 (2001) 125\u2013149.","DOI":"10.1016\/S0304-3975(99)00159-0"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB5","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)00068-8_BIB6","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)00068-8_BIB7","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], 113\u2013128).","DOI":"10.1145\/321892.321894"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB8","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Algorithmic information theory, IBM J. Res. Develop. 21 (1977) 350\u2013359, 496 (Reprinted in: [10], 44\u201358).","DOI":"10.1147\/rd.214.0350"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB9","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Algorithmic Information Theory, Cambridge University Press, Cambridge, 1987 (Third printing 1990).","DOI":"10.1017\/CBO9780511608858"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB10","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987 (2nd ed., 1990).","DOI":"10.1142\/0531"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB11","series-title":"The Limits of Mathematics","author":"Chaitin","year":"1997"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB12","series-title":"The Unknowable","author":"Chaitin","year":"1999"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB13","unstructured":"R.G. Downey, G.L. LaForte, Presentations of computably enumerable reals, CDMTCS Research Report 135, 2000, 23pp."},{"key":"10.1016\/S0304-3975(01)00068-8_BIB14","series-title":"Automata, Languages and Programming, Proc. 25th Int. Colloq. ICALP\u201998","first-page":"796","article-title":"Randomness spaces","author":"Hertling","year":"1998"},{"issue":"1","key":"10.1016\/S0304-3975(01)00068-8_BIB15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S0097539799357441","article-title":"Randomness and recursive enumerability","volume":"31","author":"Ku\u00e7era","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00068-8_BIB16","unstructured":"P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, vol.1, 1989, vol. 2, 1999."},{"key":"10.1016\/S0304-3975(01)00068-8_BIB17","unstructured":"T.A. Slaman, Random Implies \u03a9-Like, manuscript, 14 December 1998, 2 pp."},{"key":"10.1016\/S0304-3975(01)00068-8_BIB18","unstructured":"R.M. Solovay, Draft of a paper (or series of papers) on Chaitin's work \u2026 done for the most part during the period of Sept.\u2013Dec. 1974, unpublished manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp."},{"key":"10.1016\/S0304-3975(01)00068-8_BIB19","series-title":"Finite Versus Infinite. Contributions to an Eternal Dilemma","first-page":"323","article-title":"A version of \u03a9 for which ZFC cannot predict a single bit","author":"Solovay","year":"2000"},{"key":"10.1016\/S0304-3975(01)00068-8_BIB20","series-title":"Proc. Fundamentals of Computation Theory","first-page":"536","article-title":"The Kolmogorov complexity of real numbers","author":"Staiger","year":"1999"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000688?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000688?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,10]],"date-time":"2020-03-10T15:55:34Z","timestamp":1583855734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0304397501000688"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00068-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}