{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:53:55Z","timestamp":1725753235672},"publisher-location":"Berlin, Heidelberg","reference-count":46,"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_22","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T10:54:01Z","timestamp":1382439241000},"page":"285-298","source":"Crossref","is-referenced-by-count":1,"title":["Diverse Consequences of Algorithmic Probability"],"prefix":"10.1007","author":[{"given":"Eray","family":"\u00d6zkural","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Solomonoff, R.J.: Progress in incremental machine learning. Technical Report IDSIA-16-03, IDSIA, Lugano, Switzerland (2003)"},{"key":"22_CR2","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. J. ACM\u00a022, 329\u2013340 (1975)","journal-title":"J. ACM"},{"key":"22_CR3","unstructured":"Solomonoff, R.J.: An inductive inference machine. Dartmouth Summer Research Project on Artificial Intelligence (1956) A Privately Circulated Report"},{"key":"22_CR4","unstructured":"Solomonoff, R.J.: An inductive inference machine. In: IRE National Convention Record, Section on Information Theory, Part 2, New York, USA, pp. 56\u201362 (1957)"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference, part i. Information and Control\u00a07(1), 1\u201322 (1964)","journal-title":"Information and Control"},{"issue":"2","key":"22_CR6","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 ii. Information and Control\u00a07(2), 224\u2013254 (1964)","journal-title":"Information and Control"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Three kinds of probabilistic induction: Universal distributions and convergence theorems. The Computer Journal\u00a051(5), 566\u2013570 (2008); Christopher Stewart Wallace, memorial special issue (1933-2004)","DOI":"10.1093\/comjnl\/bxm120"},{"issue":"3","key":"22_CR8","first-page":"265","volume":"9","author":"L.A. Levin","year":"1973","unstructured":"Levin, L.A.: Universal sequential search problems. Problems of Information Transmission\u00a09(3), 265\u2013266 (1973)","journal-title":"Problems of Information Transmission"},{"key":"22_CR9","unstructured":"Solomonoff, R.J.: Algorithmic probability: Theory and applications. In: Dehmer, M., Emmert-Streib, F. (eds.) Information Theory and Statistical Learning, pp. 1\u201323. Springer Science+Business Media, N.Y. (2009)"},{"issue":"4","key":"22_CR10","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"IT-24","author":"R.J. Solomonoff","year":"1978","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: Comparisons and convergence theorems. IEEE Trans. on Information Theory\u00a0IT-24(4), 422\u2013432 (1978)","journal-title":"IEEE Trans. on Information Theory"},{"key":"22_CR11","unstructured":"Solomonoff, R.J.: Optimum sequential search. Technical report, Oxbridge Research, Cambridge, Mass., USA (1984)"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Algorithmic Probability \u2013 Its Discovery \u2013 Its Properties and Application to Strong AI. In: Randomness Through Computation: Some Answers, More Questions, pp. 149\u2013157. World Scientific Publishing Company (2011)","DOI":"10.1142\/9789814327756_0011"},{"key":"22_CR13","unstructured":"Solomonoff, R.J.: A system for incremental learning based on algorithmic probability. In: Proceedings of the Sixth Israeli Conference on Artificial Intelligence, Tel Aviv, Israel, pp. 515\u2013527 (1989)"},{"issue":"6","key":"22_CR14","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\u00a013(6), 1076\u20131136 (2011)","journal-title":"Entropy"},{"key":"22_CR15","unstructured":"Davis, M.: The Universal Computer: The Road from Leibniz to Turing. W. W. Norton & Company (2000)"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","volume":"s2-42","author":"A.M. Turing","year":"1937","unstructured":"Turing, A.M.: On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society\u00a0s2-42(1), 230\u2013265 (1937)","journal-title":"Proceedings of the London Mathematical Society"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Dowe, D.L.: MML, hybrid Bayesian network graphical models, statistical consistency, invariance and uniqueness. In: Handbook of the Philosophy of Science (HPS ). Philosophy of Statistics, vol.\u00a07, pp. 901\u2013982. Elsevier (2011)","DOI":"10.1016\/B978-0-444-51862-0.50030-7"},{"issue":"2","key":"22_CR18","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1093\/comjnl\/11.2.185","volume":"11","author":"C.S. Wallace","year":"1968","unstructured":"Wallace, C.S., Boulton, D.M.: A information measure for classification. Computer Journal\u00a011(2), 185\u2013194 (1968)","journal-title":"Computer Journal"},{"key":"22_CR19","volume-title":"Statistical and Inductive Inference by Minimum Message Length","author":"C.S. Wallace","year":"2005","unstructured":"Wallace, C.S.: Statistical and Inductive Inference by Minimum Message Length. Springer, Berlin (2005)"},{"key":"22_CR20","first-page":"699","volume-title":"The minimum description length principle in coding and modeling (invited paper)","author":"A. Barron","year":"2000","unstructured":"Barron, A., Rissanen, J., Yu, B.: The minimum description length principle in coding and modeling (invited paper), pp. 699\u2013716. IEEE Press, Piscataway (2000)"},{"key":"22_CR21","unstructured":"Vapnik, V.: Statistical Learning Theory. John Wiley and Sons, NY (1998)"},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1093\/bjps\/axm033","volume":"58","author":"D.L. Dowe","year":"2007","unstructured":"Dowe, D.L., Gardner, S., Oppy, G.: Bayes not bust! why simplicity is no problem for bayesians. The British Journal for the Philosophy of Science\u00a058(4), 709\u2013754 (2007)","journal-title":"The British Journal for the Philosophy of Science"},{"issue":"4","key":"22_CR23","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"C.S. Wallace","year":"1999","unstructured":"Wallace, C.S., Dowe, D.L.: Minimum message length and kolmogorov complexity. The Computer Journal\u00a042(4), 270\u2013283 (1999)","journal-title":"The Computer Journal"},{"issue":"18","key":"22_CR24","doi-asserted-by":"publisher","first-page":"1508","DOI":"10.1016\/j.artint.2010.09.006","volume":"174","author":"J. Hernndez-Orallo","year":"2010","unstructured":"Hernndez-Orallo, J., Dowe, D.L.: Measuring universal intelligence: Towards an anytime intelligence test. Artificial Intelligence\u00a0174(18), 1508\u20131539 (2010)","journal-title":"Artificial Intelligence"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-22887-2_47","volume-title":"Artificial General Intelligence","author":"E. \u00d6zkural","year":"2011","unstructured":"\u00d6zkural, E.: Towards heuristic algorithmic memory. In: Schmidhuber, J., Th\u00f3risson, K.R., Looks, M. (eds.) AGI 2011. LNCS, vol.\u00a06830, pp. 382\u2013387. Springer, Heidelberg (2011)"},{"key":"22_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/B:MACH.0000015880.99707.b2","volume":"54","author":"J. Schmidhuber","year":"2004","unstructured":"Schmidhuber, J.: Optimal ordered problem solver. Machine Learning\u00a054, 211\u2013256 (2004)","journal-title":"Machine Learning"},{"key":"22_CR27","unstructured":"Kelsey, R., Clinger, W., Rees, J.: Revised5 report on the algorithmic language scheme. Higher-Order and Symbolic Computation\u00a011(1) (1998)"},{"key":"22_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0004-3702(94)00042-Y","volume":"74","author":"J.R. Olsson","year":"1995","unstructured":"Olsson, J.R.: Inductive functional programming using incremental program transformation. Artificial Intelligence\u00a074, 55\u201383 (1995)","journal-title":"Artificial Intelligence"},{"key":"22_CR29","unstructured":"Muggleton, S., Page, C.: A learnability model for universal representations. In: Proceedings of the 4th International Workshop on Inductive Logic Programming, vol.\u00a0237, pp. 139\u2013160. Citeseer (1994)"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/3-540-44716-4_15","volume-title":"Functional and Logic Programming","author":"C. Ferri-Ram\u00edrez","year":"2001","unstructured":"Ferri-Ram\u00edrez, C., Hern\u00e1ndez-Orallo, J., Ram\u00edrez-Quintana, M.J.: Incremental learning of functional logic programs. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol.\u00a02024, pp. 233\u2013247. Springer, Heidelberg (2001)"},{"key":"22_CR31","unstructured":"Bowers, A., Giraud-Carrier, C., Lloyd, J., Sa, E.: A knowledge representation framework for inductive learning (2001)"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-11931-6_3","volume-title":"Approaches and Applications of Inductive Programming","author":"E. Kitzelmann","year":"2010","unstructured":"Kitzelmann, E.: Inductive programming: A survey of program synthesis techniques. In: Schmid, U., Kitzelmann, E., Plasmeijer, R. (eds.) AAIP 2009. LNCS, vol.\u00a05812, pp. 50\u201373. Springer, Heidelberg (2010)"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Looks, M.: Scalable estimation-of-distribution program evolution. In: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (2007)","DOI":"10.1145\/1276958.1277072"},{"key":"22_CR34","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-68677-4_8","volume-title":"Artificial General Intelligence. Cognitive Technologies","author":"M. Hutter","year":"2007","unstructured":"Hutter, M.: Universal algorithmic intelligence: A mathematical top\u2192down approach. In: Goertzel, B., Pennachin, C. (eds.) Artificial General Intelligence. Cognitive Technologies, pp. 227\u2013290. Springer, Heidelberg (2007)"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Goertzel, B.: Opencogprime: A cognitive synergy based architecture for artificial general intelligence. In: Baciu, G., Wang, Y., Yao, Y., Kinsner, W., Chan, K., Zadeh, L.A. (eds.) IEEE ICCI, pp. 60\u201368. IEEE Computer Society (2009)","DOI":"10.1109\/COGINF.2009.5250807"},{"issue":"2","key":"22_CR36","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s12559-009-9014-y","volume":"1","author":"J. Schmidhuber","year":"2009","unstructured":"Schmidhuber, J.: Ultimate cognition \u00e0 la G\u00f6del. Cognitive Computation\u00a01(2), 177\u2013193 (2009)","journal-title":"Cognitive Computation"},{"key":"22_CR37","unstructured":"Solomonoff, R.J.: Machine learning - past and future. In: The Dartmouth Artificial Intelligence Conference, pp. 13\u201315 (2006)"},{"issue":"1","key":"22_CR38","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1006\/jcss.1997.1500","volume":"55","author":"R.J. Solomonoff","year":"1997","unstructured":"Solomonoff, R.J.: The discovery of algorithmic probability. Journal of Computer and System Sciences\u00a055(1), 73\u201388 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR39","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1023\/A:1003613131948","volume":"39","author":"D. Bridges","year":"2000","unstructured":"Bridges, D., Svozil, K.: Constructive mathematics and quantum physics. International Journal of Theoretical Physics\u00a039, 503\u2013515 (2000)","journal-title":"International Journal of Theoretical Physics"},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"\u00d6zkural, E.: A compromise between reductionism and non-reductionism. In: Worldviews, Science and Us: Philosophy and Complexity. World Scientific Books (2007)","DOI":"10.1142\/9789812707420_0018"},{"key":"22_CR41","doi-asserted-by":"publisher","first-page":"20","DOI":"10.2307\/2181906","volume":"60","author":"W. Quine","year":"1951","unstructured":"Quine, W.: Two dogmas of empiricism. The Philosophical Review\u00a060, 20\u201343 (1951)","journal-title":"The Philosophical Review"},{"key":"22_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45066-1_1","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"G.J. Chaitin","year":"2003","unstructured":"Chaitin, G.J.: Two philosophical applications of algorithmic information theory. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 1\u201310. Springer, Heidelberg (2003)"},{"key":"22_CR43","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/HSM-1985-5207","volume":"5","author":"R.J. Solomonoff","year":"1985","unstructured":"Solomonoff, R.J.: The time scale of artificial intelligence: Reflections on social effects. Human Systems Management\u00a05, 149\u2013153 (1985)","journal-title":"Human Systems Management"},{"key":"22_CR44","unstructured":"Glaskowsk, P.N.: Nvidia\u2019s fermi: The first complete gpu computing architecture (2009)"},{"key":"22_CR45","unstructured":"Sandberg, A., Bostrom, N.: Whole brain emulation: A roadmap. Technical report, Future of Humanity Institute, Oxford University (2008)"},{"key":"22_CR46","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1109\/MAHC.2010.28","volume":"33","author":"J.G. Koomey","year":"2011","unstructured":"Koomey, J.G., Berard, S., Sanchez, M., Wong, H.: Implications of historical trends in the electrical efficiency of computing. IEEE Annals of the History of Computing\u00a033, 46\u201354 (2011)","journal-title":"IEEE Annals of the History of Computing"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T05:40:25Z","timestamp":1596692425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}