{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T07:21:43Z","timestamp":1769239303899,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642308697","type":"print"},{"value":"9783642308703","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_66","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"655-666","source":"Crossref","is-referenced-by-count":9,"title":["Game Arguments in Computability Theory and Algorithmic Information Theory"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Shen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","unstructured":"Bauwens, B.: Computability in statistical hypotheses testing, and characterizations of independence and directed influences in time series using Kolmogorov complexity. PhD thesis, Ugent (May 2010)"},{"key":"66_CR2","unstructured":"Bienvenu, L., Shen, A.: Algorithmic information theory and martingales. arXiv:0906.2614v1 (2009) (preprint)"},{"key":"66_CR3","unstructured":"Epstein, S., Levin, L.A.: Sets Have Simple Members. arXiv:1107.1458v5 (2011) (preprint)"},{"key":"66_CR4","doi-asserted-by":"publisher","first-page":"309","DOI":"10.2307\/2964290","volume":"23","author":"R. Friedberg","year":"1958","unstructured":"Friedberg, R.: Three theorems on recursive numberings. J. of Symbolic Logic\u00a023, 309\u2013316 (1958)","journal-title":"J. of Symbolic Logic"},{"key":"66_CR5","first-page":"671","volume":"32","author":"A.A. Muchnik","year":"1985","unstructured":"Muchnik, A.A.: On the basic structures of the descriptive theory of algorithms. Soviet Math. Dokl.\u00a032, 671\u2013674 (1985)","journal-title":"Soviet Math. Dokl."},{"key":"66_CR6","unstructured":"Muchnik, A.A., Mezhirov, I., Shen, A., Vereshchagin, N.: Game interpretation of Kolmogorov complexity. arXiv:1003.4712v1 (2010) (preprint)"},{"key":"66_CR7","first-page":"51","volume":"94","author":"N. Vereshchagin","year":"2008","unstructured":"Vereshchagin, N.: Kolmogorov complexity and Games. Bulletin of the European Association for Theoretical Computer Science\u00a094, 51\u201383 (2008)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"66_CR8","unstructured":"Muchnik, A.A., Vyugin, M.: Information distance for complex strings (2007) (unpublished work)"},{"key":"66_CR9","unstructured":"Shen, A.: Algorithmic Information Theory and Kolmogorov Complexity, Technical Report, Uppsala University, TR2000-034, \n                  \n                    http:\/\/www.it.uu.se\/research\/publications\/reports\/2000-034\/"},{"issue":"7","key":"66_CR10","doi-asserted-by":"publisher","first-page":"3438","DOI":"10.1109\/TIT.2010.2048491","volume":"56","author":"N.K. Vereshchagin","year":"2010","unstructured":"Vereshchagin, N.K., Vitanyi, P.M.B.: Rate Distortion and Denoising of Individual Data Using Kolmogorov Complexity. IEEE Transactions on Information Theory\u00a056(7), 3438\u20133454 (2010)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:32:40Z","timestamp":1620127960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}