3 citations · 4 across the 6 of their papers we have counts for
6 papers
Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
Eric Goles, Augusto Modanese, Martín Ríos-Wilson +2
The sandpile automata of Bak, Tang, and Wiesenfeld (Phys. Rev. Lett., 1987) are a simple model for the diffusion of particles in space. A fundamental problem related to the complex…
Embedding arbitrary Boolean circuits into fungal automata
Augusto Modanese, Thomas Worsch
Fungal automata are a variation of the two-dimensional sandpile automaton of Bak, Tang, and Wiesenfeld (Phys. Rev. Lett. 1987). In each step toppling cells emit grains only to some…
A faster algorithm for the FSSP in one-dimensional CA with multiple speeds
Thomas Worsch
In cellular automata with multiple speeds for each cell there is a positive integer such that this cell updates its state still periodically but only at times which are a…
Sequentializing cellular automata
Jarkko Kari, Ville Salo, Thomas Worsch
We study the problem of sequentializing a cellular automaton without introducing any intermediate states, and only performing reversible permutations on the tape. We give a decidab…
Phase Space Invertible Asynchronous Cellular Automata
Simon Wacker, Thomas Worsch
While for synchronous deterministic cellular automata there is an accepted definition of reversibility, the situation is less clear for asynchronous cellular automata. We first dis…
Real-Time Sorting of Binary Numbers on One-Dimensional CA
Thomas Worsch, Hidenosuke Nishio
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This…