{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:54:07Z","timestamp":1725753247642},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449574"},{"type":"electronic","value":"9783642449581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44958-1_33","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T14:54:01Z","timestamp":1382453641000},"page":"417-425","source":"Crossref","is-referenced-by-count":5,"title":["(Non-)Equivalence of Universal Priors"],"prefix":"10.1007","author":[{"given":"Ian","family":"Wood","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sunehag","sequence":"additional","affiliation":[]},{"given":"Marcus","family":"Hutter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. Journal of the ACM\u00a022, 329\u2013340 (1975)","journal-title":"Journal of the ACM"},{"key":"33_CR2","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-0-387-68441-3_3","volume-title":"Algorithmic Randomness and Complexity","author":"R.G. Downey","year":"2010","unstructured":"Downey, R.G., Hirschfeldt, D.R.: Kolmogorov complexity of finite strings. In: Algorithmic Randomness and Complexity, pp. 110\u2013153. Springer, New York (2010)"},{"issue":"6","key":"33_CR3","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1016\/j.jco.2006.05.001","volume":"22","author":"S. Figueira","year":"2006","unstructured":"Figueira, S., Stephan, F., Wu, G.: Randomness and universal machines. Journal of Complexity\u00a022(6), 738\u2013751 (2006)","journal-title":"Journal of Complexity"},{"key":"33_CR4","unstructured":"Hutter, M.: Universal artificial intelligence: Sequential decisions based on algorithmic probability. Springer (2005)"},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2007.05.016","volume":"384","author":"M. Hutter","year":"2007","unstructured":"Hutter, M.: On universal prediction and Bayesian confirmation. Theoretical Computer Science\u00a0384(1), 33\u201348 (2007)","journal-title":"Theoretical Computer Science"},{"key":"33_CR6","unstructured":"Levin, L.A.: Some Theorems on the Algorithmic Approach to Probability Theory and Information Theory. Phd dissertation, Moscow University, Moscow (1971)"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-0-387-49820-1"},{"issue":"4","key":"33_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/S0022-0000(73)80030-3","volume":"7","author":"C. Schnorr","year":"1973","unstructured":"Schnorr, C.: Process complexity and effective random tests. Journal of Computer and System Sciences\u00a07(4), 376\u2013388 (1973)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"33_CR9","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. parts I and II. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"4","key":"33_CR10","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 Transactions on Information Theory\u00a024(4), 422\u2013432 (1978)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"33_CR11","first-page":"230","volume":"42","author":"A. Turing","year":"1936","unstructured":"Turing, A.: On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society\u00a042(2), 230\u2013265 (1936)","journal-title":"Proceedings of the London Mathematical Society"},{"issue":"6","key":"33_CR12","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 Probability and Friends. Bayesian Prediction and Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44958-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T22:37:28Z","timestamp":1558651048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}