2000 character limit reached
Fixed Point Constructions in Tilings and Cellular Automata (2105.00443v1)
Published 2 May 2021 in math.DS, cs.CC, and math.LO
Abstract: 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.