{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:10:22Z","timestamp":1736287822699,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540331438"},{"type":"electronic","value":"9783540331445"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11729976_20","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T06:47:42Z","timestamp":1141109262000},"page":"225-237","source":"Crossref","is-referenced-by-count":11,"title":["The Halting Probability in Von Neumann Architectures"],"prefix":"10.1007","author":[{"given":"W. B.","family":"Langdon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Poli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Langdon, W.B., Poli, R.: Foundations of Genetic Programming (2002)","DOI":"10.1007\/978-3-662-04726-2"},{"key":"20_CR2","unstructured":"McPhee, N.F., Poli, R.: Using schema theory to explore interactions of multiple operators. In: Langdon, W.B., et al. (eds.) GECCO 2002, pp. 853\u2013860 (2002)"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-1-4419-8983-3_8","volume-title":"Genetic Programming Theory and Practice","author":"J. Rosca","year":"2003","unstructured":"Rosca, J.: A probabilistic model of size drift. In: Riolo, R.L., Worzel, B. (eds.) Genetic Programming Theory and Practice, pp. 119\u2013136. Kluwer, Dordrecht (2003)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-1-4419-8983-3_9","volume-title":"Genetic Programming Theory and Practice","author":"K. Sastry","year":"2003","unstructured":"Sastry, K., O\u2019Reilly, U.-M., Goldberg, D.E., Hill, D.: Building block supply GP. In: Genetic Programming Theory and Practice, pp. 137\u2013154. Kluwer, Dordrecht (2003)"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/11513575_9","volume-title":"Foundations of Genetic Algorithms","author":"B. Mitavskiy","year":"2005","unstructured":"Mitavskiy, B., Rowe, J.E.: A schema-based version of Geiringer\u2019s theorem for nonlinear genetic programming with homologous crossover. In: Wright, A.H., Vose, M.D., De Jong, K.A., Schmitt, L.M. (eds.) FOGA 2005. LNCS, vol.\u00a03469, pp. 156\u2013175. Springer, Heidelberg (2005)"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Daida, J.M., Hilss, A.M., Ward, D.J., Long, S.L.: Visualizing tree structures in genetic programming. Genetic Programming and Evolvable Machines\u00a06(1), 79\u2013110","DOI":"10.1007\/s10710-005-7621-2"},{"key":"20_CR7","unstructured":"Langdon, W.B.: Convergence rates for the distribution of program outputs. In: Langdon, W.B., et al. (eds.) GECCO 2002, New York, July 9-13, pp. 812\u2013819 (2002)"},{"key":"20_CR8","first-page":"183","volume-title":"FOGA 7","author":"W.B. Langdon","year":"2003","unstructured":"Langdon, W.B.: How many good programs are there? How long are they? In: De Jong, K.A., et al. (eds.) FOGA 7, pp. 183\u2013202. Morgan Kaufmann. Published, San Francisco (2003)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-1-4419-8983-3_11","volume-title":"Genetic Programming Theory and Practise","author":"W.B. Langdon","year":"2003","unstructured":"Langdon, W.B.: The distribution of reversible functions is Normal. In: Genetic Programming Theory and Practise, pp. 173\u2013188. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1702","DOI":"10.1007\/3-540-45110-2_63","volume-title":"Genetic and Evolutionary Computation - GECCO 2003","author":"W.B. Langdon","year":"2003","unstructured":"Langdon, W.B.: Convergence of program fitness landscapes. In: Cant\u00fa-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O\u2019Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol.\u00a02724, pp. 1702\u20131714. Springer, Heidelberg (2003)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Teller, A.: Turing completeness in the language of GP with indexed memory. In: 1994 IEEE World Congress on Computational Intelligence, pp. 136\u2013141 (1994)","DOI":"10.1109\/ICEC.1994.350027"},{"key":"20_CR12","unstructured":"Langdon, W.B.: Quadratic bloat in genetic programming. In: Whitley, D., et al. (eds.) GECCO 2000, pp. 451\u2013458 (2000)"},{"key":"20_CR13","unstructured":"Langdon, W.B., Poli, R.: On Turing complete T7 and MISC F-4 program fitness landscapes. Technical Report CSM-445, University of Essex, UK (2005)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Maxwell III, S.R.: Experiments with a coroutine model for genetic programming. In: 1994 IEEE World Congress on Computational Intelligence, pp. 413\u2013417a (1994)","DOI":"10.1109\/ICEC.1994.349915"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: An algebraic equation for the halting probability. In: R. Herken, ed., The Universal Turing Machine A Half-Century Survey, pp. 279\u2013283. OUP (1988)","DOI":"10.1093\/oso\/9780198537748.003.0010"},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1080\/10586458.2002.10504481","volume":"11","author":"C.S. Calude","year":"2002","unstructured":"Calude, C.S., Dinneen, M.J., Shu, C.-K.: Computing a glimpse of randomness. Experimental Mathematics\u00a011(3), 361\u2013370 (2002)","journal-title":"Experimental Mathematics"}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11729976_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T21:54:57Z","timestamp":1736286897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11729976_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540331438","9783540331445"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11729976_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}