{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:57:02Z","timestamp":1712426222792},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1016\/j.jcss.2010.08.001","type":"journal-article","created":{"date-parts":[[2010,8,11]],"date-time":"2010-08-11T08:54:07Z","timestamp":1281516847000},"page":"812-819","source":"Crossref","is-referenced-by-count":9,"title":["Representation of left-computable \u03b5-random reals"],"prefix":"10.1016","volume":"77","author":[{"given":"Cristian S.","family":"Calude","sequence":"first","affiliation":[]},{"given":"Nicholas J.","family":"Hay","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Stephan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2010.08.001_br0010","series-title":"Information and Randomness. An Algorithmic Perspective","author":"Calude","year":"2002"},{"key":"10.1016\/j.jcss.2010.08.001_br0020","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/jigpal\/jzp015","article-title":"Every computably enumerable random real is provably computably enumerable random","volume":"17","author":"Calude","year":"2009","journal-title":"Logic J. IGPL"},{"key":"10.1016\/j.jcss.2010.08.001_br0030","series-title":"Proceedings of the 15th Symposium on Theoretical Aspects of Computer Science","first-page":"596","article-title":"Recursively enumerable reals and Chaitin \u03a9 numbers","author":"Calude","year":"1998"},{"key":"10.1016\/j.jcss.2010.08.001_br0040","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.apal.2005.06.004","article-title":"On partial randomness","volume":"138","author":"Calude","year":"2006","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/j.jcss.2010.08.001_br0050","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","article-title":"A theory of program size formally identical to information theory","volume":"22","author":"Chaitin","year":"1975","journal-title":"J. Assoc. Comput. Machinery"},{"key":"10.1016\/j.jcss.2010.08.001_br0060","series-title":"Algorithmic Information Theory","author":"Chaitin","year":"1987"},{"key":"10.1016\/j.jcss.2010.08.001_br0070","author":"Hay"},{"key":"10.1016\/j.jcss.2010.08.001_br0080","series-title":"Computability and Randomness","author":"Nies","year":"2009"},{"key":"10.1016\/j.jcss.2010.08.001_br0090","series-title":"Classical Recursion Theory, vol. 1","author":"Odifreddi","year":"1997"},{"key":"10.1016\/j.jcss.2010.08.001_br0100","series-title":"Models of Peano Arithmetic","author":"Kaye","year":"1991"},{"issue":"1","key":"10.1016\/j.jcss.2010.08.001_br0110","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1137\/S0097539799357441","article-title":"Randomness recursive enumerability","volume":"31","author":"Ku\u010dera","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jcss.2010.08.001_br0120","series-title":"Proceedings of the 9th Asian Logic Conference, \u201cMathematical Logic in Asia\u201d","first-page":"215","article-title":"On hierarchies of randomness tests","author":"Reimann","year":"2006"},{"key":"10.1016\/j.jcss.2010.08.001_br0130","series-title":"Proceedings of Computability and Complexity in Analysis 2000","first-page":"296","article-title":"Characterization of the computable real numbers by means of primitive recursive functions","volume":"vol. 2064","author":"Skordev","year":"2001"},{"key":"10.1016\/j.jcss.2010.08.001_br0140","unstructured":"Mike Stay, Personal communication to C. Calude, 7 May 2007."},{"key":"10.1016\/j.jcss.2010.08.001_br0150","unstructured":"Rorbert M. Solovay, Draft of a paper (or series of papers) on Chaitin\u02bcs 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\/j.jcss.2010.08.001_br0160","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/inco.1993.1017","article-title":"Kolmogorov complexity and Hausdorff dimension","volume":"103","author":"Staiger","year":"1993","journal-title":"Inform. and Comput."},{"key":"10.1016\/j.jcss.2010.08.001_br0170","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s002240000086","article-title":"A tight upper bound on Kolmogorov complexity and uniformly optimal prediction","volume":"31","author":"Staiger","year":"1998","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.jcss.2010.08.001_br0180","doi-asserted-by":"crossref","first-page":"219","DOI":"10.14492\/hokmj\/1350911778","article-title":"A generalization of Chaitin\u02bcs halting probability \u03a9 and halting self-similar sets","volume":"31","author":"Tadaki","year":"2002","journal-title":"Hokkaido Math. J."},{"key":"10.1016\/j.jcss.2010.08.001_br0190","author":"Tadaki"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200001000108X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200001000108X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,8]],"date-time":"2018-12-08T23:23:05Z","timestamp":1544311385000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200001000108X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["S002200001000108X"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2010.08.001","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}