
Universal OneDimensional Cellular Automata Derived for Turing Machines and its Dynamical Behaviour
Universality in cellular automata theory is a central problem studied an...
read it

Reversible cellular automata in presence of noise rapidly forget everything
We consider reversible and surjective cellular automata perturbed with n...
read it

Automaticity and invariant measures of linear cellular automata
We show that spacetime diagrams of linear cellular automata Φ with (p)...
read it

Efficient methods to determine the reversibility of general 1D linear cellular automata in polynomial complexity
In this paper, we study reversibility of onedimensional(1D) linear cell...
read it

Four heads are better than three
We construct recursivelypresented finitelygenerated torsion groups whi...
read it

Reversibility vs local creation/destruction
Consider a network that evolves reversibly, according to nearest neighbo...
read it

Cellular Cohomology in Homotopy Type Theory
We present a development of cellular cohomology in homotopy type theory....
read it
Conjugacy of reversible cellular automata
We show that conjugacy of reversible cellular automata is undecidable, whether the conjugacy is to be performed by another reversible cellular automaton or by a general homeomorphism. This gives rise to a new family of f.g. groups with undecidable conjugacy problems, whose descriptions arguably do not involve any type of computation. For many automorphism groups of subshifts, as well as the group of asynchronous transducers and the homeomorphism group of the Cantor set, our result implies the existence of two elements such that every f.g. subgroup containing both has undecidable conjugacy problem. We say that conjugacy in these groups is eventually locally undecidable. We also prove that the BrinThompson group 2V and groups of reversible Turing machines have undecidable conjugacy problems, and show that the word problems of the automorphism group and the topological full group of every full shift are eventually locally coNPcomplete.
READ FULL TEXT
Comments
There are no comments yet.