{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:40:52Z","timestamp":1725806452813},"publisher-location":"Cham","reference-count":5,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319116617"},{"type":"electronic","value":"9783319116624"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11662-4_7","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:19:18Z","timestamp":1412155158000},"page":"85-95","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Identification of Probabilities Is Hard"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Bienvenu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Monin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"7_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.tcs.2005.03.054","volume":"341","author":"P. G\u00e1cs","year":"2005","unstructured":"G\u00e1cs, P.: Uniform test of algorithmic randomness over a general space. Theoretical Computer Science\u00a0341(1-3), 91\u2013137 (2005)","journal-title":"Theoretical Computer Science"},{"key":"7_CR2","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, 3rd edn. Texts in Computer Science. Springer, New York (2008)","edition":"3"},{"key":"7_CR3","unstructured":"Vitanyi, P., Chater, N.: Algorithmic identification of probabilities (2013), \n                      \n                        http:\/\/arxiv.org\/abs\/1311.7385"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56999-9","volume-title":"Computable analysis","author":"K. Weihrauch","year":"2000","unstructured":"Weihrauch, K.: Computable analysis. Springer, Berlin (2000)"},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2008.02.021","volume":"397","author":"T. Zeugmann","year":"2008","unstructured":"Zeugmann, T., Zilles, S.: Learning recursive functions: a survey. Theoretical Computer Science\u00a0397, 4\u201356 (2008)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11662-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T01:14:12Z","timestamp":1559006052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11662-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319116617","9783319116624"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11662-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}