{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:15:36Z","timestamp":1778901336659,"version":"3.51.4"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,6,1]],"date-time":"1976-06-01T00:00:00Z","timestamp":202435200000},"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":13560,"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":[[1976,6]]},"DOI":"10.1016\/0304-3975(76)90005-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"45-48","source":"Crossref","is-referenced-by-count":60,"title":["Information-theoretic characterizations of recursive infinite strings"],"prefix":"10.1016","volume":"2","author":[{"given":"Gregory J.","family":"Chaitin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(76)90005-0_BIB1_1","article-title":"Information-theoretic aspects of the Turing degrees","volume":"19","author":"Chaitin","year":"1972","journal-title":"AMS Notices"},{"key":"10.1016\/0304-3975(76)90005-0_BIB1_2","article-title":"Information-theoretic aspects of the Turing degrees","volume":"19","author":"Chaitin","year":"1972","journal-title":"AMS Notices"},{"key":"10.1016\/0304-3975(76)90005-0_BIB2","first-page":"13","article-title":"There are few minimal descriptions. A necessary and sufficient condition for an infinite binary string to be recursive","author":"Chaitin","year":"1973","journal-title":"Recursive Function Theory Newsletter"},{"key":"10.1016\/0304-3975(76)90005-0_BIB3","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. ACM"},{"key":"10.1016\/0304-3975(76)90005-0_BIB4","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","article-title":"A variant of the Kolmogorov concept of complexity","volume":"15","author":"Loveland","year":"1969","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(76)90005-0_BIB5","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."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900050?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397576900050?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:20:58Z","timestamp":1555125658000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397576900050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,6]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,6]]}},"alternative-id":["0304397576900050"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(76)90005-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1976,6]]}}}