{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:29Z","timestamp":1761611069789},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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":4521,"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":[[2001,3]]},"DOI":"10.1016\/s0304-3975(99)00159-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T21:51:54Z","timestamp":1027633914000},"page":"125-149","source":"Crossref","is-referenced-by-count":55,"title":["Recursively enumerable reals and Chaitin \u03a9 numbers"],"prefix":"10.1016","volume":"255","author":[{"given":"Cristian","family":"S. Calude","sequence":"first","affiliation":[]},{"given":"Peter","family":"H. Hertling","sequence":"additional","affiliation":[]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[]},{"given":"Yongge","family":"Wang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00159-0_BIB1","series-title":"The Universal Turing Machine, A Half-Century Survey","first-page":"227","article-title":"Logical depth and physical complexity","author":"Bennett","year":"1988"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB2","first-page":"20","article-title":"The random number omega bids fair to hold the mysteries of the universe","volume":"241","author":"Bennett","year":"1979","journal-title":"Scientific Amer."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB3","series-title":"Varieties of Constructive Mathematics","author":"Bridges","year":"1987"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB4","series-title":"An Algorithmic Perspective","article-title":"Information and randomness","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB5","first-page":"306","article-title":"Kraft-Chaitin inequality revisited","volume":"5","author":"Calude C. Grozea","year":"1996","journal-title":"J. UCS"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB6","series-title":"Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science (Paris)","first-page":"596","article-title":"Recursively enumerable reals and Chaitin \u03a9 numbers","author":"Calude","year":"1998"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB7","unstructured":"C. Calude, F.W. Meyerstein, Is the universe lawful?, Chaos, Solitons Fractals (1999), to appear."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB8","first-page":"1161","article-title":"Chaitin \u03a9 numbers and strong reducibilities","volume":"3","author":"Calude","year":"1997","journal-title":"J. UCS"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB9","series-title":"Developments in Language Theory","first-page":"472","article-title":"Algorithmically coding the universe","author":"Calude","year":"1994"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB10","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13 (1966) 547\u2013569 (Reprinted in: Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory (2nd Edition, 1990) World Scientific, Singapore, 1987, pp. 219\u2013244).","DOI":"10.1145\/321356.321363"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB11","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: Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory (2nd Edition, 1990) World Scientific, Singapore, 1987, pp. 113\u2013128).","DOI":"10.1145\/321892.321894"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB12","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Algorithmic information theory, IBM J. Res. Develop. 21 (1977) 350\u2013359, 496 (Reprinted in: Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory (2nd Edition, 1990) World Scientific, Singapore, 1987, pp. 44\u201358).","DOI":"10.1147\/rd.214.0350"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB13","series-title":"Algorithmic Information Theory","author":"Chaitin","year":"1987"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB14","doi-asserted-by":"crossref","unstructured":"G.J. Chaitin, Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory (2nd Edition, 1990) World Scientific, Singapore, 1987.","DOI":"10.1142\/0531"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB15","series-title":"The Limits of Mathematics","author":"Chaitin","year":"1997"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB16","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(94)00014-X","article-title":"Computational depth and reducibility","volume":"132","author":"Juedes","year":"1994","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB17","unstructured":"S. Kautz, Degrees of Random Sets, Ph.D. Thesis, Cornell University, Ithaca, 1991."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB18","unstructured":"Ker-I. Ko, Complexity Theory of Real Functions, Birkh\u00e4user, Boston, 1991."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB19","first-page":"3","article-title":"Three approaches for defining the concept of information quantity","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB20","unstructured":"A. Kucera. Measure, \u03a010 classes and complete extensions of PA, in: H.D. Ebbinghaus, G.H. M\u00fcller, G.E. Sacks (Eds.), Recursion Theory Week, Oberwolfach, 1984, Lecture Notes in Mathematics. 1141, Springer, Berlin, 1985, pp. 245\u2013259."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB21","first-page":"1413","article-title":"On the notion of a random sequence","volume":"14","author":"Levin","year":"1973","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB22","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(99)00159-0_BIB23","series-title":"Cornerstones of Undecidability","author":"Rozenberg","year":"1994"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB24","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","article-title":"Process complexity and effective random tests","volume":"7","author":"Schnorr","year":"1973","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB25","unstructured":"T.A. Slaman, Random Implies \u03a9-Like, Manuscript, 14 December 1998, 2 pp."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB26","unstructured":"T.A. Slaman, Recursive Enumerability and Randomness, Manuscript, 11 January 1999, 5 pp."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB27","series-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB28","doi-asserted-by":"crossref","first-page":"284","DOI":"10.2307\/420992","article-title":"Computability and recursion","volume":"2","author":"Soare","year":"1996","journal-title":"Bull. Symbolic Logic"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB29","doi-asserted-by":"crossref","unstructured":"R.J. Solomonoff, A formal theory of inductive inference, Parts 1 and 2, Inform. and Control 7 (1964) 1\u201322, 224\u2013254.","DOI":"10.1016\/S0019-9958(64)90223-2"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB30","unstructured":"R. Solovay, Draft of a paper (or series of papers) on Chaitin's work ... 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(99)00159-0_BIB31","doi-asserted-by":"crossref","unstructured":"R. Solovay, On random r.e. sets, in: A.I. Arruda, N.C.A. Da Costa, R. Chuaqui (Eds.), Non-Classical Logics, Model Theory and Computability, North-Holland, Amsterdam, 1977, pp. 283\u2013307.","DOI":"10.1016\/S0049-237X(08)70660-8"},{"key":"10.1016\/S0304-3975(99)00159-0_BIB32","unstructured":"Y. Wang, Randomness and Complexity. Ph.D. Thesis, Universit\u00e4t Heidelberg, Germany, 1996."},{"key":"10.1016\/S0304-3975(99)00159-0_BIB33","series-title":"Computability","author":"Weihrauch","year":"1987"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001590?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001590?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T21:00:01Z","timestamp":1555707601000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001590"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["S0304397599001590"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00159-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}