{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:53:43Z","timestamp":1725753223761},"publisher-location":"Berlin, Heidelberg","reference-count":29,"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_34","type":"book-chapter","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T14:54:01Z","timestamp":1382453641000},"page":"426-438","source":"Crossref","is-referenced-by-count":0,"title":["A Syntactic Approach to Prediction"],"prefix":"10.1007","author":[{"given":"John","family":"Woodward","sequence":"first","affiliation":[]},{"given":"Jerry","family":"Swan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00453-008-9244-5","volume":"57","author":"A. Auger","year":"2010","unstructured":"Auger, A., Teytaud, O.: Continuous lunches are free plus the design of optimal optimization algorithms. Algorithmica\u00a057(1), 121\u2013146 (2010)","journal-title":"Algorithmica"},{"key":"34_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of information theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of information theory. Wiley-Interscience, New York (1991)"},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1023\/A:1009868929893","volume":"3","author":"P. Domingos","year":"1999","unstructured":"Domingos, P.: The role of occam\u2019s razor in knowledge discovery. Data Min. Knowl. Discov.\u00a03(4), 409\u2013425 (1999)","journal-title":"Data Min. Knowl. Discov."},{"key":"34_CR4","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 (2011)","DOI":"10.1016\/B978-0-444-51862-0.50030-7"},{"key":"34_CR5","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley-Interscience (November 2000)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Holte, R.C.: Very simple classification rules perform well on most commonly used datasets. In: Machine Learning, pp. 63\u201391 (1993)","DOI":"10.1023\/A:1022631118932"},{"issue":"7","key":"34_CR7","first-page":"360","volume":"3","author":"M. Hutter","year":"2010","unstructured":"Hutter, M.: A complete theory of everything (will be subjective). Algorithms\u00a03(7), 360\u2013374 (2010)","journal-title":"Algorithms"},{"key":"34_CR8","unstructured":"Hutter, M.: Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability, 300 pages. Springer, Berlin (2004), \n                    \n                      http:\/\/www.idsia.ch\/~marcus\/ai\/uaibook.htm"},{"key":"34_CR9","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to computational learning theory","author":"M.J. Kearns","year":"1994","unstructured":"Kearns, M.J., Vazirani, U.V.: An introduction to computational learning theory. MIT Press, Cambridge (1994)"},{"key":"34_CR10","volume-title":"Genetic Programming II: Automatic Discovery of Reusable Programs","author":"J.R. Koza","year":"1994","unstructured":"Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Programs. The MIT Press, Cambridge (1994)"},{"issue":"1","key":"34_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10710-008-9065-y","volume":"10","author":"W.B. Langdon","year":"2009","unstructured":"Langdon, W.B.: Scaling of program functionality. Genetic Programming and Evolvable Machines\u00a010(1), 5\u201336 (2009)","journal-title":"Genetic Programming and Evolvable Machines"},{"issue":"4","key":"34_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1162\/evco.1999.7.4.399","volume":"7","author":"B. William","year":"1999","unstructured":"William, B.: Langdon. Scaling of program fitness spaces. Evolutionary Computation\u00a07(4), 399\u2013428 (1999)","journal-title":"Evolutionary Computation"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Li, M., Vit\u00e1nyi, P.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer-Verlag New York, Inc., Secaucus (1997)","DOI":"10.1007\/978-1-4757-2606-0"},{"key":"34_CR14","volume-title":"Machine Learning","author":"T.M. Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Murphy, P.M., Pazzani, M.J.: Exploring the decision forest: An empirical investigation of occams razor in decision tree induction. Journal of Artificial Intelligence Research, 257\u2013275 (1994)","DOI":"10.1613\/jair.41"},{"key":"34_CR16","unstructured":"Needham, S.L., Dowe, D.L.: Message length as an effective ockham\u2019s razor in decision tree induction. In: Proc. 8th International Workshop on Artificial Intelligence and Statistics (AI+STATS 2001), Key West, Florida, U.S.A., pp. 253\u2013260 (January 2001)"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"Poli, R., Graff, M., McPhee, N.F.: Free lunches for function and program induction. In: Proceedings of the Tenth ACM SIGEVO Workshop on Foundations of Genetic Algorithms (FOGA 2009), Orlando, Florida, USA, January 9-11, pp. 183\u2013194. ACM (2009)","DOI":"10.1145\/1527125.1527148"},{"key":"34_CR18","unstructured":"Rogers, H.: Theory of recursive functions and effective computability. McGraw-Hill series in higher mathematics. MIT Press (1987)"},{"key":"34_CR19","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson Education (2003)"},{"key":"34_CR20","doi-asserted-by":"crossref","unstructured":"Schaffer, C.: A conservation law for generalization performance. In: Proceedings of the Eleventh International Conference on Machine Learning, pp. 259\u2013265. Morgan Kaufmann (1994)","DOI":"10.1016\/B978-1-55860-335-6.50039-8"},{"key":"34_CR21","first-page":"257","volume-title":"The Dartmouth Artificial Intelligence Conference, AI@50","author":"R. Solomonoff","year":"2006","unstructured":"Solomonoff, R.: Machine learning - past and future. In: The Dartmouth Artificial Intelligence Conference, AI@50, pp. 257\u2013275. Dartmouth, N.H. (2006)"},{"issue":"1","key":"34_CR22","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":"34_CR23","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":"34_CR24","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. Computer Journal\u00a042, 270\u2013283 (1999)","journal-title":"Computer Journal"},{"key":"34_CR25","unstructured":"Webb: Generality is more significant than complexity: Toward an alternative to occam\u2019s razor. In: Australian Joint Conference on Artificial Intelligence (AJCAI) (1994)"},{"key":"34_CR26","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe, NM (1995)"},{"issue":"1","key":"34_CR27","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D.H. Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G.: No free lunch theorems for optimization. IEEE Transactions on Evolutionary Computation\u00a01(1), 67\u201382 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"34_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11729976_23","volume-title":"Genetic Programming","author":"J.R. Woodward","year":"2006","unstructured":"Woodward, J.R.: Complexity and cartesian genetic programming. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol.\u00a03905, pp. 260\u2013269. Springer, Heidelberg (2006)"},{"key":"34_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/11729976_28","volume-title":"Genetic Programming","author":"J.R. Woodward","year":"2006","unstructured":"Woodward, J.R.: Invariance of function complexity under primitive recursive functions. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol.\u00a03905, pp. 310\u2013319. Springer, Heidelberg (2006)"}],"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_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T22:33:44Z","timestamp":1558650824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-44958-1_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449574","9783642449581"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44958-1_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}