Showing cs.CCShow all
2 papers · 1 filter
cs.CC2025
On the Dynamics of Bounded-Degree Automata Networks
Julio Aracena, Florian Bridoux, Maximilien Gadouleau +4
Automata networks can be seen as bare finite dynamical systems, but their growing theory has shown the importance of the underlying communication graph of such networks. This paper…
cs.CC2025
Circuit metaconstruction in logspace for Rice-like complexity lower bounds in ANs and SGRs
Aliénor Goubault-Larrecq, Kévin Perrot
A new proof technique combining finite model theory and dynamical systems has recently been introduced to obtain general complexity lower bounds on any question one may formulate o…