{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:27Z","timestamp":1725686667250},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_75","type":"book-chapter","created":{"date-parts":[[2012,5,28]],"date-time":"2012-05-28T02:56:12Z","timestamp":1338173772000},"page":"745-754","source":"Crossref","is-referenced-by-count":2,"title":["Making Solomonoff Induction Effective"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Zimmermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin B.","family":"Cremers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"75_CR1","unstructured":"Arora, S., Barak, B.: Complexity Theory: A Modern Approach. Cambridge University Press (2009)"},{"key":"75_CR2","first-page":"235","volume-title":"Proceedings of the International Congress of Mathematicians","author":"H. Friedman","year":"1974","unstructured":"Friedman, H.: Some systems of second order arithmetic and their use. In: Proceedings of the International Congress of Mathematicians, Vancouver, B.C, vol.\u00a01, pp. 235\u2013242. Canad. Math. Congress, Montreal (1974)"},{"issue":"5","key":"75_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"75_CR4","doi-asserted-by":"publisher","first-page":"33","DOI":"10.2307\/2268019","volume":"9","author":"R. Goodstein","year":"1944","unstructured":"Goodstein, R.: On the restricted ordinal theorem. Journal of Symbolic Logic\u00a09, 33\u201341 (1944)","journal-title":"Journal of Symbolic Logic"},{"key":"75_CR5","doi-asserted-by":"crossref","unstructured":"Huber, F., Schmidt-Petri, C. (eds.): Degrees of Belief. Springer (2009)","DOI":"10.1007\/978-1-4020-9198-8"},{"issue":"3","key":"75_CR6","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1142\/S0129054102001199","volume":"13","author":"M. Hutter","year":"2002","unstructured":"Hutter, M.: The fastest and shortest algorithm for all well-defined problems. International Journal of Foundations of Computer Science\u00a013(3), 431\u2013443 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"75_CR7","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability. Springer (2005)"},{"key":"75_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11894841_23","volume-title":"Algorithmic Learning Theory","author":"S. Legg","year":"2006","unstructured":"Legg, S.: Is There an Elegant Universal Theory of Prediction? In: Balc\u00e1zar, J.L., Long, P.M., Stephan, F. (eds.) ALT 2006. LNCS (LNAI), vol.\u00a04264, pp. 274\u2013287. Springer, Heidelberg (2006)"},{"key":"75_CR9","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 3rd edn. Graduate Texts in Computer Science. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"key":"75_CR10","doi-asserted-by":"crossref","unstructured":"Rathjen, M.: The art of ordinal analysis. In: Proceedings of the International Congress of Mathematicians, pp. 45\u201369. Eur. Math. Soc. (2006)","DOI":"10.4171\/022-2\/3"},{"key":"75_CR11","doi-asserted-by":"crossref","unstructured":"Simpson, S.G.: Subsystems of Second Order Arithmetic, 2nd edn. Cambridge University Press (2009)","DOI":"10.1017\/CBO9780511581007"},{"issue":"1","key":"75_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference, part I. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"75_CR13","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R. Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference, part II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"key":"75_CR14","doi-asserted-by":"crossref","unstructured":"Weihrauch, K.: Computable analysis. Springer (2000)","DOI":"10.1007\/978-3-642-56999-9"},{"key":"75_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-19391-0_20","volume-title":"Rainbow of Computer Science","author":"J. Zimmermann","year":"2011","unstructured":"Zimmermann, J., Cremers, A.B.: The Quest for Uncertainty. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Maurer Festschrift. LNCS, vol.\u00a06570, pp. 270\u2013283. Springer, Heidelberg (2011)"},{"key":"75_CR16","unstructured":"Zimmermann, J., Cremers, A.B.: Proof-driven learning systems (2012) (preprint)"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T19:28:08Z","timestamp":1578511688000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_75"}},"subtitle":["Or: You Can Learn What You Can Bound"],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_75","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}