"More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks

What the math gives to ML

The paper treats recurrent motifs as finite transformation systems and studies the monoid generated by input-conditioned state updates, rather than analyzing each update in isolation. Its transferable asset is a constructive way to design and audit recurrent modules: individually dissipative transitions can compose into controlled local permutations, providing finite-state memory or phase-like behavior without making every primitive recurrent map reversible. The strongest neural-network application is a quantized or discretized recurrent cell whose DN/WTA-like factors are coupled through a learned interface and whose generated transition monoid is searched or regularized to contain desired short cycles while remaining globally contractive. This offers an interpretable alternative to hoping that ordinary RNN training discovers useful discrete temporal state.