Abstract
In this chapter we present a result which improves a previous one established by the author. Here we prove that it is possible to construct a weakly universal cellular automaton on the tessellation \(\{8,3\}\) with two states only. Note that the cellular automaton lives in the hyperbolic plane, that the proof yields an explicit construction and that the constructed automaton is not rotationally invariant.
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
Similar content being viewed by others
References
Margenstern, M.: Cellular Automata in Hyperbolic Spaces, vol. 2. Implementation and Computations, Collection: Advances in Unconventional Computing and Cellular Automata, Adamatzky, A. (ed.), 360 p. Old City Publishing, Philadelphia (2008)
Margenstern, M.: A Family of Weakly Universal Cellular Automata in the Hyperbolic Plane with Two States, 83 p, (2012). arXiv:1202.1709
Margenstern, M.: Small Universal Cellular Automata in Hyperbolic Spaces: A Collection of Jewels, 331 p. Springer, Berlin (2013)
Margenstern, M.: A Weakly Universal Cellular Automaton in the Pentagrid with Three States, 40 p (2015). arXiv:1510.09129
Margenstern, M.: A Weakly Universal Cellular Automaton on the Pentagrid with Two States, 38 p (2015). arXiv:1512.07988v1
Margenstern, M.: A weakly universal cellular automaton with 2 states in the tiling \(\{11,3\}\). J. Cell. Autom. 11(2–3), 113–144 (2016)
Margenstern, M.: Cellular Automata in Hyperbolic Spaces, Chapter in Advances in Unconventional Computing. Springer, Berlin. (to appear)
Margenstern, M.: A New System of Coordinates for the Tilings \(\{p,3\}\) and \(\{p\) \(-\) \(2,4\}\), 33 p (2016). arXiv:1605.03753
Margenstern, M.: A Weakly Universal Cellular Automaton on the Tessellation \(\{9,3\}\), 37 p (2016). arXiv:1605.09518
Margenstern, M.: A weakly universal cellular automaton on the tessellation \(\{9,3\}\). J. Cell. Autom. 1605(09518), 37p (2016)
Margenstern, M., Song, Y.: A universal cellular automaton on the ternary heptagrid. Electron. Notes Theor. Comput. Sci. 223, 167–185 (2008)
Margenstern, M., Song, Y.: A new universal cellular automaton on the pentagrid. Parallel Process. Lett. 19(2), 227–246 (2009)
Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs, NJ (1967)
Stewart, I.: A Subway Named Turing, Mathematical Recreations in Scientific American, pp. 90–92 (1994)
Acknowledgements
The author is much in debt to Andrew Adamatzky for his interest to the work.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Margenstern, M. (2018). A Weakly Universal Cellular Automaton on the Grid {8, 3} with Two States. 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_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-73216-9_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-73215-2
Online ISBN: 978-3-319-73216-9
eBook Packages: EngineeringEngineering (R0)