Skip to main content
SpringerLink
Log in
Book cover

European Conference on Genetic Programming

EuroGP 2006: Genetic Programming pp 225–237Cite as

The Halting Probability in Von Neumann Architectures

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3905))

Abstract

Theoretical models of Turing complete linear genetic programming (GP) programs suggest the fraction of halting programs is vanishingly small. Convergence results proved for an idealised machine, are tested on a small T7 computer with (finite) memory, conditional branches and jumps. Simulations confirm Turing complete fitness landscapes of this type hold at most a vanishingly small fraction of usable solutions.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Langdon, W.B., Poli, R.: Foundations of Genetic Programming (2002)

    Google Scholar 

  2. 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–860 (2002)

    Google Scholar 

  3. Rosca, J.: A probabilistic model of size drift. In: Riolo, R.L., Worzel, B. (eds.) Genetic Programming Theory and Practice, pp. 119–136. Kluwer, Dordrecht (2003)

    Chapter  Google Scholar 

  4. Sastry, K., O’Reilly, U.-M., Goldberg, D.E., Hill, D.: Building block supply GP. In: Genetic Programming Theory and Practice, pp. 137–154. Kluwer, Dordrecht (2003)

    Chapter  Google Scholar 

  5. Mitavskiy, B., Rowe, J.E.: A schema-based version of Geiringer’s 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. 3469, pp. 156–175. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  6. Daida, J.M., Hilss, A.M., Ward, D.J., Long, S.L.: Visualizing tree structures in genetic programming. Genetic Programming and Evolvable Machines 6(1), 79–110

    Google Scholar 

  7. 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–819 (2002)

    Google Scholar 

  8. 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–202. Morgan Kaufmann. Published, San Francisco (2003)

    Google Scholar 

  9. Langdon, W.B.: The distribution of reversible functions is Normal. In: Genetic Programming Theory and Practise, pp. 173–188. Kluwer Academic Publishers, Dordrecht (2003)

    Chapter  Google Scholar 

  10. Langdon, W.B.: Convergence of program fitness landscapes. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, 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. 2724, pp. 1702–1714. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  11. Teller, A.: Turing completeness in the language of GP with indexed memory. In: 1994 IEEE World Congress on Computational Intelligence, pp. 136–141 (1994)

    Google Scholar 

  12. Langdon, W.B.: Quadratic bloat in genetic programming. In: Whitley, D., et al. (eds.) GECCO 2000, pp. 451–458 (2000)

    Google Scholar 

  13. 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)

    Google Scholar 

  14. Maxwell III, S.R.: Experiments with a coroutine model for genetic programming. In: 1994 IEEE World Congress on Computational Intelligence, pp. 413–417a (1994)

    Google Scholar 

  15. Chaitin, G.J.: An algebraic equation for the halting probability. In: R. Herken, ed., The Universal Turing Machine A Half-Century Survey, pp. 279–283. OUP (1988)

    Google Scholar 

  16. Calude, C.S., Dinneen, M.J., Shu, C.-K.: Computing a glimpse of randomness. Experimental Mathematics 11(3), 361–370 (2002)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Essex, UK

    W. B. Langdon & R. Poli

Authors
  1. W. B. Langdon
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. R. Poli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Université Louis Pasteur, LSIIT, FDBT, Pôle API,, F-67400, Illkirch, France

    Pierre Collet

  2. Institut des Systèmes d’Information (ISI), Université de Lausanne, Hautes Etudes Commerciales (HEC),, Switzerland

    Marco Tomassini

  3. Lehrstuhl für Informatik II, Universität Würzburg, Am Hubland,, 97074, Würzburg, Germany

    Marc Ebner

  4. GE Global Research, Niskayuna,, NY, USA

    Steven Gustafson

  5. Aston University, Birmingham, UK

    Anikó Ekárt

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langdon, W.B., Poli, R. (2006). The Halting Probability in Von Neumann Architectures. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds) Genetic Programming. EuroGP 2006. Lecture Notes in Computer Science, vol 3905. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11729976_20

Download citation

  • DOI: https://doi.org/10.1007/11729976_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-33143-8

  • Online ISBN: 978-3-540-33144-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation