Skip to main content
SpringerLink
Log in

Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage

  • Chapter
  • First Online:
Book cover Reversibility and Universality

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

Abstract

This chapter presents the use of Partitioned Cellular Automata—introduced by Morita and colleagues— as the tool to tackle simulation and intrinsic universality in the context of Reversible Cellular Automata. Cellular automata (CA) are mappings over infinite lattices such that all cells are updated synchronously according to the states around each one and a common local function. A CA is reversible if its global function is invertible and its inverse can also be expressed as a CA. Kari proved in 1989 that invertibility is not decidable (for CA of dimension at least 2) and is thus hard to manipulate. Partitioned Cellular Automata (PCA) were introduced as an easy way to handle reversibility by partitioning the states of cells according to the neighborhood. Another approach by Margolus led to the definition of Block CA (BCA) where blocks of cells are updated independently. Both models allow easy check and design for reversibility. After proving that CA, BCA and PCA can simulate each other, it is proven that the reversible sub-classes can also simulate each other contradicting the intuition based on decidability results. In particular, it is proven that any d-dimensional reversible CA (d-R-CA) can be expressed as a BCA with \(d+1\) partitions. This proves a 1990 conjecture by Toffoli and Margolus (Physica D 45) improved and partially proved by Kari in 1996 (Mathematical System Theory 29). With the use of signals and reversible programming, a 1-R-CA that is intrinsically universal —able to simulate any 1-R-CA— is built. Finally, with a peculiar definition of simulation, it is proven that any CA (reversible or not) can be simulated by a reversible one. All these results extend to any dimension.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and 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

