{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:45:54Z","timestamp":1648874754814},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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":10943,"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":[[1983,8]]},"DOI":"10.1016\/0304-3975(83)90001-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"221-237","source":"Crossref","is-referenced-by-count":2,"title":["Toward an abstract theory of data compression"],"prefix":"10.1016","volume":"24","author":[{"given":"James A.","family":"Storer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(83)90001-4_BIB1","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine independent theory of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90001-4_BIB2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0019-9958(67)90546-3","article-title":"On the size of machines","volume":"11","author":"Blum","year":"1967","journal-title":"Inform. Control"},{"issue":"2","key":"10.1016\/0304-3975(83)90001-4_BIB3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/321637.321648","article-title":"On effective procedures for speeding up algorithms","volume":"18","author":"Blum","year":"1971","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/0304-3975(83)90001-4_BIB4","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary sequences","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(83)90001-4_BIB5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences: statistical considerations","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(83)90001-4_BIB6","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1145\/321526.321530","article-title":"On the simplicity and speed for computing infinite sets of natural numbers","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/0304-3975(83)90001-4_BIB7","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(83)90001-4_BIB8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(76)90005-0","article-title":"Information-theoretic characterizations of recursive infinite strings","volume":"2","author":"Chaitin","year":"1976","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"10.1016\/0304-3975(83)90001-4_BIB9","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2272040","article-title":"Noncomplex sequences: Characterizations and examples","volume":"41","author":"Daley","year":"1976","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"10.1016\/0304-3975(83)90001-4_BIB10","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/321650.321661","article-title":"An overview of the theory of computational complexity","volume":"18","author":"Hartmanis","year":"1971","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0304-3975(83)90001-4_BIB11","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BF01762186","article-title":"Computational complexity of formal translations","volume":"8","author":"Hartmanis","year":"1974","journal-title":"Math. Systems Theory"},{"issue":"1","key":"10.1016\/0304-3975(83)90001-4_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0204001","article-title":"On simple G\u00f6del numberings and translations","volume":"4","author":"Hartmanis","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90001-4_BIB13","first-page":"82","author":"Katseff","year":"1977","journal-title":"Several results in program size complexity"},{"key":"10.1016\/0304-3975(83)90001-4_BIB14","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0304-3975(83)90001-4_BIB15","first-page":"3","article-title":"On the logical foundation of information theory","volume":"5","author":"Kolmogrov","year":"1969","journal-title":"Problems of Information Transmission"},{"key":"10.1016\/0304-3975(83)90001-4_BIB16","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":"Inform. Control"},{"key":"10.1016\/0304-3975(83)90001-4_BIB17","first-page":"236","author":"Machtey","year":"1976","journal-title":"Simple G\u00f6del numberings, translations, and the P-hierarchy: Preliminary report"},{"key":"10.1016\/0304-3975(83)90001-4_BIB18","doi-asserted-by":"crossref","first-page":"331","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.1016\/0304-3975(83)90001-4_BIB19","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF01762189","article-title":"Optimal enumerations and optimal G\u00f6del numberings","volume":"8","author":"Schnorr","year":"1974","journal-title":"Math. Systems Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900014?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900014?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:28:24Z","timestamp":1555126104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900014"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0304397583900014"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90001-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}