{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T09:03:50Z","timestamp":1754557430584,"version":"3.37.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319416489"},{"type":"electronic","value":"9783319416496"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41649-6_4","type":"book-chapter","created":{"date-parts":[[2016,6,25]],"date-time":"2016-06-25T19:40:33Z","timestamp":1466883633000},"page":"33-42","source":"Crossref","is-referenced-by-count":3,"title":["Ultimate Intelligence Part II: Physical Complexity and Limits of Inductive Inference Systems"],"prefix":"10.1007","author":[{"given":"Eray","family":"\u00d6zkural","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,25]]},"reference":[{"key":"4_CR1","unstructured":"Bennett, C.H.: Logical depth and physical complexity. In: Herkin, R. (ed.) The Universal Turing Machine: A Half-Century Survey, pp. 227\u2013257 (1988). citeseer.ist.psu.edu\/bennet88logical.html"},{"issue":"3","key":"4_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF01857726","volume":"21","author":"HJ Bremermann","year":"1982","unstructured":"Bremermann, H.J.: Minimum energy requirements of information transfer and computing. Int. J. Theor. Phy. 21(3), 203\u2013217 (1982). http:\/\/dx.doi.org\/10.1007\/BF01857726","journal-title":"Int. J. Theor. Phy."},{"key":"4_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471667196.ess0029","volume-title":"Algorithmic Information Theory","author":"GJ Chaitin","year":"2004","unstructured":"Chaitin, G.J.: Algorithmic Information Theory. Cambridge University Press, New York (2004)"},{"issue":"3","key":"4_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1147\/rd.53.0183","volume":"5","author":"R Landauer","year":"1961","unstructured":"Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183\u2013191 (1961). http:\/\/dx.doi.org\/10.1147\/rd.53.0183","journal-title":"IBM J. Res. Dev."},{"key":"4_CR5","unstructured":"Levin, L.A.: Some theorems on the algorithmic approach to probability theory and information theory. CoRR abs\/1009.5894 (2010)"},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1038\/35023282","volume":"406","author":"S Lloyd","year":"2000","unstructured":"Lloyd, S.: Ultimate physical limits to computation. Nature 406, 1047\u20131054 (2000)","journal-title":"Nature"},{"issue":"23","key":"4_CR7","doi-asserted-by":"crossref","first-page":"237901","DOI":"10.1103\/PhysRevLett.88.237901","volume":"88","author":"S Lloyd","year":"2002","unstructured":"Lloyd, S.: Computational capacity of the universe. Phys. Rev. Lett. 88(23), 237901 (2002)","journal-title":"Phys. Rev. Lett."},{"key":"4_CR8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0167-2789(98)00054-2","volume":"120","author":"N Margolus","year":"1998","unstructured":"Margolus, N., Levitin, L.B.: The maximum speed of dynamical evolution. Physica D Nonlinear Phenomena 120, 188\u2013195 (1998)","journal-title":"Physica D Nonlinear Phenomena"},{"key":"4_CR9","unstructured":"Miller, D.B., Fredkin, E.: Two-state, reversible, universal cellular automata in three dimensions. In: Proceedings of the 2nd Conference on Computing Frontiers, CF 2005, pp. 45\u201351 (2005). http:\/\/doi.acm.org\/10.1145\/1062261.1062271"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/978-3-642-27660-6_32","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"T Neary","year":"2012","unstructured":"Neary, T., Woods, D.: The complexity of small universal turing machines: a survey. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol. 7147, pp. 385\u2013405. Springer, Heidelberg (2012)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6830, pp. 382\u2013387. Springer, Heidelberg (2011)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-642-44958-1_22","volume-title":"Algorithmic Probability and Friends","author":"E \u00d6zkural","year":"2013","unstructured":"\u00d6zkural, E.: Diverse consequences of algorithmic probability. In: Dowe, D.L. (ed.) Solomonoff Festschrift. LNCS, vol. 7070, pp. 285\u2013298. Springer, Heidelberg (2013)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/978-3-319-21365-1_14","volume-title":"Artificial General Intelligence","author":"E \u00d6zkural","year":"2015","unstructured":"\u00d6zkural, E.: Ultimate Intelligence part I: physical completeness and objectivity of induction. In: Bieger, J., Goertzel, B., Potapov, A. (eds.) AGI 2015. LNCS, vol. 9205, pp. 131\u2013141. Springer, Heidelberg (2015)"},{"key":"4_CR14","doi-asserted-by":"crossref","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. Mach. Learn. 54, 211\u2013256 (2004)","journal-title":"Mach. Learn."},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-45435-7_15","volume-title":"Computational Learning Theory","author":"J Schmidhuber","year":"2002","unstructured":"Schmidhuber, J.: The Speed Prior: a new simplicity measure yielding near-optimal computable predictions. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol. 2375, pp. 216\u2013228. Springer, Heidelberg (2002)"},{"key":"4_CR16","unstructured":"Solomonoff, R.: Perfect training sequences and the costs of corruption - a progress report on inductive inference research. Technical report, Oxbridge Research (Aug 1982)"},{"issue":"1","key":"4_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference, part i. Inform. Control 7(1), 1\u201322 (1964)","journal-title":"Inform. Control"},{"issue":"2","key":"4_CR18","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"RJ Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference, part ii. Inform. Control 7(2), 224\u2013254 (1964)","journal-title":"Inform. Control"},{"issue":"4","key":"4_CR19","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TIT.1978.1055913","volume":"24","author":"RJ Solomonoff","year":"1978","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: comparisons and convergence theorems. IEEE Trans. Inform. Theor. IT 24(4), 422\u2013432 (1978)","journal-title":"IEEE Trans. Inform. Theor. IT"},{"key":"4_CR20","unstructured":"Solomonoff, R.J.: A system for incremental learning based on algorithmic probability. In: Proceedings of the Sixth Israeli Conference on Artificial Intelligence, pp. 515\u2013527. Tel Aviv, Israel., December 1989"},{"key":"4_CR21","unstructured":"Solomonoff, R.J.: Progress in incremental machine learning. Technical report IDSIA-16-03, IDSIA, Lugano, Switzerland (2003)"},{"issue":"5","key":"4_CR22","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1093\/comjnl\/bxm120","volume":"51","author":"RJ Solomonoff","year":"2008","unstructured":"Solomonoff, R.J.: Three kinds of probabilistic induction: universal distributions and convergence theorems. Comput. J. 51(5), 566\u2013570 (2008)","journal-title":"Comput. J."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Algorithmic probability, heuristic programming and AGI. In: Third Conference on Artificial General Intelligence, pp. 251\u2013157 (2010)","DOI":"10.2991\/agi.2010.13"}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41649-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:09:31Z","timestamp":1498309771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41649-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319416489","9783319416496"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41649-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}