Fixed point constructions in tilings and cellular automata
: Törmä Ilkka
: Castillo-Ramirez Alonso, Guillon Pierre, Perrot Kévin
: International Workshop on Cellular Automata and Discrete Complex Systems
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
: 2021
: Open Access Series in Informatics
: 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2021)
: OpenAccess Series in Informatics
: Open access series in informatics
: 90
: 4:1
: 4:13
: 978-3-95977-189-4
: 2190-6807
DOI: https://doi.org/10.4230/OASIcs.AUTOMATA.2021.4
: https://drops.dagstuhl.de/opus/volltexte/2021/14013/
: https://research.utu.fi/converis/portal/detail/Publication/67640603
The fixed point construction is a method for designing tile sets and cellular automata with highly nontrivial dynamical and computational properties. It produces an infinite hierarchy of systems where each layer simulates the next one. The simulations are implemented entirely by computations of Turing machines embedded in the tilings or spacetime diagrams. We present an overview of the construction and list its applications in the literature.
