Abstract
In this chapter, in Section 5.1, we introduce cellular automata in a grid {p, 3}. In Section 5.2 we describe the new scenario for a weakly universal planar cellular automaton on a grid {13, 3}, still within our railway model. In Section 5.3, we transform the precise description of the previous section into rules. This allows us to prove Theorem 4, below. In Section 5.4 the above scenario is tuned a bit in order to obtain uniform rules for all {p, 3} with p ≥ 17.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Margenstern, M. (2013). In the Tilings {p, 3}. In: Small Universal Cellular Automata in Hyperbolic Spaces. Emergence, Complexity and Computation, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36663-5_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-36663-5_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36662-8
Online ISBN: 978-3-642-36663-5
eBook Packages: EngineeringEngineering (R0)