References

  1. Albert, J., Čulik, K. II.: A simple universal cellular automaton and its one-way and totalistic version. Complex Syst. 1, 1–16 (1987)

    Google Scholar 

  2. Amoroso, S., Patt, Y.N.: Decision procedure for surjectivity and injectivity of parallel maps for tessellation structure. J. Comput. Syst. Sci. 6, 448–464 (1972)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 6, 525–532 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bennett, C.H.: Notes on the history of reversible computation. IBM J. Res. Dev. 32(1), 16–23 (1988)

    Article  MathSciNet  Google Scholar 

  5. Burks, A.W.: Essays on Cellular Automata. University of Illinois Press, Champaign (1970)

    MATH  Google Scholar 

  6. Durand-Lose, J.: Reversible cellular automaton able to simulate any other reversible one using partitioning automata. In: LATIN 1995. LNCS, vol. 911, pp. 230–244. Springer (1995). https://doi.org/10.1007/3-540-59175-3_92

  7. Durand-Lose, J.: Automates Cellulaires, Automates à Partitions et Tas de Sable. Thèse de doctorat, LaBRI (1996). http://www.univ-orleans.fr/lifo/Members/Jerome.Durand-Lose/Recherche/These/index.html. In French

  8. Durand-Lose, J.: Intrinsic universality of a \(1\)-dimensional reversible cellular automaton. In: STACS 1997. LNCS, Vol. 1200, pp. 439–450. Springer (1997). https://doi.org/10.1007/BFb0023479

  9. Durand-Lose, J.: About the universality of the billiard ball model. In: Margenstern, M. (ed.) Universal Machines and Computations (UMC ’98), vol. 2, pp. 118–133. Université de Metz (1998)

    Google Scholar 

  10. Durand-Lose, J.: Reversible space-time simulation of cellular automata. Theoret. Comput. Sci. 246(1–2), 117–129 (2000). https://doi.org/10.1016/S0304-3975(99)00075-4

    Article  MathSciNet  MATH  Google Scholar 

  11. Durand-Lose, J.: Representing reversible cellular automata with reversible block cellular automata. In: Cori, R., Mazoyer, J., Morvan, M., Mosseri, R. (eds.) Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG ’01, vol. AA of Discrete Mathematics and Theoretical Computer Science Proceedings, pp. 145–154 (2001a). http://dmtcs.loria.fr/volumes/abstracts/dmAA0110.abs.html

  12. Durand-Lose, J.: Back to the universality of the Billiard ball model. Mult. Valued Logic 6(5–6), 423–437 (2001b)

    MathSciNet  MATH  Google Scholar 

  13. Hedlund, G.A.: Endomorphism and automorphism of the shift dynamical system. Math. Syst. Theory 3, 320–375 (1969)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kari, J.: Reversibility of 2D cellular automata is undecidable. Phys. D 45, 379–385 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  15. Kari, J.: Reversibility and surjectivity problems of cellular automata. J. Comput. Syst. Sci. 48(1), 149–182 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kari, J.: Representation of reversible cellular automata with block permutations. Math. Syst. Theory 29, 47–61 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  17. Kari, J.: On the circuit depth of structurally reversible cellular automata. Fund. Inf. 38(1–2), 93–107 (1999)

    MathSciNet  MATH  Google Scholar 

  18. Kari, J.: Theory of cellular automata: a survey. Theoret. Comput. Sci. 334, 3–33 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  19. Lecerf, Y.: Machines de Turing réversibles. Récursive insolubilité en \(n\in \mathbb{N}\) de l’équation \(u = \theta ^nu\), où \(\theta \) est un isomorphisme de codes. Comptes rendus des séances de l’académie des sciences 257:2597–2600 (1963)

    Google Scholar 

  20. Margolus, N.: Physics-like models of computation. Phys. D 10(1–2), 81–95 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  21. Margolus, N.: Physics and Computation. Ph.D. thesis, MIT (1988)

    Google Scholar 

  22. Martin, B.: A universal cellular automaton in quasi-linear time and its S-n-m form. Theoret. Comput. Sci. 123, 199–237 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  23. Moore, E.F.: Machine models of self-reproduction. Proc. Symp. Appl. Math. 14, 17–33 (1962)

    Article  MATH  Google Scholar 

  24. Morita, K.: Any irreversible cellular automaton can be simulated by a reversible one having the same dimension. Tech. Rep. IEICE, Comp. 92–45(1992–10), 55–64 (1992)

    Google Scholar 

  25. Morita, K.: Computation-universality of one-dimensional one-way reversible cellular automata. Inform. Process. Lett. 42, 325–329 (1992b)

    Article  MathSciNet  MATH  Google Scholar 

  26. Morita, K.: Reversible simulation of one-dimensional irreversible cellular automata. Theoret. Comput. Sci. 148, 157–163 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  27. Morita, K.: Reversible computing and cellular automata - a survey. Theoret. Comput. Sci. 395(1), 101–131 (2008). https://doi.org/10.1016/j.tcs.2008.01.041

    Article  MathSciNet  MATH  Google Scholar 

  28. Morita, K., Harao, M.: Computation universality of one-dimensional reversible (injective) cellular automata. Trans. IEICE, E 72(6), 758–762 (1989)

    Google Scholar 

  29. Myhill, J.R.: The converse of Moore’s garden-of-eden theorem. Proc. Am. Math. Soc. 14, 685–686 (1963)

    MathSciNet  MATH  Google Scholar 

  30. Ollinger, N.: Two-states bilinear intrinsically universal cellular automata. In: FCT ’01. LNCS, vol. 2138, 369–399. Springer, Berlin

    Google Scholar 

  31. Ollinger, N.: Universalities in cellular automata. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 189–229. Springer (2012). https://doi.org/10.1007/978-3-540-92910-9

  32. Richardson, D.: Tessellations with local transformations. J. Comput. Syst. Sci. 6(5), 373–388 (1972)

    Google Scholar 

  33. Sarkar, P.: A brief history of cellular automata. ACM Comput. Surv. 32(1), 80–107 (2000)

    Article  Google Scholar 

  34. Toffoli, T.: Computation and construction universality of reversible cellular automata. J. Comput. Syst. Sci. 15, 213–231 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  35. Toffoli, T., Margolus, N.: Cellular Automata Machine – A New Environment for Modeling. MIT press, Cambridge (1987)

    MATH  Google Scholar 

  36. Toffoli, T., Margolus, N.: Invertible cellular automata: a review. Phys. D 45, 229–253 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  37. Wolfram, S.: Theory and Applications of Cellular Automata. World Scientific, Singapore (1986)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIFO EA 4022, Université d’Orléans, FR-45067, Orleans, France

    Jérôme Durand-Lose

  2. LIX, CNRS-INRIA-École Polytechnique, Palaiseau, France

    Jérôme Durand-Lose

Authors
  1. Jérôme Durand-Lose
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jérôme Durand-Lose .

Editor information

Editors and Affiliations

  1. Unconventional Computing Centre, University of the West of England, Bristol, United Kingdom

    Andrew Adamatzky

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Durand-Lose, J. (2018). Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage. In: Adamatzky, A. (eds) Reversibility and Universality. Emergence, Complexity and Computation, vol 30. Springer, Cham. https://doi.org/10.1007/978-3-319-73216-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73216-9_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73215-2

  • Online ISBN: 978-3-319-73216-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation