{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T21:42:16Z","timestamp":1649022136910},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,1]],"date-time":"2012-04-01T00:00:00Z","timestamp":1333238400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1007\/s00224-012-9395-2","type":"journal-article","created":{"date-parts":[[2012,3,31]],"date-time":"2012-03-31T06:53:22Z","timestamp":1333176802000},"page":"148-161","source":"Crossref","is-referenced-by-count":0,"title":["Axiomatizing Kolmogorov Complexity"],"prefix":"10.1007","volume":"52","author":[{"given":"Antoine","family":"Taveneaux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,4,1]]},"reference":[{"issue":"4","key":"9395_CR1","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G.J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences. J. ACM 13(4), 547\u2013569 (1966)","journal-title":"J. ACM"},{"key":"9395_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-68441-3","volume-title":"Algorithmic Randomness and Complexity","author":"R.G. Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)"},{"key":"9395_CR3","first-page":"3","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the definition of the concept \u201cquantity of information\u201d. Probl. Pereda. Inf. 1, 3\u201311 (1965)","journal-title":"Probl. Pereda. Inf."},{"key":"9395_CR4","unstructured":"Muchnik, A.A., Mezhirov, I., Shen, A., Vereshchagin, N.: Game interpretation of Kolmogorov complexity. Draft Version (2010)"},{"key":"9395_CR5","unstructured":"Shen, A.: Axiomatic description of the entropy notion for finite objects. In: VIII All-USSR Conference \u201cLogika i Metodologija Nauki\u201d. Vilnius (1982). Paper in Russian"},{"key":"9395_CR6","unstructured":"Uspensky, V.A., Shen, A., Vereshchagin, N.K.: Kolmogorov Complexity and Randomness. Book draft version (2010)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9395-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9395-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9395-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T07:54:23Z","timestamp":1558684463000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9395-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"alternative-id":["9395"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9395-2","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,1]]}}}