{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T10:45:48Z","timestamp":1649069148452},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":4215,"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":[[2002,1]]},"DOI":"10.1016\/s0304-3975(01)00030-5","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"47-58","source":"Crossref","is-referenced-by-count":3,"title":["Descriptive complexity of computable sequences"],"prefix":"10.1016","volume":"271","author":[{"given":"Bruno","family":"Durand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikolai","family":"Vereshchagin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00030-5_BIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/321495.321506","article-title":"On the length of programs for computing finite binary sequences","volume":"16","author":"Chaitin","year":"1969","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(01)00030-5_BIB2","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":"this Vol.","key":"10.1016\/S0304-3975(01)00030-5_BIB3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0304-3975(01)00029-9","article-title":"Comparison between the complexity of a function and the complexity of its graph","volume":"271","author":"Durand","year":"2002","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00030-5_BIB4","unstructured":"B. Durand, A. Shen, N. Vereshchagin, in: Descriptive complexity of computable sequences, STACS\u201999, Lecture Notes in Computer Sciences, vol. 1563, Springer, Berlin, March 1999."},{"issue":"1","key":"10.1016\/S0304-3975(01)00030-5_BIB5","first-page":"1","article-title":"Three approaches to the quantitative definition of information","volume":"1","author":"Kolmogorov","year":"1965","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/S0304-3975(01)00030-5_BIB6","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00030-5_BIB7","doi-asserted-by":"crossref","first-page":"510","DOI":"10.1016\/S0019-9958(69)90538-5","article-title":"A variant of Kolmogorov concept of complexity","volume":"15","author":"Loveland","year":"1969","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(01)00030-5_BIB8","doi-asserted-by":"crossref","unstructured":"R.J. Solomonoff, A formal theory of inductive inference, part 1 and part 2, Inform. and Control 7 (1964) 1\u201322, 224\u2013254.","DOI":"10.1016\/S0019-9958(64)90223-2"},{"key":"10.1016\/S0304-3975(01)00030-5_BIB9","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01201280","article-title":"Relations between varieties of Kolmogorov complexities","volume":"29","author":"Uspensky","year":"1996","journal-title":"Math. Systems Theory"},{"issue":"6","key":"10.1016\/S0304-3975(01)00030-5_BIB10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concepts of information and randomness by means of theory of algorithms","volume":"25","author":"Zvonkin","year":"1970","journal-title":"Russian Math. Surveys"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000305?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000305?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:51:07Z","timestamp":1556851867000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000305"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00030-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}