Metraipolis › archive › dc_4ef35ddd17ba
"More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks — arXiv:2608.30231
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.30231
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T10:07:09.974Z
- SHA-256 of the archived text
9e42f2c76650db14d0fc634eba9be8699d3bd680b6554f95b484a507db890d74- Stable URL of this page
https://metraipolis.com/documento/dc_4ef35ddd17ba
How to cite
"More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks — arXiv:2608.30231 — arXiv (en), https://arxiv.org/abs/2608.30231 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4ef35ddd17ba (Metraipolis archive dc_4ef35ddd17ba, sha256 9e42f2c76650db14d0fc634eba9be8699d3bd680b6554f95b484a507db890d74)
BibTeX
@misc{dc4ef35ddd17ba,
title = {"More Is Different'' in Neural Circuits: Algebraic Emergence of Effective Theories in Canonical Recurrent Motifs of Biological Neuronal Networks — arXiv:2608.30231},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.30231},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4ef35ddd17ba; sha256 9e42f2c76650db14d0fc634eba9be8699d3bd680b6554f95b484a507db890d74},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30231. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Canonical neural circuit motifs are usually described functionally: divisive normalization rescales population activity by a pooled signal, and winner-take-all competition selects one pattern through recurrent excitation and shared inhibition. We represent them, and their compositions, algebraically as finite transformation systems and analyze the transition monoids generated by their input-conditioned updates, distinguishing structure already present in a generator from structure that appears only through composition, and, on a joint state space, structure inherited from one factor from structure that lives on a joint configuration. Individually aperiodic updates can generate non-aperiodic monoids. In the WTA, every frozen-drive generator collapses to fixed points, yet short input sequences create local cycles of winner-dependent inhibitory gating: globally dissipative dynamics with a reversible action. The strongest result arises in WTA-to-DN composition. The composed monoid then contains a genuinely composite local cycle in which normalization state and the winner's gating state change together, although every primitive generator is aperiodic. Holonomy analysis certifies this as a group component of the Krohn-Rhodes cascade rather than an incidental cycle, and finds most group-carrying image sets on joint configurations, whereas the uncoupled product has none. An exhaustive interface sweep shows that the composite cycle is a property of the coupling rather than of a chosen map. If motifs are building blocks of neural computation, composing them is a form of programming: one chooses primitives and interfaces so that the generated algebra has the intended repertoire. The transition monoid is that repertoire - what a primitive presents to any later construction. Recurrent circuits are compositional transformation systems; their algebra constrains what they can be programmed to compute. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.NE). Categorie arXiv: Neurons and Cognition (q-bio.NC) ; Formal Languages and Automata Theory (cs.FL); Neural and Evolutionary Computing (cs.NE); Chaotic Dynamics (nlin.CD); Biological Physics (physics.bio-ph). Pagina del lavoro: https://arxiv.org/abs/2608.30231 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T09:59:30.668Z dalla pagina https://arxiv.org/catchup/cs.NE/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).