Undecidable word problem in subshift automorphism groups

08/28/2018
by   Pierre Guillon, et al.
0

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has exactly this degree.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/07/2022

L^2-Betti numbers and computability of reals

We study the computability degree of real numbers arising as L^2-Betti n...
research
03/11/2019

The relationship between word complexity and computational complexity in subshifts

We prove several results about the relationship between the word complex...
research
07/07/2022

The Complexity of Proportionality Degree in Committee Elections

Over the last few years, researchers have put significant effort into un...
research
08/01/2022

Distortion element in the automorphism group of a full shift

We show that there is a distortion element in a finitely-generated subgr...
research
06/07/2022

On entropic and almost multilinear representability of matroids

This article is concerned with two notions of generalized matroid repres...
research
03/12/2020

Four heads are better than three

We construct recursively-presented finitely-generated torsion groups whi...
research
07/24/2023

The complexity of completions in partial combinatory algebra

We discuss the complexity of completions of partial combinatory algebras...

Please sign up or login with your details

Forgot password? Click here to reset