Subshifts Beyond Descriptive Complexity and Computability
Djamel Eddine AMIR
LISN, Paris-Sud
https://amirdjameleddine.github.io/
Date(s) : 10/04/2026 iCal
11h00 - 12h00
Symbolic dynamics shares deep connections with computability theory, descriptive set theory, and topology. These connections can be illustrated through the study of the descriptive complexity of properties of subshifts, as well as the computability of their languages. In the first part of this talk, we discuss the descriptive complexity of invariants of subshifts from both symbolic and topological perspectives. In the second part, we examine the computability of languages of subshifts that admit only finitely many subshifts satisfying properties of lower descriptive complexity.
Emplacement
Saint-Charles - FRUMAM (2ème étage)
Catégories



