Skip to main content

Fables of Cyberspace: Tapeworms, Horses, and Mountains

  • Conference paper
Advances in Artificial Life (ECAL 1999)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1674))

Included in the following conference series:

  • 1209 Accesses

Abstract

If microevolution is hill-climbing, then macroevolution is valley-crossing leading to higher hills. Does sexuality, making reproduction a reticulate process instead of bifurcating, help macroevolution? Even without valleys, if a niche AB exists but cannot be accessed until either niche A or niche B is conquered, it may appear that sexuals should reach AB sooner because discoveries made by selection in A and B separately can be brought together by recombination: in contrast under asexuality the route to AB has to be either through A or through B, not both at once, and should take more time. Moreover, if valleys on the adaptive surface exist, the force of this presumption is increased. Depending on size of population and depth of valleys, a higher hill may not be accessible by adaptation at all; but with sexuality present at least the chance of attaining the high hill’s slope seems inevitably greater. All this, however, leaves out many potentially relevant factors including the intrinsic inefficiency of sexual reproduction. The last makes sex a strongly inferior competitor to asex in the short term as well as making it (advantageously?) slower to climb slopes once they are found.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

References

  1. B. Sumida, A. Houston, J. McNamara, and W. D. Hamilton. Genetic Algorithms and Learning. J. Theo. Biol., 1990.

    Google Scholar 

  2. W.D. Hillis. Co-evolving Parasites Improve Simulated Evolution as an Optimisation Procedure. In S. Forrest, editor, Emergent Computation: Self-Organising, Collective and Cooperative Computing Networks. MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  3. W. D. Hamilton, R. Axelrod, and R. Tanese. Sex as an Adaptation to Resist Parasites. Proc. Nat. Acad. Sci. USA 87:8566–3573, 1990.

    Article  Google Scholar 

  4. W. D. Hamilton. Memes of Haldane and Jayakar in a Theory of Sex. J. Genet., 69:17–32, 1990.

    Article  Google Scholar 

  5. W.D. Hamilton. Haploid Dynamical Polymorphism in a Host with Matching Parasites: Effects of Mutation/Subdivision, Linkage, and Patterns of Selection. J. Hered., 84:328–338, 1993.

    Google Scholar 

  6. B. H. Sumida and W. D. Hamilton. Both Wrightian and “Parasite” Peak Shifts Enhance Genetic Algorithm Performance in the Travelling Salesman Problem. In R. Paton, editor, Computing with Biological Metaphors. Chapman & Hall, London, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamilton, W.D. (1999). Fables of Cyberspace: Tapeworms, Horses, and Mountains. In: Floreano, D., Nicoud, JD., Mondada, F. (eds) Advances in Artificial Life. ECAL 1999. Lecture Notes in Computer Science(), vol 1674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48304-7_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-48304-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66452-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics