{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:16:08Z","timestamp":1742980568127,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031643088"},{"type":"electronic","value":"9783031643095"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_3","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"27-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Kolmogorov Complexity as\u00a0a\u00a0Combinatorial Tool"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8605-7734","authenticated-orcid":false,"given":"Alexander","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"3_CR1","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. TCS, Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"593","DOI":"10.2178\/jsl\/1208359062","volume":"73","author":"B Durand","year":"2008","unstructured":"Durand, B., Levin, L., Shen, A.: Complex tilings. J. Symb. Log. 73(2), 593\u2013613 (2008)","journal-title":"J. Symb. Log."},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.ejc.2005.08.002","volume":"28","author":"N Alon","year":"2007","unstructured":"Alon, N., Newman, I., Shen, A., Tardos, G., Vereshchagin, N.: Partitioning multi-dimensional sets in a small number of \u201cuniform\u2019\u2019 parts. Eur. J. Comb. 28(1), 134\u2013144 (2007)","journal-title":"Eur. J. Comb."},{"key":"3_CR4","unstructured":"Muchnik, A.A., Mezhirov, I., Shen, A., Vereshchagin, N.: Game interpretation of kolmogorov complexity. arXiv:1003.4712 (2010)"},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3356867","volume":"66","author":"A Romashchenko","year":"2019","unstructured":"Romashchenko, A., Zimand, M.: An operational characterization of mutual information in algorithmic information theory. J. ACM 66(5), 1\u201342 (2019). https:\/\/doi.org\/10.1145\/3356867","journal-title":"J. ACM"},{"key":"3_CR6","unstructured":"Rosenfeld, M.: Finding lower bounds on the growth and entropy of subshifts over countable groups. arXiv:2204.00394 (2022)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/11672142_32","volume-title":"STACS 2006","author":"AY Rumyantsev","year":"2006","unstructured":"Rumyantsev, A.Y., Ushakov, M.A.: Forbidden substrings, kolmogorov complexity and almost periodic sequences. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 396\u2013407. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11672142_32"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-20712-9_9","volume-title":"Computer Science \u2013 Theory and Applications","author":"A Shen","year":"2011","unstructured":"Shen, A.: Kolmogorov complexity as a language. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 105\u2013119. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20712-9_9"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-319-58741-7_11","volume-title":"Unveiling Dynamics and Complexity","author":"Alexander Shen","year":"2017","unstructured":"Shen, Alexander: Compressibility and probabilistic proofs. In: Kari, Jarkko, Manea, Florin, Petre, Ion (eds.) CiE 2017. LNCS, vol. 10307, pp. 101\u2013111. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58741-7_11"},{"key":"3_CR10","unstructured":"Shen, A.,\u00a0Uspensky, V.A.,\u00a0Vereshchagin, N.: Kolmogorov complexity and algorithmic randomness. American Mathematical Society (Mathematical Surveys and Monographs, volume 220 (2019). https:\/\/www.lirmm.fr\/~ashen\/kolmbook-eng-scan.pdf"}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:02:13Z","timestamp":1719871333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}