{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,10,17]],"date-time":"2019-10-17T14:43:29Z","timestamp":1571323409580},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540642305","type":"print"},{"value":"9783540697053","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0028594","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:33:39Z","timestamp":1132644819000},"page":"596-606","source":"Crossref","is-referenced-by-count":17,"title":["Recursively enumerable reals and chaitin \u03a9 numbers"],"prefix":"10.1007","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]},{"given":"Peter H.","family":"Hertling","sequence":"additional","affiliation":[]},{"given":"Bakhadyr","family":"Khoussainov","sequence":"additional","affiliation":[]},{"given":"Yongge","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1038\/scientificamerican1179-20","volume":"241","author":"C. H. Bennett","year":"1979","unstructured":"C. H. Bennett, M. Gardner. The random number omega bids fair to hold the mysteries of the universe, Scientific American 241 (1979), 20\u201334.","journal-title":"Scientific American"},{"key":"52_CR2","author":"C. H. Bennett","first-page":"227","year":"1988","unstructured":"C. H. Bennett. Logical depth and physical complexity, in R. Herken (ed.). The Universal Turing Machine. A Half-Century Survey, Oxford University Press, Oxford, 1988, 227\u2013258.","volume-title":"The Universal Turing Machine. A Half-Century Survey"},{"key":"52_CR3","author":"D. S. Bridges","year":"1987","unstructured":"D. S. Bridges, F. Richman. Varieties of Constructive Mathematics, Cambridge University Press, Cambridge, 1987.","volume-title":"Varieties of Constructive Mathematics","DOI":"10.1017\/CBO9780511565663","doi-asserted-by":"crossref"},{"key":"52_CR4","author":"C. Calude","year":"1994","unstructured":"C. Calude. Information and Randomness. An Algorithmic Perspective, Springer-Verlag, Berlin, 1994.","volume-title":"Information and Randomness. An Algorithmic Perspective","DOI":"10.1007\/978-3-662-03049-3","doi-asserted-by":"crossref"},{"key":"52_CR5","first-page":"306","volume":"5","author":"C. Calude","year":"1996","unstructured":"C. Calude and C. Grozea. Kraft-Chaitin inequality revisited, J. UCS 5 (1996), 306\u2013310.","journal-title":"J. UCS"},{"key":"52_CR6","unstructured":"C. Calude, F. W. Meyerstein. Is the universe lawful?, Chaos, Solitons & Fractals, (to appear)."},{"key":"52_CR7","author":"C. Calude","first-page":"472","year":"1994","unstructured":"C. Calude, A. Salomaa. Algorithmically coding the universe, in G. Rozenberg, A. Salomaa (eds.), Developments in Language Theory, World Scientific, Singapore, 1994, 472\u2013492.","volume-title":"Developments in Language Theory"},{"key":"52_CR8","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G. J. Chaitin","year":"1966","unstructured":"G. J. Chaitin. On the length of programs for computing finite binary sequences, J. Assoc. Comput. Mach. 13 (1966), 547\u2013569. (Reprinted in: [111, 219\u2013244)","journal-title":"J. Assoc. Comput. Mach."},{"key":"52_CR9","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. J. Chaitin","year":"1975","unstructured":"G. J. Chaitin. A theory of program size formally identical to information theory, J. Assoc. Comput. Mach. 22 (1975), 329\u2013340. (Reprinted in: [11], 113\u2013128)","journal-title":"J. Assoc. Comput. Mach."},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1147\/rd.214.0350","volume":"21","author":"G. J. Chaitin","year":"1977","unstructured":"G. J. Chaitin. Algorithmic information theory, IBM J. Res. Develop. 21 (1977), 350\u2013359, 496. (Reprinted in: [11], 44\u201358)","journal-title":"IBM J. Res. Develop."},{"key":"52_CR11","author":"G. J. Chaitin","year":"1987","unstructured":"G. J. Chaitin. Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory, World Scientific, Singapore, 1987. (2nd ed., 1990)","volume-title":"Information, Randomness and Incompleteness, Papers on Algorithmic Information Theory","DOI":"10.1142\/0531","doi-asserted-by":"crossref"},{"key":"52_CR12","author":"G. J. Chaitin","year":"1997","unstructured":"G. J. Chaitin. The Limits of Mathematics, Springer-Verlag, Singapore, 1997.","volume-title":"The Limits of Mathematics"},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(94)00014-X","volume":"132","author":"D. Juedes","year":"1994","unstructured":"D. Juedes, J. Lathrop, and J. Lutz. Computational depth and reducibility, Theoret. Comput. Sci. 132 (1994), 37\u201370.","journal-title":"Theoret. Comput. Sci."},{"key":"52_CR14","author":"S. Kautz","year":"1991","unstructured":"S. Kautz. Degrees of Random Sets, PhD Thesis, Cornell University, Ithaca, 1991.","volume-title":"Degrees of Random Sets"},{"key":"52_CR15","author":"K. Ko","year":"1991","unstructured":"Ker-I. Ko. Complexity Theory of Real Functions, Birkh\u00e4user, Boston, 1991.","volume-title":"Complexity Theory of Real Functions","DOI":"10.1007\/978-1-4684-6802-1","doi-asserted-by":"crossref"},{"key":"52_CR16","first-page":"3","volume":"1","author":"A. N. Kolmogorov","year":"1965","unstructured":"A. N. Kolmogorov. Three approaches for defining the concept of \u201cinformation quantity\u201d, Problems Inform. Transmission 1 (1965), 3\u201311.","journal-title":"Problems Inform. Transmission"},{"key":"52_CR17","series-title":"Lecture Notes in Math.","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BFb0076224","volume-title":"Recursion Theory Week (Oberwolfach, 1984)","author":"A. Kucera","year":"1985","unstructured":"A. Kucera. Measure, \u03a0\n \n 1\n 0\n -classes and complete extensions of PA, H.-D. Ebbinghaus, G. H. M\u00fcller, G. E. Sacks (eds.), Recursion Theory Week (Oberwolfach, 1984), Lecture Notes in Math. 1141, Springer-Verlag, Berlin, 1985, 245\u2013259."},{"key":"52_CR18","first-page":"1413","volume":"14","author":"L. A. Levin","year":"1973","unstructured":"L. A. Levin. On the notion of a random sequence, Soviet Math. Dokl. 14 (1973), 1413\u20131416.","journal-title":"Soviet Math. Dokl."},{"key":"52_CR19","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"P. Martin-L\u00f6f. The definition of random sequences, Inform. and Control 9 (1966), 602\u2013619.","journal-title":"Inform. and Control"},{"key":"52_CR20","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C. P. Schnorr","year":"1973","unstructured":"C. P. Schnorr. Process complexity and effective random tests, J. Comput. System Sci. 7 (1973), 376\u2013388.","journal-title":"J. Comput. System Sci."},{"key":"52_CR21","author":"R. I. Soare","year":"1987","unstructured":"R. I. Soare. Recursively Enumerable Sets and Degrees, Springer-Verlag, Berlin, 1987.","volume-title":"Recursively Enumerable Sets and Degrees","DOI":"10.1007\/978-3-662-02460-7","doi-asserted-by":"crossref"},{"key":"52_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. J. Solomonoff","year":"1964","unstructured":"R. J. Solomonoff. A formal theory of inductive inference, Part 1 and Part 2, Inform. and Control 7 (1964), 1\u201322 and 224\u2013254.","journal-title":"Inform. and Control"},{"key":"52_CR23","author":"R. Solovay","year":"1975","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 T. J. Watson Research Center, Yorktown Heights, New York, May 1975, 215 pp.","volume-title":"Draft of a paper (or series of papers) on Chaitin's work ... done for the most part during the period of Sept.\u2013Dec. 1974"},{"key":"52_CR24","author":"Y. Wang","year":"1996","unstructured":"Y. Wang. Randomness and Complexity, PhD Thesis, Universit\u00e4t Heidelberg, Germany, 1996.","volume-title":"Randomness and Complexity"},{"key":"52_CR25","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch. Computability, Springer-Verlag, Berlin, 1987.","volume-title":"Computability","DOI":"10.1007\/978-3-642-69965-8","doi-asserted-by":"crossref"}],"container-title":["STACS 98","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028594","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T01:25:36Z","timestamp":1552958736000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642305","9783540697053"],"references-count":25,"URL":"http:\/\/dx.doi.org\/10.1007\/bfb0028594","relation":{"cites":[]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}]}}