A4 Refereed article in a conference publication
Fixed point constructions in tilings and cellular automata
Authors: Törmä Ilkka
Editors: Castillo-Ramirez Alonso, Guillon Pierre, Perrot Kévin
Conference name: International Workshop on Cellular Automata and Discrete Complex Systems
Publisher: Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication year: 2021
Journal: Open Access Series in Informatics
Book title : 27th IFIP WG 1.5 International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA 2021)
Journal name in source: OpenAccess Series in Informatics
Series title: Open access series in informatics
Volume: 90
First page : 4:1
Last page: 4:13
ISBN: 978-3-95977-189-4
eISSN: 2190-6807
DOI: https://doi.org/10.4230/OASIcs.AUTOMATA.2021.4
Web address : https://drops.dagstuhl.de/opus/volltexte/2021/14013/
Self-archived copy’s web address: 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.
Downloadable publication This is an electronic reprint of the original article. |  |
