Abstract
As suggested by the title of this book, here we are interested in universality questions only for cellular automata in hyperbolic spaces. In Section 2.1, we have a self-contained presentation of the implementation of cellular automata in hyperbolic spaces. In Section 2.2, we explain the model we shall use for the implementations of the following chapters and on which our results about universality rely.
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.
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). Cellular Automata and the Railway Model. 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_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-36663-5_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36662-8
Online ISBN: 978-3-642-36663-5
eBook Packages: EngineeringEngineering (R0)