{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:53:48Z","timestamp":1725753228823},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_6","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T10:54:01Z","timestamp":1382439241000},"page":"79-90","source":"Crossref","is-referenced-by-count":0,"title":["The Semimeasure Property of Algorithmic Probability \u2013 \u201cFeature\u201d or \u201cBug\u201d?"],"prefix":"10.1007","author":[{"given":"Douglas","family":"Campbell","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C. Wallace","year":"1999","unstructured":"Wallace, C., Dowe, D.: Minimum message length and Kolmogorov complexity. Computer Journal\u00a042, 270\u2013283 (1999)","journal-title":"Computer Journal"},{"key":"6_CR2","unstructured":"Wallace, C.: Statistical and Inductive Inference by Minimum Message Length. Information Science and Statistics. Springer (2005)"},{"key":"6_CR3","doi-asserted-by":"crossref","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: Parts 1 and 2. Information and Control\u00a07, 1\u201322, 224\u2013254 (1964)","journal-title":"Information and Control"},{"key":"6_CR4","doi-asserted-by":"crossref","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 Trans. Infor. Theory IT-24, 422\u2013432 (1978)","journal-title":"IEEE Trans. Infor. Theory IT"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C. Wallace","year":"1968","unstructured":"Wallace, C., Boulton, D.: An information measure for classification. Computer Journal\u00a011(2), 185\u2013194 (1968)","journal-title":"Computer Journal"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0022-5193(69)90041-1","volume":"23","author":"D. Boulton","year":"1969","unstructured":"Boulton, D., Wallace, C.: The information content of a multistate distribution. J. Theoret. Biol.\u00a023, 269\u2013278 (1969)","journal-title":"J. Theoret. Biol."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1093\/comjnl\/13.1.63","volume":"13","author":"D. Boulton","year":"1970","unstructured":"Boulton, D., Wallace, C.: A program for numerical classification. The Computer Journal\u00a013(1), 63\u201369 (1970)","journal-title":"The Computer Journal"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1093\/comjnl\/16.3.254","volume":"16","author":"D. Boulton","year":"1973","unstructured":"Boulton, D., Wallace, C.: An information measure for hierarchic classification. The Computer Journal\u00a016(3), 254\u2013261 (1973)","journal-title":"The Computer Journal"},{"issue":"3","key":"6_CR9","first-page":"11","volume":"3","author":"C. Wallace","year":"1975","unstructured":"Wallace, C., Boulton, D.: An invariant Bayes method for point estimation. Classification Society Bull.\u00a03(3), 11\u201334 (1975)","journal-title":"Classification Society Bull."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1093\/comjnl\/18.3.236","volume":"18","author":"D. Boulton","year":"1975","unstructured":"Boulton, D., Wallace, C.: An information measure for single-link classification. The Computer Journal\u00a018(3), 236\u2013238 (1975)","journal-title":"The Computer Journal"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Dowe, D.L.: MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Bandyopadhyay, P., Forster, M. (eds.) Philosophy of Statistics. Handbook of the Philosophy of Science, vol.\u00a07, Elsevier (2011)","DOI":"10.1016\/B978-0-444-51862-0.50030-7"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer (1997)","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"6_CR13","first-page":"566","volume":"51","author":"R. Solomonoff","year":"2008","unstructured":"Solomonoff, R.: Three kinds of probabilistic induction: universal distributions and convergence theorems. The Computer Journal: Christopher Stewart Wallace (1933-2004); Memorial Special Issue\u00a051, 566\u2013570 (2008)","journal-title":"Memorial Special Issue"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1093\/comjnl\/46.6.598","volume":"46","author":"R. Solomonoff","year":"2003","unstructured":"Solomonoff, R.: The Kolmogorov lecture: The universal distribution and machine learning. Computer Journal\u00a046, 598\u2013601 (2003)","journal-title":"Computer Journal"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.1997.1500","volume":"55","author":"R. Solomonoff","year":"1997","unstructured":"Solomonoff, R.: The discovery of algorithmic probability. Journal of Computer and System Sciences\u00a055, 73\u201388 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR16","unstructured":"Solomonoff, R.: Does algorithmic probability solve the problem of induction? Technical Report (1997)"},{"key":"6_CR17","unstructured":"Hutter, M.: On generalized computable universal priors and their convergence, IDSIA-05-05 (2005)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ipl.2007.11.018","volume":"106","author":"R. Solomonoff","year":"2008","unstructured":"Solomonoff, R.: The probability of \u201cundefined\u201d (non-converging) output in generating the universal probability distribution. Inf. Process. Lett.\u00a0106, 238\u2013240 (2008)","journal-title":"Inf. Process. Lett."}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T18:35:01Z","timestamp":1558636501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}