Cellular automata over generalized Cayley graphs
It is well-known that cellular automata can be characterized as the set of translation-invariant
continuous functions over a compact metric space; this point of view makes it easy to extend …
continuous functions over a compact metric space; this point of view makes it easy to extend …
[PDF][PDF] Shahrzad Heydarshahi. Abstract geometrical computation 10: An intrinsically universal family of signal machines. ACM Trans. Comput. Theory, 13 (1): 1–31 …
F Becker, T Besson, J Durand-Lose, A Emmanuel… - 2023 - researchgate.net
Signal machines form an abstract and idealised model of collision computing. Based on
dimensionless signals moving on the real line, they model particle/signal dynamics in …
dimensionless signals moving on the real line, they model particle/signal dynamics in …
Abstract geometrical computation 10: An intrinsically universal family of signal machines
F Becker, T Besson, J Durand-Lose… - ACM Transactions on …, 2021 - dl.acm.org
Signal machines form an abstract and idealized model of collision computing. Based on
dimensionless signals moving on the real line, they model particle/signal dynamics in …
dimensionless signals moving on the real line, they model particle/signal dynamics in …
λCA: A Peer Learning Cellular Automaton.
P Collard - Journal of Cellular Automata, 2019 - search.ebscohost.com
This paper proposes to model a world populated by learners where each one has his own
behaviour which is expressed by his way to follow a school curricula. The paper deals with …
behaviour which is expressed by his way to follow a school curricula. The paper deals with …
Universality of causal graph dynamics
Causal Graph Dynamics generalize Cellular Automata, extending them to bounded degree,
time varying graphs. The dynamics rewrite the graph at each time step with respect to two …
time varying graphs. The dynamics rewrite the graph at each time step with respect to two …