{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:36:25Z","timestamp":1694633785312},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,29]],"date-time":"2008-07-29T00:00:00Z","timestamp":1217289600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2009,3]]},"DOI":"10.1007\/s10710-008-9065-y","type":"journal-article","created":{"date-parts":[[2008,7,28]],"date-time":"2008-07-28T20:00:05Z","timestamp":1217275205000},"page":"5-36","source":"Crossref","is-referenced-by-count":4,"title":["Scaling of program functionality"],"prefix":"10.1007","volume":"10","author":[{"given":"W. B.","family":"Langdon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,7,29]]},"reference":[{"key":"9065_CR1","doi-asserted-by":"crossref","unstructured":"D.H. Wolpert, W.G. Macready, No free lunch theorems for optimization. IEEE Trans. Evolut. Comput. 1(1), 67\u201382 (1997)","DOI":"10.1109\/4235.585893"},{"issue":"2","key":"9065_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1011516717456","volume":"2","author":"J.A. Foster","year":"2001","unstructured":"J.A. Foster, Review: discipulus: a commercial genetic programming system. Genet. Prog. Evol. Mach. 2(2), 201\u2013203 (2001). doi: 10.1023\/A:1011516717456","journal-title":"Genet. Prog. Evol. Mach."},{"key":"9065_CR3","doi-asserted-by":"crossref","unstructured":"C.M. Reidys, P.F. Stadler, Combinatorial landscapes. SIAM Rev. 44(1), 3\u201354. doi: 10.1137\/S0036144501395952","DOI":"10.1137\/S0036144501395952"},{"key":"9065_CR4","doi-asserted-by":"crossref","unstructured":"W.B. Langdon, R. Poli, Foundations of Genetic Programming (Springer, 2002)","DOI":"10.1007\/978-3-662-04726-2"},{"key":"9065_CR5","unstructured":"W.B. Langdon, Convergence rates for the distribution of program outputs, in GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, New York, 9\u201313 July 2002, ed. by W.B. Langdon, E. Cant\u00fa-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M.A. Potter, A.C. Schultz, J.F. Miller, E. Burke, N. Jonoska, pp. 812\u2013819"},{"key":"9065_CR6","unstructured":"W.B. Langdon, How many good programs are there? How long are they? in Foundations of Genetic Algorithms VII, Torremolinos, Spain, 4\u20136 September 2002, ed. by K.A. De Jong, R. Poli, J.E. Rowe (Morgan Kaufmann, 2002), pp. 183\u2013202"},{"key":"9065_CR7","doi-asserted-by":"crossref","unstructured":"W.B. Langdon, Mapping non-conventional extensions of genetic programming, in Unconventional Computing 2006, vol. 4135. LNCS, ed. by C.S. Calude, M.J. Dinneen, G. Paun, G. Rozenberg, S. Stepney (Springer, York, 4\u20138 September 2006), pp. 166\u2013180, doi: 10.1007\/11839132_14","DOI":"10.1007\/11839132_14"},{"key":"9065_CR8","unstructured":"W. Banzhaf, P. Nordin, R.E. Keller, F.D. Francone, Genetic Programming\u2014An Introduction; On the Automatic Evolution of Computer Programs and its Applications (Morgan Kaufmann, San Francisco, 1998)"},{"key":"9065_CR9","unstructured":"W. Banzhaf, Challenging the program counter, in The Grand Challenge in Non-Classical Computation: International Workshop, York, UK, 18\u201319 April 2005, ed. by S. Stepney, S. Emmott"},{"key":"9065_CR10","unstructured":"W. Feller, An Introduction to Probability Theory and Its Applications, 2nd ed., vol. 1 (John Wiley and Sons, New York, 1957)"},{"key":"9065_CR11","volume-title":"An Introduction to Probability Theory and Its Applications","author":"W. Feller","year":"1966","unstructured":"W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2. (John Wiley and Sons, New York, 1966)"},{"key":"9065_CR12","doi-asserted-by":"crossref","unstructured":"O. Haggstrom, Finite Markov Chains and Algorithmic Applications, vol. 52. London Mathematical Society Student Texts. (Cambridge University Press, Cambridge, 2002)","DOI":"10.1017\/CBO9780511613586"},{"key":"9065_CR13","unstructured":"P. Diaconis, Group Representations in Probability and Statistics, vol. 11. Lecture notes-Monograph Series. (Institute of Mathematical Sciences, Hayward, California, 1988)"},{"issue":"3","key":"9065_CR14","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1137\/1037083","volume":"37","author":"JS Rosenthal","year":"1995","unstructured":"J.S. Rosenthal, Convergence rates for Markov chains. SIAM Rev. 37(3), 387\u2013405 (1995)","journal-title":"SIAM Rev."},{"key":"9065_CR15","doi-asserted-by":"crossref","unstructured":"D. Stirzaker, Probability and Random Variables A Beginner\u2019s Guide (Cambridge University Press, Cambridge, 1999)","DOI":"10.1017\/CBO9780511813627"},{"key":"9065_CR16","unstructured":"P. Nordin, Evolutionary Program Induction of Binary Machine Code and its Applications. PhD thesis, der Universitat Dortmund am Fachereich Informatik (1997)"},{"key":"9065_CR17","doi-asserted-by":"crossref","unstructured":"J.G. Propp, D.B. Wilson, Exact sampling with coupled markov chains and applications to statistical mechanics. Random Struct Algorithms 9(1 & 2), 223\u2013252 (1996)","DOI":"10.1002\/(SICI)1098-2418(199608\/09)9:1\/2<223::AID-RSA14>3.0.CO;2-O"},{"key":"9065_CR18","doi-asserted-by":"crossref","unstructured":"W.B. Langdon, The distribution of reversible functions is Normal, in Genetic Programming Theory and Practise, Chap. 11, ed. by R.L. Riolo, B. Worzel, (Kluwer, 2003), pp. 173\u2013188","DOI":"10.1007\/978-1-4419-8983-3_11"},{"key":"9065_CR19","doi-asserted-by":"crossref","unstructured":"P.G. Bishop, Using reversible computing to achieve fail-safety, in Proceedings of the Eighth International Symposium On Software Reliability Engineering, Albuquerque, NM, USA, 2\u20135 Nov 1997 (IEEE Press, 1997), pp. 182\u2013191","DOI":"10.1109\/ISSRE.1997.630863"},{"key":"9065_CR20","doi-asserted-by":"crossref","unstructured":"T. B\u00e4ck, Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms (Oxford University Press, New York, 1996)","DOI":"10.1093\/oso\/9780195099713.001.0001"},{"issue":"2","key":"9065_CR21","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/evco.1999.7.2.173","volume":"7","author":"J Garnier","year":"1999","unstructured":"J. Garnier, L. Kallel, M. Schoenauer, Rigorous hitting times for binary mutations. Evol. Comput. 7(2), 173\u2013203 (1999)","journal-title":"Evol. Comput."},{"key":"9065_CR22","unstructured":"Y. Gao, An upper bound on the convergence rates of canonical genetic algorithms. Complex. Int. 5 (1998)"},{"key":"9065_CR23","unstructured":"T. Blickle, Theory of Evolutionary Algorithms and Application to System Synthesis. PhD thesis, Swiss Federal Institute of Technology, Zurich (November 1996)"},{"key":"9065_CR24","unstructured":"W.B. Langdon, T. Soule, R. Poli, J.A. Foster, The evolution of size and shape, in Advances in Genetic Programming 3, Chap. 13, ed. by L. Spector, W.B. Langdon, U.-M. O\u2019Reilly, P.J. Angeline (MIT Press, 1999), pp. 163\u2013190"},{"key":"9065_CR25","doi-asserted-by":"crossref","unstructured":"W.B. Langdon, Genetic Programming and Data Structures. (Kluwer, Boston, 1998)","DOI":"10.1007\/978-1-4615-5731-9"},{"key":"9065_CR26","unstructured":"A. Teller, Genetic programming, indexed memory, the halting problem, and other curiosities, in Proceedings of the 7th annual Florida Artificial Intelligence Research Symposium, Pensacola, Florida, USA, May 1994 (IEEE Press, 1994), pp. 270\u2013274"},{"key":"9065_CR27","unstructured":"F.D. Francone, Discipulus Owner\u2019s Manual. 11757 W. Ken Caryl Avenue F, PBM 512, Littleton, Colorado, 80127-3719, USA, version 3.0 draft edition, 2001%"},{"key":"9065_CR28","doi-asserted-by":"crossref","unstructured":"W.B. Langdon, P. Nordin, Evolving hand-eye coordination for a humanoid robot with machine code genetic programming, in Genetic Programming, Proceedings of EuroGP\u20192001, vol. 2038. LNCS, Lake Como, Italy, 18\u221220 April 2001, ed. by J.F. Miller, M. Tomassini, P.L. Lanzi, C. Ryan, A.G.B. Tettamanzi, W.B. Langdon (Springer, 2001), pp. 313\u2013324","DOI":"10.1007\/3-540-45355-5_25"},{"key":"9065_CR29","doi-asserted-by":"crossref","unstructured":"R. Poli, W.B. Langdon, Sub-machine-code genetic programming, in Advances in Genetic Programming 3, Chap. 13, ed. by L. Spector, W.B. Langdon, U.-M. O\u2019Reilly, and P.J. Angeline (MIT Press, 1999), pp. 301\u2013323","DOI":"10.1007\/3-540-48885-5"}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-008-9065-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10710-008-9065-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-008-9065-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,13]],"date-time":"2021-09-13T23:28:29Z","timestamp":1631575709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10710-008-9065-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,29]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,3]]}},"alternative-id":["9065"],"URL":"https:\/\/doi.org\/10.1007\/s10710-008-9065-y","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,29]]}}}