Skip to main content
SpringerLink
Log in
Book cover

International Conference on Machines, Computations, and Universality

MCU 2015: Machines, Computations, and Universality pp 129–148Cite as

An Intrinsically Universal Family of Causal Graph Dynamics

  • Conference paper
  • First Online:

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

Abstract

Causal Graph Dynamics generalize Cellular Automata, extending them to bounded degree, time varying graphs. The dynamics rewrites the graph in discrete time-steps, with respect to two physics-like symmetries: causality (there exists a bounded speed of information propagation) and shift-invariance (the rewriting acts everywhere the same). Intrinsic universality is the ability of the instance of a model to simulate all other instances, while preserving the structure of the computation. We present here an intrinsically universal family of Causal Graph Dynamics, and give insight on why it seems impossible to improve this result to the existence of a unique intrinsically universal instance.

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 EPUB and 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

References

  1. Arrighi, P., Dowek, G.: Causal graph dynamics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part II. LNCS, vol. 7392, pp. 54–66. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-31585-5_9

    Chapter  Google Scholar 

  2. Arrighi, P., Fargetton, R., Wang, Z.: Intrinsically universal one-dimensional quantum cellular automata in two flavours. Fundam. Inform. 21, 1001–1035 (2009). doi:10.3233/FI-2009-0041

    MathSciNet  MATH  Google Scholar 

  3. Arrighi, P., Grattage, J.: Partitioned quantum cellular automata are intrinsically universal. Nat. Comput. 11, 13–22 (2012). doi:10.1007/s11047-011-9277-6

    Article  MathSciNet  Google Scholar 

  4. Arrighi, P., Martiel, S.: Generalized Cayley graphs and cellular automata over them. In: Proceedings of GCM 2012, pp. 129–143, Bremen, September 2012. arXiv:1212.0027

  5. Arrighi, P. Martiel, S. Nesme, V.: Generalized Cayley graphs and cellular automata over them. submitted (long version) (2013). arXiv:1212.0027

  6. Durand-Lose, J.O.: Intrinsic universality of a 1-dimensional reversible cellular automaton. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 439–450. Springer, Heidelberg (1997). doi:10.1007/BFb0023479

    Chapter  Google Scholar 

  7. Martiel, S., Martin, B.: Intrinsic universality of causal graph dynamics. In: Neary, T., Cook, M. (eds.) Proceedings, Machines, Computations and Universality 2013, pp. 137–149, Zürich, Switzerland, 09 September 2013–11 September 2013, Electronic Proceedings in Theoretical Computer Science 128. Open Publishing Association (2013). doi:10.4204/EPTCS.128.19

  8. Martin, B.: Cellular automata universality revisited. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 329–339. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  9. Mazoyer, J.: An overview of the firing squad synchronization problem. In: Choffrut, C. (ed.) LITP 1986. LNCS, vol. 316, pp. 82–94. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  10. Ollinger, N.: Intrinsically universal cellular automata. In: Neary, T., Woods, D., Seda, A.K., Murphy, N. (eds.) CSP, pp. 259–266. Cork University Press (2008). doi:10.4204/EPTCS.1.19

  11. Ollinger, N.: Intrinsically universal cellular automata. In: Neary, T., Woods, D., Seda, A.K., Murphy, N. (eds.) CSP, EPTCS 1, pp. 199–204. http://arxiv.org/abs/0906.3213

  12. Rosenstiehl, P., Fiksel, J.R., Holliger, A., et al.: Intelligent graphs: networks of finite automata capable of solving graph problems. In: Read, R.C. (Ed.) Graph Theory and Computing, pp. 219–265. Academic Press, Edinburg (1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Nice Sophia Antipolis, I3S-CNRS, UMR 7271, BP121, 06903, Sophia Antipolis, France

    Simon Martiel & Bruno Martin

Authors
  1. Simon Martiel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bruno Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Simon Martiel .

Editor information

Editors and Affiliations

  1. Université d'Orléans, Orléans, France

    Jerome Durand-Lose

  2. Eastern Mediterranean University, Famagusta, Cyprus

    Benedek Nagy

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Martiel, S., Martin, B. (2015). An Intrinsically Universal Family of Causal Graph Dynamics. In: Durand-Lose, J., Nagy, B. (eds) Machines, Computations, and Universality. MCU 2015. Lecture Notes in Computer Science(), vol 9288. Springer, Cham. https://doi.org/10.1007/978-3-319-23111-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23111-2_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23110-5

  • Online ISBN: 978-3-319-23111-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation