Computational and dynamic complexity in shift spaces

Add to your list(s) Download to your calendar using vCal

• Robert Leek (University of Birmingham)
• Thursday 28 October 2021, 15:00-16:00
• Zoom.

If you have a question about this talk, please contact David Craven.

We will discuss some results from the article The relationship between word complexity and computational complexity in subshifts by R. Pavlov and P. Vanier, as well as related papers. We will not assume any background on Turing reducibilty or degrees.

This talk is part of the Topology and Dynamics seminar series.

This talk is included in these lists:

• School of Mathematics events
• Topology and Dynamics seminar
• Zoom

Note that ex-directory lists are not shown.