Ilkka
Törmä
University Lecturer, Mathematics
Docent, Department of Mathematics and Statistics
PhD
Contact
Links
Areas of expertise
Symbolic dynamics
Cellular automata
Biography
I am a university lecturer at the Department of Mathematics and Statistics. I obtained my PhD from the University of Turku in 2015. Since then I have worked as a researcher at Boston University (USA), University of Montpellier (France), and now at the University of Turku.
Teaching
I regularly teach courses on Euclidean geometry, linear algebra and the Finnish high school mathematics curriculum for teachers.
Research
I study cellular automata and multidimensional symbolic dynamics, from both dynamical and computational perspectives. In particular, I am interested in the properties of multidimensional SFTs and sofic shifts, and the relations between their different subclasses.
Publications
Limit dynamics of elementary cellular automaton 18 (2026)
Ergodic Theory and Dynamical Systems
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
A Perturbed Cellular Automaton with Two Phase Transitions for the Ergodicity (2026)
Journal of Statistical Physics
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
On countable SFT covers of sparse multidimensional shift spaces (2026)
Theoretical Computer Science
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
Structure and computability of preimages in the Game of Life (2025)
Theoretical Computer Science
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
Multidimensional Tilings and MSO Logic (2025)
Lecture Notes in Computer Science
(A4 Vertaisarvioitu artikkeli konferenssijulkaisussa)
Symbol Frequencies in Surjective Cellular Automata (2025)
Lecture Notes in Computer Science
(A4 Vertaisarvioitu artikkeli konferenssijulkaisussa)
Finding Codes on Infinite Grids Automatically (2024)
Fundamenta Informaticae
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
Winning Sets of Regular Languages: Descriptional and Computational Complexity (2023)
Journal of Automata, Languages and Combinatorics
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
Arithmetical complexity of the language of generic limit sets of cellular automata (2023)
Journal of Computer and System Sciences
(A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä )
Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems (2023)
International Workshop on Cellular Automata and Discrete Complex Systems, Lecture Notes in Computer Science
(Vertaisarvioitu artikkeli konferenssijulkaisussa (A4))