Skip to main content
SpringerLink
Log in

Cellular Automata and Hyperbolic Spaces

  • Chapter
Irreducibility and Computational Equivalence

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

  • 1363 Accesses

Abstract

In this paper we look at the possibility to implement cellular automata in hyperbolic spaces and at a few consequences it may have, both on theory and on more practical problems.

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 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. Ben-Jacob, E.: Social behavior of bacteria: from physics to complex organization. European Physical Journal B 65(3), 315–322 (2008)

    Article  Google Scholar 

  2. Berger, R.: The undecidability of the domino problem. Memoirs of the American Mathematical Society 66, 1–72 (1966)

    Google Scholar 

  3. Bonola, R.: Non-Euclidean Geometry. Dover (2007)

    Google Scholar 

  4. Chelghoum, K., Margenstern, M., Martin, B., Pecci, I.: Palette hyperbolique: un outil pour interagir avec des ensembles de données. In: IHM 2004, Namur (2004)

    Google Scholar 

  5. Cook, M.: Universality in Elementary Cellular Automata. Complex Systems 15(1), 1–40 (2004)

    MathSciNet  MATH  Google Scholar 

  6. Coxeter, H.S.M.: Non-Euclidean Geometry. Mathematical Association of America (1998)

    Google Scholar 

  7. Herrmann, F., Margenstern, M.: A universal cellular automaton in the hyperbolic plane. Theoretical Computer Science 296, 327–364 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  8. Iwamoto, C., Margenstern, M., Morita, K., Worsch, T.: Polynomial Time Cellular Automata in the Hyperbolic Plane Accept Exactly the PSPACE Languages. In: SCI 2002 (2002)

    Google Scholar 

  9. Margenstern, M.: New Tools for Cellular Automata of the Hyperbolic Plane. Journal of Universal Computer Science 6(12), 1226–1252 (2000)

    MathSciNet  MATH  Google Scholar 

  10. Margenstern, M.: A universal cellular automaton with five states in the 3D hyperbolic space. Journal of Cellular Automata 1(4), 315–351 (2006)

    MathSciNet  Google Scholar 

  11. Margenstern, M.: Cellular Automata in Hyperbolic Spaces. Theory, vol. 1, 422 p. Old City Publishing, Philadelphia (2007)

    Google Scholar 

  12. Margenstern, M.: The Domino Problem of the Hyperbolic Plane Is Undecidable. Theoretical Computer Science 407, 29–84 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  13. Margenstern, M.: Cellular Automata in Hyperbolic Spaces. Implementation and computations, vol. 2, 360 p. Old City Publishing, Philadelphia (2008)

    Google Scholar 

  14. Margenstern, M.: An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid. In: JAC 2010, Turku, Finland, December 15-17 (2010) (accepted)

    Google Scholar 

  15. Margenstern, M.: A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. Theoretical Computer Science 412, 33–56 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  16. Margenstern, M.: Bacteria, Turing machines and hyperbolic cellular automata. In: Zenil, H. (ed.) A Computable Universe: Understanding and Exploring Nature as Computation, ch. 12. World Scientific (in press, 2012)

    Google Scholar 

  17. Margenstern, M.: A protocol for a message system for the tiles of the heptagrid, in the hyperbolic plane. International Journal of Satellite Communications Policy and Management (in press)

    Google Scholar 

  18. Margenstern, M.: Universal cellular automata with two states in the hyperbolic plane. Journal of Cellular Automata (in press)

    Google Scholar 

  19. Margenstern, M., Martin, B., Umeo, H., Yamano, S., Nishioka, K.: A Proposal for a Japanese Keyboard on Cellular Phones. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 299–306. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  20. Margenstern, M., Morita, K.: NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theoretical Computer Science 259, 99–128 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  21. Margenstern, M., Song, Y.: A universal cellular automaton on the ternary heptagrid. Electronic Notes in Theoretical Computer Science 223, 167–185 (2008)

    Article  Google Scholar 

  22. Margenstern, M., Song, Y.: A new universal cellular automaton on the pentagrid. Parallel Processing Letters 19(2), 227–246 (2009)

    Article  MathSciNet  Google Scholar 

  23. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice Hall, Englewood Cliffs (1967)

    MATH  Google Scholar 

  24. Morgenstein, D., Kreinovich, V.: Which Algorithms are Feasible and Which are not Depends on the Geometry of Space-Time. Geocombinatorics 4(3), 80–97 (1995)

    MATH  Google Scholar 

  25. Robinson, R.M.: Undecidability and nonperiodicity for tilings of the plane. Inventiones Mathematicae 12, 177–209 (1971)

    Article  MathSciNet  Google Scholar 

  26. Stewart, I.: A Subway Named Turing, Mathematical Recreations. Scientific American, 90–92 (1994)

    Google Scholar 

  27. Taimina, D.: Crocheting Adventures with Hyperbolic Planes, 148 p. A K Peters, Ltd., Wellesley (2009)

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Université de Lorraine, Campus du Saulcy, Nancy, France

    Maurice Margenstern

Authors
  1. Maurice Margenstern
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Maurice Margenstern .

Editor information

Editors and Affiliations

  1. , Department of Computer Science/, The University of Sheffield, Regent Court, 211, Portobello, S1 4DP, United Kingdom

    Hector Zenil

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Margenstern, M. (2013). Cellular Automata and Hyperbolic Spaces. 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_4

Download citation

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

  • 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

Search

Navigation