{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T01:58:07Z","timestamp":1771034287399,"version":"3.50.1"},"reference-count":34,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Experimental Mathematics"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1080\/10586458.2002.10504481","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T17:45:49Z","timestamp":1333475149000},"page":"361-370","source":"Crossref","is-referenced-by-count":23,"title":["Computing a Glimpse of Randomness"],"prefix":"10.1080","volume":"11","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]},{"given":"Michael J.","family":"Dinneen","sequence":"additional","affiliation":[]},{"given":"Chi-Kou","family":"Shu","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1038\/scientificamerican1179-20","volume":"241","author":"Bennett C. H.","year":"1979","journal-title":"Scientific American"},{"key":"CIT0002","volume-title":"Computability\u2014A Mathematical Sketchbook","author":"Bridges D. S.","year":"1994"},{"key":"CIT0003","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03049-3","volume-title":"Information and Randomness. An Algorithmic Perspective.","author":"Calude C. S.","year":"1994"},{"key":"CIT0004","first-page":"67","volume-title":"Logic, Language and Computation","volume":"3","author":"Calude C. S.","year":"2000"},{"key":"CIT0005","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(01)00027-5","volume":"217","author":"Calude C. S.","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"CIT0006","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(01)00068-8","volume":"284","author":"Calude C. S.","year":"2002","journal-title":"Theoret. Comput. Sci."},{"issue":"22","key":"CIT0007","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1038\/22435","volume":"400","author":"Calude C. S.","year":"1999","journal-title":"Nature"},{"key":"CIT0008","volume":"146","author":"Calude C. S.","year":"2000","journal-title":"CDMTCS Research Report"},{"key":"CIT0009","doi-asserted-by":"crossref","unstructured":"Calude, C. S., Hertling, P., Khoussainov, B. and Wang, Y. \u201cRecursively enumerable reals and Chaitin \u03c9 numbers.\u201d. Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science. Paris. Edited by: Morvan, M., Meinel, C. and Krob, D. pp.596\u2013606. Berlin: Springer-Verlag. [Calude et al. 01], Full paper inTheoret. Comput. Sci. 255 (2001), 125\u2013149","DOI":"10.1016\/S0304-3975(99)00159-0"},{"key":"CIT0010","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/3-540-58131-6_37","volume-title":"Results and Trends in Theoretical Computer Science","author":"Calude C.","year":"1994"},{"key":"CIT0011","first-page":"34","volume":"154","author":"Casti J. L.","year":"1997","journal-title":"The New Scientist"},{"key":"CIT0012","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"Chaitin G. J.","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"CIT0013","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511608858","volume-title":"Algorithmic Information Theory","author":"Chaitin G. J.","year":"1987"},{"key":"CIT0014","doi-asserted-by":"crossref","DOI":"10.1142\/0531","volume-title":"Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory","author":"Chaitin G. J.","year":"1987"},{"key":"CIT0015","volume-title":"The Limits of Mathematics.","author":"Chaitin G. J.","year":"1997"},{"key":"CIT0016","volume-title":"The Unknowable","author":"Chaitin G. J.","year":"1999"},{"key":"CIT0017","volume-title":"Exploring Randomness","author":"Chaitin G. J.","year":"2000"},{"key":"CIT0018","unstructured":"Chaitin, G. J. November 2000. November, [Chaitin 00b], Personal communication to C. S. Calude"},{"key":"CIT0019","unstructured":"Chaitin, G. J. December 2001. December, [Chaitin 01], Personal communication to C. S. Calude"},{"key":"CIT0020","volume":"173","author":"Downey R. G.","year":"2002","journal-title":"CDMTCS Research Report"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Hertling, P. and Weihrauch, K. \u201cRandomness spaces.\u201d. Automata, Languages and Programming, Proceedings of the 25th International Colloquium, ICALP1998. Aalborg, Denmark. Edited by: Larsen, K. G., Skyum, S. and Winskel, G. pp.796\u2013807. Berlin: Springer-Verlag. [Hertling and Weihrauch 98]","DOI":"10.1007\/BFb0055103"},{"issue":"1","key":"CIT0022","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S0097539799357441","volume":"31","author":"Ku\u010dera A.","year":"2001","journal-title":"SIAM J. Comput"},{"key":"CIT0023","volume-title":"Algorithms and Random Sequences","author":"Martin-L\u00f6f P.","year":"1966"},{"key":"CIT0024","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"Martin-L\u00f6f P.","year":"1966","journal-title":"Inform, and Control"},{"key":"CIT0025","first-page":"247","volume":"40","author":"Marxen H.","year":"1990","journal-title":"Bull EATCS"},{"key":"CIT0026","volume-title":"Classical Recursion Theory","volume":"1","author":"Odifreddi P.","year":"1989"},{"key":"CIT0027","series-title":"Ph.D. Thesis","volume-title":"Computing Exact Approximations of a Chaitin Omega Number","author":"Shu C.","year":"2003"},{"key":"CIT0028","first-page":"271","volume":"140","author":"Soare R. I.","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"CIT0029","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02460-7","volume-title":"Recursively Enumerable Sets and Degrees","author":"Soare R. I.","year":"1987"},{"key":"CIT0030","unstructured":"Solovay, R. M. May 1975.Draft of a paper (or series of papers) on Chaitin's work \u2026done for the most part during the period of Sept.Dec. 1974May, 215New York: IBM Thomas J. Watson Research Center, York-town Heights. [Solovay 75], unpublished manuscript"},{"key":"CIT0031","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/978-1-4471-0751-4_21","volume-title":"Finite Versus Infinite. Contributions to an Eternal Dilemma","author":"Solovay R. M.","year":"2000"},{"key":"CIT0032","doi-asserted-by":"crossref","unstructured":"Staiger, L. \u201cThe Kolmogorov complexity of real numbers.\u201d. Proc. Fundamentals of Computation Theory. Edited by: Ciobanu, G. and P\u0103un, Gh. pp.536\u2013546. Berlin: Springer-Verlag. [Staiger 91], Lecture Notes in Comput. Sci. No. 1684","DOI":"10.1007\/3-540-48321-7_45"},{"key":"CIT0033","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1038\/352664a0","volume":"352","author":"Stewart I.","year":"1991","journal-title":"Nature"},{"key":"CIT0034","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69965-8","volume-title":"Computability","author":"Weihrauch K.","year":"1987"}],"container-title":["Experimental Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10586458.2002.10504481","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T14:40:09Z","timestamp":1561560009000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10586458.2002.10504481"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["10.1080\/10586458.2002.10504481"],"URL":"https:\/\/doi.org\/10.1080\/10586458.2002.10504481","relation":{},"ISSN":["1058-6458","1944-950X"],"issn-type":[{"value":"1058-6458","type":"print"},{"value":"1944-950X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}