Abstract
In this chapter, we deal with a simple way to prove universality theorems: it consists in embedding results of one-dimensional cellular automata in the desired grid of the hyperbolic plane or of the hyperbolic 3D space. In Section 7.1, we present a general statement which will entail results about weak universality. In Section 7.2, we improve the technique in order to obtain results about strong universality. We conclude with a few remarks in Section 7.3.
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). Strongly Universal Hyperbolic Cellular Automata. 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_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-36663-5_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36662-8
Online ISBN: 978-3-642-36663-5
eBook Packages: EngineeringEngineering (R0)