Ilkka Törmä
PhD
iatorm@utu.fi : 395 |
Symbolic dynamics; Cellular automata
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.
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.
I regularly teach courses on Euclidean geometry, linear algebra and the Finnish high school mathematics curriculum for teachers.
- Structure and computability of preimages in the Game of Life (2025)
- Theoretical Computer Science
- Finding Codes on Infinite Grids Automatically (2024)
- Fundamenta Informaticae
- A physically universal Turing machine (2023)
- Journal of Computer and System Sciences
- Arithmetical complexity of the language of generic limit sets of cellular automata (2023)
- Journal of Computer and System Sciences
- Diddy: A Python Toolbox for Infinite Discrete Dynamical Systems (2023)
- Lecture Notes in Computer Science
- Winning Sets of Regular Languages: Descriptional and Computational Complexity (2023)
- Journal of Automata, Languages and Combinatorics
- Cellular automata and bootstrap percolation (2022)
- Theoretical Computer Science
- Gardens of Eden in the Game of Life (2022) Automata and Complexity: Essays Presented to Eric Goles on the Occasion of His 70th Birthday Salo Ville, Törmä Ilkka
- Stable Multi-Level Monotonic Eroders (2022)
- Theory of Computing Systems
- What Can Oracles Teach Us About the Ultimate Fate of Life? (2022)
- International Colloquium on Automata, Languages and Programming
- Fixed point constructions in tilings and cellular automata (2021)
- Open Access Series in Informatics
- Generically Nilpotent Cellular Automata (2021) Proceedings of the Sixth Russian-Finnish Symposium on Discrete Mathematics Törmä Ilkka
- Nilpotent endomorphisms of expansive group actions (2021)
- International Journal of Algebra and Computation
- Recoding Lie algebraic subshifts (2021)
- Discrete and continuous dynamical systems: series a
- Complexity of Generic Limit Sets of Cellular Automata (2020)
- Lecture Notes in Computer Science
- Countable Sofic Shifts with a Periodic Direction (2020)
- Theory of Computing Systems
- Descriptional Complexity of Winning Sets of Regular Languages (2020)
- Lecture Notes in Computer Science
- A One-Dimensional Physically Universal Cellular Automaton (2017)
- Lecture Notes in Computer Science
- Independent finite automata on Cayley graphs (2017)
- Natural Computing
- PSPACE-completeness of majority automata networks (2016)
- Theoretical Computer Science