Skip to main content

Ten Years of Weakly Universal Cellular Automata in the Hyperbolic Plane

  • Conference paper

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

Abstract

In this paper, we indicate the progression over ten years of the study of weakly universal cellular automata in the hyperbolic plane. This research obtained the ultimate limit with a weakly universal cellular automaton with two states which is rotation invariant and also actually planar, a new result.

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

Buying options

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cook, M.: Universality in elementary cellular automata. Complex Systems 15(1), 1–40 (2004)

    MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Margenstern, M.: Frontier between decidability and undecidability a survey. Theoretical Computer Science 231(2), 217–251 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  4. 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 

  5. Margenstern, M.: Two railway circuits: a universal circuit and an NP-difficult one. Computer Science Journal of Moldova 9, 1–35 (2001)

    Google Scholar 

  6. 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 

  7. Margenstern, M.: Cellular Automata in Hyperbolic Spaces. Theory, vol. 1, 422 p. OCP, Philadelphia (2007)

    Google Scholar 

  8. Margenstern, M.: Cellular Automata in Hyperbolic Spaces. Implementation and computations, vol. 2, 360 p. OCP, Philadelphia (2008)

    Google Scholar 

  9. Margenstern, M.: Turing machines with two letters and two states. Complex Systems (2010) (accepted)

    Google Scholar 

  10. Margenstern, M.: A weakly universal cellular automaton in the hyperbolic 3D space with three states. In: Proceedings of Discrete Mathematics and Theoretical Computer Science, AUTOMATA 2010, pp. 91–110 (2010)

    Google Scholar 

  11. Margenstern, M.: A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. Theoretical Computer Science (to appear, 2010)

    Google Scholar 

  12. Margenstern, M.: About the embedding of one dimensional cellular automata into hyperbolic cellular automata. arXiv:1004.1830(cs.FL), 19p (2010)

    Google Scholar 

  13. Margenstern, M.: An upper bound on the number of states for a strongly universal hyperbolic cellular automaton on the pentagrid. In: JAC 2010, TUCS Proceedings, Turku, Finland (2010)

    Google Scholar 

  14. Margenstern, M.: A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States. In: Delzanno, G., Potapov, I. (eds.) RP 2011. LNCS, vol. 6945, pp. 205–217. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Margenstern, M.: A family of weakly universal cellular automata in the hyperbolic plane with two states, arXiv:1202.1709v1, 83 p (February 2012)

    Google Scholar 

  16. 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 

  17. 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 

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

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  20. Wolfram, S.: A new kind of science. Wolfram Media, Inc. (2002)

    Google Scholar 

  21. Neary, T., Woods, D.: Small Semi-Weakly Universal Turing Machines. Fundamenta Informaticae 91(1), 179–195 (2009)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Margenstern, M. (2012). Ten Years of Weakly Universal Cellular Automata in the Hyperbolic Plane. In: Nguyen, NT., Hoang, K., Jȩdrzejowicz, P. (eds) Computational Collective Intelligence. Technologies and Applications. ICCCI 2012. Lecture Notes in Computer Science(), vol 7653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34630-9_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34630-9_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34629-3

  • Online ISBN: 978-3-642-34630-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics