{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T13:48:45Z","timestamp":1743342525676},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_58","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:10:53Z","timestamp":1279840253000},"page":"738-740","source":"Crossref","is-referenced-by-count":3,"title":["An Open Problem Regarding the Convergence of Universal A Priori Probability"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Hutter","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"58_CR1","unstructured":"Hutter, M.: On the existence and convergence of computable universal priors. Technical Report IDSIA-05-03 (2003), \n                      \n                        http:\/\/arxiv.org\/abs\/cs.LG\/0305052"},{"issue":"5","key":"58_CR2","first-page":"1413","volume":"14","author":"L.A. Levin","year":"1973","unstructured":"Levin, L.A.: On the notion of a random sequence. Soviet Math. Dokl.\u00a014(5), 1413\u20131416 (1973)","journal-title":"Soviet Math. Dokl."},{"key":"58_CR3","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)","DOI":"10.1007\/978-1-4757-2606-0"},{"issue":"1-22","key":"58_CR4","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference: Part 1 and 2. Inform. Control\u00a07, 1-22, 224\u2013254 (1964)","journal-title":"Inform. Control"},{"key":"58_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"IT-24","author":"R.J. Solomonoff","year":"1978","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans. Inform. Theory\u00a0IT-24, 422\u2013432 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"58_CR6","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1109\/18.825807","volume":"46","author":"P.M.B. Vit\u00e1nyi","year":"2000","unstructured":"Vit\u00e1nyi, P.M.B., Li, M.: Minimum description length induction, Bayesianism, and Kolmogorov complexity. IEEE Transactions on Information Theory\u00a046(2), 446\u2013464 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"58_CR7","first-page":"656","volume":"35","author":"V.G. Vovk","year":"1987","unstructured":"Vovk, V.G.: On a randomness criterion. Soviet Mathematics Doklady\u00a035(3), 656\u2013660 (1987)","journal-title":"Soviet Mathematics Doklady"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_58","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T07:52:45Z","timestamp":1552809165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}