Skip to main content
SpringerLink
Log in

Mapping Non-conventional Extensions of Genetic Programming

  • Conference paper
Unconventional Computation (UC 2006)

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

Included in the following conference series:

Abstract

Conventional genetic programming research excludes memory and iteration. We have begun an extensive analysis of the space through which GP or other unconventional AI approaches search and extend it to consider explicit program stop instructions (T8) and any time models (T7). We report halting probability, run time and functionality (including entropy of binary functions) of both halting and anytime programs. Turing complete program fitness landscapes, even with halt, scale poorly.

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

Access this chapter

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

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. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  2. Langdon, W.B., Poli, R.: On Turing complete T7 and MISC F-4 program fitness landscapes. Technical Report CSM-445, Computer Science, Uni. Essex, UK (2005)

    Google Scholar 

  3. Langdon, W.B., Poli, R.: The halting probability in von neumann architectures. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 225–237. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming – An Introduction. Morgan Kaufmann, San Francisco (1998)

    MATH  Google Scholar 

  5. Teller, A.: Genetic programming, indexed memory, the halting problem, and other curiosities. In: FLAIRS, Pensacola, Florida, pp. 270–274. IEEE Press, Los Alamitos (1994)

    Google Scholar 

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

    Google Scholar 

  7. Shannon, C.E., Weaver, W.: The Mathematical Theory of Communication. The University of Illinois Press, Urbana (1964)

    Google Scholar 

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

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

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

    W. B. Langdon

Authors
  1. W. B. Langdon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, New Zealand

    Cristian S. Calude

  2. Department of Computer Science, University of Auckland, 92019, Auckland, New Zealand

    Michael J. Dinneen

  3. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, BucureÅŸti, Romania

    Gheorghe Păun

  4. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  5. Dept. of Computer Science, University of York,  

    Susan Stepney

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Langdon, W.B. (2006). Mapping Non-conventional Extensions of Genetic Programming. In: Calude, C.S., Dinneen, M.J., Păun, G., Rozenberg, G., Stepney, S. (eds) Unconventional Computation. UC 2006. Lecture Notes in Computer Science, vol 4135. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11839132_14

Download citation

  • DOI: https://doi.org/10.1007/11839132_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38593-6

  • Online ISBN: 978-3-540-38594-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation