Fixed Point Constructions in Tilings and Cellular Automata

05/02/2021
by   Ilkka Törmä, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

Universal One-Dimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour

Universality in cellular automata theory is a central problem studied an...
research
08/19/2019

Freezing, Bounded-Change and Convergent Cellular Automata

This paper studies three classes of cellular automata from a computation...
research
12/02/2021

The Mirage of Universality in Cellular Automata

This note is a survey of examples and results about cellular automata wi...
research
06/15/2022

Cold Dynamics in Cellular Automata: a Tutorial

This tutorial is about cellular automata that exhibit 'cold dynamics'. B...
research
03/03/2023

Beyond Initial Algebras and Final Coalgebras

We provide a construction of the fixed points of functors which may not ...
research
11/07/2017

Self-referential basis of undecidable dynamics: from The Liar Paradox and The Halting Problem to The Edge of Chaos

In this paper we explore several fundamental relations between formal sy...
research
07/26/2022

Automaticity of spacetime diagrams generated by cellular automata on commutative monoids

It is well-known that the spacetime diagrams of some cellular automata h...

Please sign up or login with your details

Forgot password? Click here to reset