{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:11Z","timestamp":1759639091993},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319244853"},{"type":"electronic","value":"9783319244860"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24486-0_24","type":"book-chapter","created":{"date-parts":[[2015,10,3]],"date-time":"2015-10-03T17:20:50Z","timestamp":1443892850000},"page":"364-378","source":"Crossref","is-referenced-by-count":0,"title":["On the Computability of Solomonoff Induction and Knowledge-Seeking"],"prefix":"10.1007","author":[{"given":"Jan","family":"Leike","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcus","family":"Hutter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,31]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Blackwell, D., Dubins, L.: Merging of opinions with increasing information. The Annals of Mathematical Statistics, 882\u2013886 (1962)","DOI":"10.1214\/aoms\/1177704456"},{"issue":"1\u20132","key":"24_CR2","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(83)90139-1","volume":"22","author":"P G\u00e1cs","year":"1983","unstructured":"G\u00e1cs, P.: On the relation between descriptional complexity and algorithmic probability. Theoretical Computer Science 22(1\u20132), 71\u201393 (1983)","journal-title":"Theoretical Computer Science"},{"key":"24_CR3","unstructured":"Hutter, M.: A theory of universal artificial intelligence based on algorithmic complexity. Technical Report cs.AI\/0004001 (2000). \n                      http:\/\/arxiv.org\/abs\/cs.AI\/0004001"},{"issue":"4","key":"24_CR4","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1006\/jcss.2000.1743","volume":"62","author":"M Hutter","year":"2001","unstructured":"Hutter, M.: New error bounds for Solomonoff prediction. Journal of Computer and System Sciences 62(4), 653\u2013667 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"24_CR5","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions Based on Algorithmic Probability. Springer (2005)"},{"key":"24_CR6","unstructured":"Lattimore, T.: Theory of General Reinforcement Learning. PhD thesis, Australian National University (2013)"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-642-24412-4_29","volume-title":"Algorithmic Learning Theory","author":"T Lattimore","year":"2011","unstructured":"Lattimore, T., Hutter, M.: Asymptotically optimal agents. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 368\u2013382. Springer, Heidelberg (2011)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-24412-4_22","volume-title":"Algorithmic Learning Theory","author":"T Lattimore","year":"2011","unstructured":"Lattimore, T., Hutter, M., Gavane, V.: Universal prediction of selected bits. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 262\u2013276. Springer, Heidelberg (2011)"},{"key":"24_CR9","unstructured":"Leike, J., Hutter, M.: Bad universal priors and notions of optimality. In: Conference on Learning Theory (2015)"},{"key":"24_CR10","unstructured":"Leike, J., Hutter, M.: On the computability of AIXI. In: Uncertainty in Artificial Intelligence (2015)"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An Introduction to Kolmogorov Complexity and Its Applications. Texts in Computer Science, 3rd edn. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Nies, A.: Computability and Randomness. Oxford University Press (2009)","DOI":"10.1093\/acprof:oso\/9780199230761.001.0001"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-642-16108-7_28","volume-title":"Algorithmic Learning Theory","author":"L Orseau","year":"2010","unstructured":"Orseau, L.: Optimality issues of universal greedy agents with static priors. In: Hutter, M., Stephan, F., Vovk, V., Zeugmann, T. (eds.) Algorithmic Learning Theory. LNCS, vol. 6331, pp. 345\u2013359. Springer, Heidelberg (2010)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-642-24412-4_28","volume-title":"Algorithmic Learning Theory","author":"L Orseau","year":"2011","unstructured":"Orseau, L.: Universal knowledge-seeking agents. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 353\u2013367. Springer, Heidelberg (2011)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.tcs.2012.10.014","volume":"473","author":"L Orseau","year":"2013","unstructured":"Orseau, L.: Asymptotic non-learnability of universal agents with computable horizon functions. Theoretical Computer Science 473, 149\u2013156 (2013)","journal-title":"Theoretical Computer Science"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.tcs.2013.09.025","volume":"519","author":"L Orseau","year":"2014","unstructured":"Orseau, L.: Universal knowledge-seeking agents. Theoretical Computer Science 519, 127\u2013139 (2014)","journal-title":"Theoretical Computer Science"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-40935-6_12","volume-title":"Algorithmic Learning Theory","author":"L Orseau","year":"2013","unstructured":"Orseau, L., Lattimore, T., Hutter, M.: Universal knowledge-seeking agents for stochastic environments. In: Jain, S., Munos, R., Stephan, F., Zeugmann, T. (eds.) ALT 2013. LNCS, vol. 8139, pp. 158\u2013172. Springer, Heidelberg (2013)"},{"issue":"6","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1076","DOI":"10.3390\/e13061076","volume":"13","author":"S Rathmanner","year":"2011","unstructured":"Rathmanner, S., Hutter, M.: A philosophical treatise of universal induction. Entropy 13(6), 1076\u20131136 (2011)","journal-title":"Entropy"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.: A formal theory of inductive inference. Parts 1 and 2. Information and Control 7(1), 1\u201322 and 224\u2013254 (1964)","DOI":"10.1016\/S0019-9958(64)90131-7"},{"issue":"4","key":"24_CR20","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"24","author":"R Solomonoff","year":"1978","unstructured":"Solomonoff, R.: Complexity-based induction systems: Comparisons and convergence theorems. IEEE Transactions on Information Theory 24(4), 422\u2013432 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"key":"24_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/978-3-642-44958-1_33","volume-title":"Algorithmic Probability and Friends","author":"I Wood","year":"2013","unstructured":"Wood, I., Sunehag, P., Hutter, M.: (Non-)equivalence of universal priors. In: Dowe, D.L. (ed.) Solomonoff Festschrift. LNCS, vol. 7070, pp. 417\u2013425. Springer, Heidelberg (2013)"}],"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-24486-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T23:22:25Z","timestamp":1559258545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24486-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319244853","9783319244860"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24486-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}