{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:27:09Z","timestamp":1774420029582,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540233565","type":"print"},{"value":"9783540302155","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30215-5_19","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:15:09Z","timestamp":1285082109000},"page":"234-248","source":"Crossref","is-referenced-by-count":3,"title":["Universal Convergence of Semimeasures on Individual Random Sequences"],"prefix":"10.1007","author":[{"given":"Marcus","family":"Hutter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrej","family":"Muchnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"19_CR1","doi-asserted-by":"publisher","first-page":"2061","DOI":"10.1109\/TIT.2003.814488","volume":"49","author":"M. Hutter","year":"2003","unstructured":"Hutter, M.: Convergence and loss bounds for Bayesian sequence prediction. IEEE Transactions on Information Theory\u00a049(8), 2061\u20132067 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"19_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-39624-6_24","volume-title":"Algorithmic Learning Theory","author":"M. Hutter","year":"2003","unstructured":"Hutter, M.: On the existence and convergence of computable universal priors. In: Gavald\u00e1, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol.\u00a02842, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"19_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-540-45167-9_58","volume-title":"Learning Theory and Kernel Machines","author":"M. Hutter","year":"2003","unstructured":"Hutter, M.: An open problem regarding the convergence of universal a priori probability. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 738\u2013740. Springer, Heidelberg (2003)"},{"key":"19_CR4","series-title":"Lecture Notes in Artificial Intelligence","first-page":"506","volume-title":"Proc. 16th Annual Conf. on Learning Theory (COLT 2003)","author":"M. Hutter","year":"2003","unstructured":"Hutter, M.: Sequence prediction based on monotone complexity. In: Proc. 16th Annual Conf. on Learning Theory (COLT 2003). LNCS (LNAI), pp. 506\u2013521. Springer, Heidelberg (2003)"},{"issue":"5","key":"19_CR5","first-page":"1413","volume":"14","author":"L.A. Levin","year":"1973","unstructured":"Levin, L.A.: On the notion of a random sequence. Soviet Mathematics Doklady\u00a014(5), 1413\u20131416 (1973)","journal-title":"Soviet Mathematics Doklady"},{"key":"19_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"issue":"6","key":"19_CR7","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09(6), 602\u2013619 (1966)","journal-title":"Information and Control"},{"issue":"1-2","key":"19_CR8","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0304-3975(01)00028-7","volume":"271","author":"A.A. Muchnik","year":"2002","unstructured":"Muchnik, A.A., Positselsky, S.Y.: Kolmogorov entropy in the context of computability theory. Theoretical Computer Science\u00a0271(1-2), 15\u201335 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"19_CR9","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1142\/S0129054102001291","volume":"13","author":"J. Schmidhuber","year":"2002","unstructured":"Schmidhuber, J.: Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science\u00a013(4), 587\u2013612 (2002)","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"1-22","key":"19_CR10","doi-asserted-by":"publisher","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. Information and Control\u00a07(1-22), 224\u2013254 (1964)","journal-title":"Information and Control"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"24","author":"R.J. Solomonoff","year":"1978","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: comparisons and convergence theorems. IEEE Transaction on Information Theory, IT\u00a024, 422\u2013432 (1978)","journal-title":"IEEE Transaction on Information Theory, IT"},{"issue":"2","key":"19_CR12","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":"19_CR13","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"},{"issue":"6","key":"19_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1070\/RM1970v025n06ABEH001269","volume":"25","author":"A.K. Zvonkin","year":"1970","unstructured":"Zvonkin, A.K., Levin, L.A.: The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys\u00a025(6), 83\u2013124 (1970)","journal-title":"Russian Mathematical Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30215-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:56:35Z","timestamp":1619999795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30215-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233565","9783540302155"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30215-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}