{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:44:30Z","timestamp":1649151870876},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T00:00:00Z","timestamp":1329782400000},"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,2]]},"DOI":"10.1007\/s00224-012-9385-4","type":"journal-article","created":{"date-parts":[[2012,2,20]],"date-time":"2012-02-20T11:05:34Z","timestamp":1329735934000},"page":"297-302","source":"Crossref","is-referenced-by-count":1,"title":["An Additivity Theorem for Plain Kolmogorov Complexity"],"prefix":"10.1007","volume":"52","author":[{"given":"Bruno","family":"Bauwens","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,2,21]]},"reference":[{"issue":"3","key":"9385_CR1","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G. Chaitin","year":"1975","unstructured":"Chaitin, G.: A theory of program size formally identical to information theory. J. ACM 22(3), 329\u2013340 (1975)","journal-title":"J. ACM"},{"issue":"5","key":"9385_CR2","first-page":"1477","volume":"15","author":"P. G\u00e1cs","year":"1974","unstructured":"G\u00e1cs, P.: On the symmetry of algorithmic information. Sov. Math. Dokl. 15(5), 1477\u20131480 (1974)","journal-title":"Sov. Math. Dokl."},{"key":"9385_CR3","unstructured":"P. G\u00e1cs. Lecture notes on descriptional complexity and randomness (1988\u20132012). http:\/\/www.cs.bu.edu\/faculty\/gacs\/papers\/ait-notes.pdf"},{"issue":"1","key":"9385_CR4","first-page":"3","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Pereda. Inf. 1(1), 3\u201311 (1965)","journal-title":"Probl. Pereda. Inf."},{"issue":"5","key":"9385_CR5","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1109\/TIT.1968.1054210","volume":"IT-14","author":"A.N. Kolmogorov","year":"1968","unstructured":"Kolmogorov, A.N.: Logical basis for information theory and probability theory. IEEE Trans. Inf. Theory IT-14(5), 662\u2013664 (1968)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9385_CR6","doi-asserted-by":"crossref","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.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York (2008)"},{"key":"9385_CR7","unstructured":"Shen, A.: Algorithmic information theory and Kolmogorov complexity. Technical report TR2000-034, Uppsala University (2000)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9385-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-012-9385-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-012-9385-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:23Z","timestamp":1558698863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-012-9385-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,21]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["9385"],"URL":"https:\/\/doi.org\/10.1007\/s00224-012-9385-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,21]]}}}