{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T14:45:18Z","timestamp":1780497918959,"version":"3.54.1"},"reference-count":8,"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)00031-7","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"59-67","source":"Crossref","is-referenced-by-count":3,"title":["Kolmogorov complexity conditional to large integers"],"prefix":"10.1016","volume":"271","author":[{"given":"Nikolai K.","family":"Vereshchagin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00031-7_BIB1","unstructured":"B. Durand, A. Shen, N. Vereshchagin, Descriptive complexity of computable sequences, in: C. Meinel, S. Tison (Eds.), Proc. 16th Annu. Symp. on Theoretical Aspects of Computer Science, Trier, Germany, March 1999, Lecture Notes in Computer Science Vol. 1563, Springer, Berlin, pp. 153\u2013162."},{"key":"10.1016\/S0304-3975(01)00031-7_BIB2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0304-3975(83)90139-1","article-title":"On the relation between descriptional complexity and algorithmic probability","volume":"22","author":"G\u00e1cs","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00031-7_BIB3","first-page":"305","article-title":"On Kolmogorov's complexity and information","volume":"10","author":"Kamae","year":"1973","journal-title":"Osaka J. Math."},{"key":"10.1016\/S0304-3975(01)00031-7_BIB4","series-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1997"},{"key":"10.1016\/S0304-3975(01)00031-7_BIB5","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/1132072","article-title":"Lower limits on frequencies in computable sequences and relativized a priori probability","volume":"32","author":"Muchnik","year":"1987","journal-title":"SIAM Theory Probab. Appl."},{"key":"10.1016\/S0304-3975(01)00031-7_BIB6","series-title":"Proc. Symp. on Mathematical Theory of Automata, MRI Symposium Series XII","first-page":"75","article-title":"On a simple source for non-computable functions","author":"Rado","year":"1962"},{"key":"10.1016\/S0304-3975(01)00031-7_BIB7","doi-asserted-by":"crossref","unstructured":"V. Uspensky, A. Semenov, Algorithms: Main Ideas and Applications, Kluwer Academic Publishers, Dordrecht, 1993, 269pp.","DOI":"10.1007\/978-94-015-8232-2"},{"issue":"6","key":"10.1016\/S0304-3975(01)00031-7_BIB8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","article-title":"The complexity of finite objects and the development of the concept of information and randomness by means of the 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:S0304397501000317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:23:39Z","timestamp":1556864619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000317"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00031-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}