{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T03:16:34Z","timestamp":1778901394893,"version":"3.51.4"},"reference-count":13,"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)00028-7","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"15-35","source":"Crossref","is-referenced-by-count":19,"title":["Kolmogorov entropy in the context of computability theory"],"prefix":"10.1016","volume":"271","author":[{"given":"Andrej A.","family":"Muchnik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Semen Ye.","family":"Positselsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00028-7_BIB1","doi-asserted-by":"crossref","first-page":"579","DOI":"10.2307\/2271984","article-title":"On complexity properties of recursively enumerable sets","volume":"38","author":"Blum","year":"1973","journal-title":"J. Symbolic Logic"},{"issue":"3","key":"10.1016\/S0304-3975(01)00028-7_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.2307\/2964290","article-title":"Three theorems on recursive enumeration","volume":"23","author":"Friedberg","year":"1958","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(01)00028-7_BIB3","unstructured":"G.N. Kobzev, On r-separable sets, Issledovanija po matematicheskoj logike i teorii algoritmov, University of Tbilisi, 1975, pp. 19\u201330 (in Russian)."},{"key":"10.1016\/S0304-3975(01)00028-7_BIB4","first-page":"25","volume":"vol. 1046","author":"Kummer","year":"1996"},{"issue":"1","key":"10.1016\/S0304-3975(01)00028-7_BIB5","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1099","article-title":"Recursion theoretic properties of frequency computation and bounded queries","volume":"120","author":"Kummer","year":"1995","journal-title":"Inform. and Comput."},{"issue":"4","key":"10.1016\/S0304-3975(01)00028-7_BIB6","doi-asserted-by":"crossref","first-page":"573","DOI":"10.2307\/2269692","article-title":"A note on universal sets","volume":"31","author":"Lachlan","year":"1966","journal-title":"J. Symbolic Logic"},{"issue":"2","key":"10.1016\/S0304-3975(01)00028-7_BIB7","first-page":"429","article-title":"wtt-Complete sets are not necessarily tt-complete","volume":"48","author":"Lachlan","year":"1975","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00028-7_BIB8","unstructured":"Al.A. Muchnik, On separability of recursively enumerable sets, Dok. Akad. Nauk SSSR 109(1) (1956) 29\u201332 (in Russian) (Translation available in Soviet Math. Dok.)."},{"issue":"3","key":"10.1016\/S0304-3975(01)00028-7_BIB9","first-page":"717","article-title":"On reduction of the problems of decidability of enumerable sets to separability problems","volume":"29","author":"Muchnik","year":"1965","journal-title":"Izv. Akad. Nauk SSSR Serija Mat."},{"key":"10.1016\/S0304-3975(01)00028-7_BIB10","doi-asserted-by":"crossref","unstructured":"An.A. Muchnik, S.E. Positselsky, On one class of enumerable sets, Uspehi Mat. Nauk 54(3) (1999) 171\u2013172 (in Russian) (Translation available in Russian Math. Surveys).","DOI":"10.1070\/RM1999v054n03ABEH000163"},{"issue":"5","key":"10.1016\/S0304-3975(01)00028-7_BIB11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1090\/S0002-9904-1944-08111-1","article-title":"Recursively enumerable sets of positive integers and their decision problems","volume":"50","author":"Post","year":"1944","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00028-7_BIB12","series-title":"Algorithms: Main Ideas and Applications","author":"Uspensky","year":"1993"},{"issue":"3","key":"10.1016\/S0304-3975(01)00028-7_BIB13","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000287?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000287?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:25:27Z","timestamp":1578428727000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0304397501000287"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00028-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}