{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T02:37:36Z","timestamp":1769222256231,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,2,13]],"date-time":"2015-02-13T00:00:00Z","timestamp":1423785600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s00224-015-9606-8","type":"journal-article","created":{"date-parts":[[2015,2,12]],"date-time":"2015-02-12T06:49:05Z","timestamp":1423723745000},"page":"513-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Topological Arguments for Kolmogorov Complexity"],"prefix":"10.1007","volume":"56","author":[{"given":"Andrei","family":"Romashchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,13]]},"reference":[{"key":"9606_CR1","doi-asserted-by":"crossref","unstructured":"Bauwens, B., Makhlin, A., Vereshchagin, N., Zimand, M.: Short lists with short programs in short time. In: Proceedings of the 28th IEEE Conference on Computational Complexity, pp 98\u2013108 (2013)","DOI":"10.1109\/CCC.2013.19"},{"key":"9606_CR2","unstructured":"G\u00e1cs, P.: Lecture notes on descriptional complexity and randomness, http:\/\/www.cs.bu.edu\/faculty\/gacs\/papers\/ait-notes.pdf"},{"key":"9606_CR3","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Springer Verlag (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"issue":"1\u20132","key":"9606_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0304-3975(01)00033-0","volume":"271","author":"A Muchnik","year":"2002","unstructured":"Muchnik, A.: Conditional complexity and codes. Chic. J. Theor. Comput. Sci. 271(1\u20132), 97\u2013109 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"9606_CR5","unstructured":"Muchnik, A., Mezhirov, I., Shen, A., Vereshchagin, N.: Game interpretation of Kolmogorov complexity. arXiv: 1003.4712"},{"key":"9606_CR6","unstructured":"Romashchenko, A., Shen, A.: Topological arguments for Kolmogorov complexity, Proceedings of the 18th international workshop on cellular automata and 3rd international symposium Journ\u00e9es Automates Cellulaires, EPTCS, 90, p. 127\u2013132, (2012)"},{"key":"9606_CR7","unstructured":"Shen, A.: Algorithmic information theory and Kolmogorov complexity, technical report TR2000-034, Uppsala University, http:\/\/www.it.uu.se\/research\/publications\/reports\/2000-034"},{"key":"9606_CR8","doi-asserted-by":"crossref","unstructured":"Shen, A.: Game arguments in computability theory and algorithmic information theory, Computability in Europe, 2012, LNCS 7318 p.655\u2013666. Extended version (with Andrej Muchnik and Mikhail Vyugin). arXiv: 1204.0198 (2012)","DOI":"10.1007\/978-3-642-30870-3_66"},{"key":"9606_CR9","first-page":"575","volume-title":"Kolmogorov complexity and algorithmic randomness","author":"N Vereshchagin","year":"2012","unstructured":"Vereshchagin, N., Uspensky, V., Shen, A. Kolmogorov complexity and algorithmic randomness, 575 p. MCCME Publishers, Moscow (2012). For the electronic version and draft English translation see www.lirmm.fr\/~ashen"},{"issue":"1\u20132","key":"9606_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0304-3975(01)00037-8","volume":"271","author":"M Vyugin","year":"2002","unstructured":"Vyugin, M.: Information distances and conditional complexities. Theor. Comput. Sci. 271(1\u20132), 145\u2013150 (2002)","journal-title":"Theor. Comput. Sci."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9606-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9606-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9606-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T21:41:49Z","timestamp":1566337309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9606-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,13]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9606"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9606-8","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,13]]}}}