Topological Mixing and Linear Recurrence on SMART

Abstract: The goal of this talk is to analize recent work on properties of the subshift derivated of a particular Turing machine, nicknamed SMART, which has a lot of interesting properties (as topological minimality and aperiodicity). First, we review a combinatorial proof of the Topological Mixing property of the subshift derivated from SMART, and later, we deepen to tie general subshift of Turing Machines with more general properties, as linear recurrence.

dynamical systemslogic

Audience: researchers in the topic

Online logic seminar

Series comments: Description: Seminar on all areas of logic