{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T22:44:26Z","timestamp":1648853066856},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,1,1]],"date-time":"1981-01-01T00:00:00Z","timestamp":347155200000},"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":11885,"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":[[1981]]},"DOI":"10.1016\/0304-3975(81)90083-9","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T23:13:42Z","timestamp":1034291622000},"page":"291-309","source":"Crossref","is-referenced-by-count":6,"title":["Several results in program size complexity"],"prefix":"10.1016","volume":"15","author":[{"given":"Howard P.","family":"Katseff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Sipser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(81)90083-9_BIB1","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":"Information and Control"},{"key":"10.1016\/0304-3975(81)90083-9_BIB2","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321356.321363","article-title":"On the length of programs for computing finite binary strings","volume":"13","author":"Chaitin","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(81)90083-9_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(81)90083-9_BIB4","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."},{"key":"10.1016\/0304-3975(81)90083-9_BIB5","first-page":"139","article-title":"Program size, oracles, and the jump operation","volume":"14","author":"Chaitin","year":"1977","journal-title":"Osaka J. Math."},{"key":"10.1016\/0304-3975(81)90083-9_BIB6","first-page":"113","article-title":"Complexity and randomness","volume":"7","author":"Daley","year":"1973"},{"key":"10.1016\/0304-3975(81)90083-9_BIB7","doi-asserted-by":"crossref","first-page":"626","DOI":"10.2307\/2272040","article-title":"Non-complex sequences: characterizations and examples","volume":"41","author":"Daley","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(81)90083-9_BIB8","series-title":"Courant Computer Science Report 5","first-page":"1","article-title":"Investigations in the theory of descriptive complexity","author":"Gewirtz","year":"1974"},{"key":"10.1016\/0304-3975(81)90083-9_BIB9","first-page":"305","article-title":"On Kolomogorov Complexity and information","volume":"10","author":"Kamae","year":"1973","journal-title":"Osaka J. Math."},{"key":"10.1016\/0304-3975(81)90083-9_BIB10","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0019-9958(78)90062-1","article-title":"Complexity dips in infinite binary sequences","volume":"38","author":"Katseff","year":"1978","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(81)90083-9_BIB11","article-title":"Three Approaches for Defining the Concept of Information Quantity","volume":"7","author":"Kolmogorov","year":"1968"},{"key":"10.1016\/0304-3975(81)90083-9_BIB12","series-title":"The Art of Computer Programming, Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0304-3975(81)90083-9_BIB13","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(81)90083-9_BIB14","article-title":"Complexity oscillations in infinite binary sequences","volume":"19","author":"Martin-L\u00f6f","year":"1969","journal-title":"Z. Wahrscheinlichkeitstheorie und Verw. Gebiete"},{"key":"10.1016\/0304-3975(81)90083-9_BIB15","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1002\/j.1538-7305.1962.tb00480.x","article-title":"On Non-computable functions","author":"Rado","year":"1962","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0304-3975(81)90083-9_BIB16","doi-asserted-by":"crossref","first-page":"31","DOI":"10.2307\/2964292","article-title":"G\u00f6del numberings of the partial recursive functions","volume":"23","author":"Rogers","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0304-3975(81)90083-9_BIB17","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1968"},{"key":"10.1016\/0304-3975(81)90083-9_BIB18","series-title":"Degrees of Unsolvability","author":"Shoenfield","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900839?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397581900839?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T13:25:19Z","timestamp":1554989119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397581900839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981]]}},"alternative-id":["0304397581900839"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(81)90083-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}