37 citations · 53 across the 16 of their papers we have counts for
Showing cs.FLShow all
3 papers · 1 filter
cs.FL2023
Structure and computability of preimages in the Game of Life
Ville Salo, Ilkka Törmä
Conway's Game of Life is a two-dimensional cellular automaton. As a dynamical system, it is well-known to be computationally universal, i.e.\ capable of simulating an arbitrary Tur…
cs.FL2015
A One-Dimensional Physically Universal Cellular Automaton
Ville Salo, Ilkka Törmä
Physical universality of a cellular automaton was defined by Janzing in 2010 as the ability to implement an arbitrary transformation of spatial patterns. In 2014, Schaeffer gave a…
cs.FL2014
Plane-Walking Automata
Ville Salo, Ilkka Törmä
In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of h…