Abstract
− In this paper, we show a construction of a weakly universal cellular automaton in the 3D hyperbolic space with two states. Moreover, based on a new implementation of a railway circuit in the dodecagrid, the construction is a truly 3D-one. This result under the hypothesis of weak universality and in this space cannot be improved.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cook, M.: Universality in elementary cellular automata. Complex Systems 15(1), 1–40 (2004)
Herrmann, F., Margenstern, M.: A universal cellular automaton in the hyperbolic plane. Theoretical Computer Science 296, 327–364 (2003)
Margenstern, M.: Frontier between decidability and undecidability a survey. Theoretical Computer Science 231(2), 217–251 (2000)
Margenstern, M.: Two railway circuits: a universal circuit and an NP-difficult one. Computer Science Journal of Moldova 9, 1–35 (2001)
Margenstern, M.: A universal cellular automaton with five states in the 3D hyperbolic space. Journal of Cellular Automata 1(4), 315–351 (2006)
Margenstern, M.: Cellular Automata in Hyperbolic Spaces. Theory, vol. 1, 422 p. OCP, Philadelphia (2007)
Margenstern, M.: Cellular Automata in Hyperbolic Spaces. Implementation and computations, vol. 2, 360 p. OCP, Philadelphia (2008)
Margenstern, M.: Surprising Areas in the Quest for Small Universal Devices. Electronic Notes in Theoretical Computer Science 225, 201–220 (2009)
Margenstern, M.: Turing machines with two letters and two states. Complex Systems (2010) (accepted)
Margenstern, M.: A weakly universal cellular automaton in the hyperbolic 3D space with three states. arXiv:1002.4290[cs.FL], 54 (2010)
Margenstern, M.: A universal cellular automaton on the heptagrid of the hyperbolic plane with four states. Theoretical Computer Science (2010) (to appear)
Margenstern, M.: About the embedding of one dimensional cellular automata into hyperbolic cellular automata. arXiv:1004.1830 [cs.FL], 19 (2010)
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)
A new weakly universal cellular automaton in the 3D hyperbolic space with two states. arXiv:1005.4826v1[cs.FL], 38 (2010)
Margenstern, M., Skordev, G.: Tools for devising cellular automata in the hyperbolic 3D space. Fundamenta Informaticae 58(2), 369–398 (2003)
Margenstern, M., Song, Y.: A universal cellular automaton on the ternary heptagrid. Electronic Notes in Theoretical Computer Science 223, 167–185 (2008)
Margenstern, M., Song, Y.: A new universal cellular automaton on the pentagrid. Parallel Processing Letters 19(2), 227–246 (2009)
Stewart, I.: A Subway Named Turing, Mathematical Recreations. Scientific American, 90–92 (1994)
Wolfram, S.: A new kind of science. Wolfram Media, Inc., Champaign (2002)
Neary, T., Woods, D.: Small Semi-Weakly Universal Turing Machines. Fundamenta Informaticae 91(1), 179–195 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Margenstern, M. (2011). A New Weakly Universal Cellular Automaton in the 3D Hyperbolic Space with Two States. In: Delzanno, G., Potapov, I. (eds) Reachability Problems. RP 2011. Lecture Notes in Computer Science, vol 6945. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24288-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-24288-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-24287-8
Online ISBN: 978-3-642-24288-5
eBook Packages: Computer ScienceComputer Science (R0)