By Ronnie Pavlov and Pascal Vanier

We prove several results about the relationship between the word complexity function of a subshift and the set of Turing degrees of points of the subshift, which we call the Turing spectrum. Among other results, we show that a Turing spectrum can be realized via a subshift of linear complexity... Show more

March 11, 2019

Loading full text...

Similar articles

Loading recommendations...

x1

The relationship between word complexity and computational complexity in subshifts

Click on play to start listening