Metraipolis › archive › dc_ba2ec67a5b79
Neural Logic, Invariance, and the Retina---McCulloch and Pitts — arXiv:2609.02183
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02183
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:53:19.051Z
- SHA-256 of the archived text
b3592aa30fd2c9899ed81082c0ba7856c124ecd3a8d4e64a8c8407abf6b47677- Stable URL of this page
https://metraipolis.com/documento/dc_ba2ec67a5b79
How to cite
Neural Logic, Invariance, and the Retina---McCulloch and Pitts — arXiv:2609.02183 — arXiv (en), https://arxiv.org/abs/2609.02183 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba2ec67a5b79 (Metraipolis archive dc_ba2ec67a5b79, sha256 b3592aa30fd2c9899ed81082c0ba7856c124ecd3a8d4e64a8c8407abf6b47677)
BibTeX
@misc{dcba2ec67a5b79,
title = {Neural Logic, Invariance, and the Retina---McCulloch and Pitts — arXiv:2609.02183},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02183},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba2ec67a5b79; sha256 b3592aa30fd2c9899ed81082c0ba7856c124ecd3a8d4e64a8c8407abf6b47677},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02183. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This chapter reconstructs the McCulloch-Pitts program as a physics of neural computation rather than the familiar cartoon of a binary neuron. The 1943 logical calculus is developed in both directions: given a net, characterize the propositions realized by its activity; given an admissible logical expression, construct a net that realizes it. We recover the original distinction between thresholded excitatory summation and absolute inhibitory veto-one the weighted-threshold form cannot preserve for arbitrarily large excitatory inputs-and read unit-time delay as the physical realization of logical depth. Recurrence is treated exactly: an autonomous, deterministic network of finitely many binary units has a finite state space, so every trajectory eventually enters a periodic orbit-a fact about finite-state dynamics, not unbounded Turing computation. A single threshold element realizes only linearly separable Boolean functions, whereas finite feedforward networks of them synthesize any Boolean function on a finite domain. We then follows McCulloch and Pitts beyond threshold logic. The 1945 heterarchy paper turns cyclic preference into an obstruction to representation by a scalar utility. The 1947 work on universals asks how a physical network can identify inputs related by nuisance transformations, developed here via group averaging and feedback canonicalization. The 1959 frog-retina study makes the adequate-stimulus question experimental, revealing parallel invariant operations before the brain proper. Spike-triggered analysis shows how a nonlinearly driven neuron can have a vanishing first-order average while second-order statistics recover its hidden selectivity: methodological failure can masquerade as physiological absence. Modern mathematical tools are used without projecting their notation onto the historical papers, and limitations of the idealization are stated explicitly. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-03 in cs.NE). Categorie arXiv: Neurons and Cognition (q-bio.NC) ; Disordered Systems and Neural Networks (cond-mat.dis-nn); Formal Languages and Automata Theory (cs.FL); Neural and Evolutionary Computing (cs.NE); Biological Physics (physics.bio-ph). Pagina del lavoro: https://arxiv.org/abs/2609.02183 — 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-17T05:46:06.401Z dalla pagina https://arxiv.org/catchup/cs.NE/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).