Skip to main content

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 2))

Abstract

After some reflection on the messages that I have found most inspiring in Wolfram’s NKS book, ten years after its publication, in this paper I speculate on a few, highly attractive new developments that NKS-style experimental research might undergo, and that I have myself begun to explore in recent years. According to these visions, the grand challenge that the emergent, localized structures of elementary automaton 110, or similar ‘particles’, must face in the next ten years is to evolve into populations of increasingly complex individuals, up to forms of (artificial) life, and to a fully blown biosphere.

On a more technical side, the paper illustrates some preliminary steps and results in the application of Genetic Algorithms to variants of Wolfram’s Network Mobile Automata; the objective here is to investigate the emergent qualitative and quantitative properties of the causal sets associated to the automata computations, in view of their potential application as discrete models of physical spacetime.

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

Access this chapter

eBook
USD 16.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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. Agha, G.: ACTORS: A Model of Concurrent Computation in Distributed Systems. The MIT Press, Cambridge (1990)

    Google Scholar 

  2. Bolognesi, T.: Planar trinet dynamics with two rewrite rules. Complex Systems 18(1), 1–41 (2008)

    MathSciNet  MATH  Google Scholar 

  3. Bolognesi, T.: A pseudo-random network mobile automaton with linear growth. Inf. Process. Lett. 109(13), 668–674 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bolognesi, T.: Causal sets from simple models of computation. Int. Journ. of Unconventional Computing 6(6), 489–524 (2010)

    Google Scholar 

  5. Bolognesi, T.: Causal sets from simple models of computation (April 2010), http://arxiv.org/abs/1004.3128v1 [physics.comp-ph]

  6. Bolognesi, T.: Algorithmic causets. In: Proceedings of DICE 2010: Space, Time, Matter. Journal of Physics: Conference Series, vol. 306(1). IOP Science (2011), doi:10.1088/1742-6596/306/1/012042

    Google Scholar 

  7. Bolognesi, T.: Reality is ultimately digital, and its program is still undebugged. FQXi Essay Contest 2011 (2011), http://fqxi.org/community/essay/winners/2011.1

  8. Bolognesi, T.: Algorithmic causal sets for a computational spacetime. In: Zenil, H. (ed.) A Computable Universe - Understanding Computation and Exploring Nature as Computation. World Scientific (2012)

    Google Scholar 

  9. Bombelli, L., Lee, J., Meyer, D., Sorkin, R.D.: Space-time as a causal set. Phys. Rev. Lett. 59(5), 521–524 (1987)

    Article  MathSciNet  Google Scholar 

  10. Dowker, F.: Causal sets and the deep structure of spacetime. In: Ashtekar, A. (ed.) 100 Years of Relativity - Space-time Structure: Einstein and Beyond, pp. 445–464. World Scientific (2005) arXiv:gr-qc/0508109v1

    Google Scholar 

  11. Hewitt, C.: What is computation? Actor Model versus Turing’s Model. In: Zenil, H. (ed.) A Computable Universe - Understanding Computation and Exploring Nature as Computation. World Scientific (2012)

    Google Scholar 

  12. Hewitt, C., Baker, H.: Laws for communicating parallel processes. Information Processing (1977)

    Google Scholar 

  13. Hoare, C.A.R.: Communicating sequential processes. Commun. ACM 21(8), 666–677 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  14. Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press (1975)

    Google Scholar 

  15. Kauffman, S.A.: At home in the universe: the search for laws of self-organization and complexity. Oxford University Press, Oxford paperbacks (1995)

    Google Scholar 

  16. Markopoulou, F.: Dual formulation of spin network evolution (1997) arXiv:gr-qc/9704013v1

    Google Scholar 

  17. Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River (1989)

    MATH  Google Scholar 

  18. Mitchell, M.: Complexity: a guided tour. Oxford University Press (2009)

    Google Scholar 

  19. Nowotny, T., Requardt, M.: Dimension Theory of Graphs and Networks. J. Phys. 31, 2447–2463 (1998) arXiv:hep-th/9707082, doi:10.1088/0305-4470

    MathSciNet  MATH  Google Scholar 

  20. Pegg, E.: Turmite. In: Weisstein, E.W. (ed.) MathWorld–A Wolfram Web Resource, http://mathworld.wolfram.com/Turmite.html

  21. Pegg, E.: Turmites. The Wolfram Demonstration Project, http://demonstrations.wolfram.com/Turmites/

  22. Pegg, E., Bryant, J., Gray, T.W.: Voronoi diagrams. The Wolfram Demonstration Project, http://demonstrations.wolfram.com/VoronoiDiagrams/

  23. Rideout, D.P., Sorkin, R.D.: Classical sequential growth dynamics for causal sets. Phys. Rev. D 61, 024002 (1999) arXiv:gr-qc/9904062v3

    Google Scholar 

  24. Sorkin, R.D.: Causal sets: Discrete gravity, Notes for the Valdivia Summer School (2003) arXiv:gr-qc/0309009

    Google Scholar 

  25. Wolfram, S.: A New Kind of Science. Wolfram Media, Inc. (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bolognesi, T. (2013). Do Particles Evolve?. In: Zenil, H. (eds) Irreducibility and Computational Equivalence. Emergence, Complexity and Computation, vol 2. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35482-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35482-3_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35481-6

  • Online ISBN: 978-3-642-35482-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics