SearcharxivSearch

arXiv · 2605.21379

How to Build Marcus's Algebraic Mind: Algebro-Deterministic Substrate over Galois Fields

Abstract

In The Algebraic Mind (2001), Marcus held that any adequate cognitive architecture needs operations over variables, recursively structured representations, and an individual/kind distinction, and that multilayer perceptrons support none of them; he left a register-and-treelet implementation as a conjecture. Twenty-five years later a memory architecture built for unrelated reasons (speed, power and cost on commodity silicon) meets that specification operation for operation, through one mechanism rather than three. PyVaCoAl/VaCoAl is a hyperdimensional computing architecture built end-to-end on one primitive: XOR-and-shift over GF(2), realised by primitive-polynomial linear-feedback shift registers (LFSRs). It gives reversible binding Bind(R,F) = R xor shift(F), non-commutative bundling that distinguishes "dog bites man" from "man bites dog", and address-space individual/kind separation, at fixed dimension. Capability: exact reversible binding at O(L) cost supplies each pillar as an architectural primitive, not a product of training, with inspectability no lossy substrate offers. Necessity: weaken the primitive to an approximate inverse, as circular convolution does, and all three pillars degrade together -- what cannot be exactly decomposed was never composed, only mixed. Position: this is not the mind, the brain is not an LFSR, and we do not beat large language models; the substrate supplies the auditable symbolic layer they structurally lack. We develop the correspondence pillar by pillar, recast the treelet as a register set identified by a primitive generator polynomial, cite a companion Perspective on the dentate gyrus-CA3 circuit as a biological instance, and show that inflecting an unseen pseudoverb is a rung-3 query in Pearl's sense. Bit-exact reversibility holds in silicon and only approximately under biological noise; biological claims are structural only.

Explore related subjects

Keep this discovery

BibTeXRIS

Hiroyuki Chuma, Kanji Otsuk, Yoichi Sato. 2026-05-20. How to Build Marcus's Algebraic Mind: Algebro-Deterministic Substrate over Galois Fields. https://arxiv.org/abs/2605.21379

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Breaking the Central Bias: Spatially Partitioned Experts for Coordinate-Based Neuroevolution

Evolvable-Substrate HyperNEAT (ES-HyperNEAT), a bio-inspired indirect encoding that determines neuron placement and connection weights from spatial coordinates, exhibits a failure mode on MNIST as a diagnostic benchmark. Because input pixels map to a coordinate space centered at the origin, evolved networks converge on a small central cluster of input pixels, a spatial-concentration bias; prior work observed only 21% mean accuracy in this regime. Is this bias an optimization artifact or an architectural ceiling? Inspired by Mixture-of-Experts (MoE) principles, we partition the input into non-overlapping spatial segments, each assigned to a separately evolved specialist network. With 13 such experts, this design reaches 43% mean accuracy, a 106% relative improvement over the baseline. The architectural gain does not depend on data-driven aggregation: equal-weighted averaging, which uses no validation data, already yields a 70% improvement; the gain comes from partitioning, not the weighting. Receptive-field analysis shows the mechanism: partitioning forces evolution to discover features across the entire image, expanding active pixel coverage from 4% to 79%. Absolute accuracy stays below gradient-trained baselines, but the relative gain points to central bias, not the evolutionary search. Two tools are designed to generalize beyond MNIST: a receptive-field diagnostic for silent input-coverage collapse, and a spatial-partitioning remedy that restores coverage.

cs.NE

A Bio-Plausible Visual Neural Network for Locust-Inspired Collision Perception

Locust visual systems have long served as an important biological paradigm for studying looming perception and collision avoidance. Numerous computational models have successfully reproduced the selective responses of Lobula Giant Movement Detector (LGMD) neurons to approaching objects, thereby emulating the fundamental functionality of the biological system. However, existing models remain limited in biological plausibility and robustness when operating in complex and dynamic visual environments. To address these limitations, we propose a biologically plausible neural network for locust-inspired looming detection. The proposed framework incorporates a spatially isotropic sampling strategy that mimics the ommatidial organization of the locust compound eye, a population-voting mechanism inspired by population coding in biological neural systems, and leaky integrate-and-fire neuronal dynamics to replace conventional sigmoid-based membrane activation. Systematic experiments on synthetic stimuli, laboratory sequences, and real-world driving scenarios demonstrate that the proposed model improves robustness under challenging visual conditions while preserving computational efficiency and enhancing biological fidelity. These results highlight the potential of biologically grounded neural computation for robust and efficient collision perception.

cs.NE

Structural Fusion of Bayesian Networks with Limited Treewidth Using Genetic Algorithms

This paper introduces an evolutionary computation approach for consensus in structural Bayesian Network (BN) fusion under the constraint of limited treewidth. The consensus BN aims to reconcile multiple input BNs into a single one that retains key structural features present in the original networks. Treewidth, a graph-based parameter associated with computationally tractable inference, is utilized to restrict the complexity of the resulting network. A genetic algorithm is proposed to look for a BN that codifies as much information about the unrestricted fusion as possible while ensuring the treewidth restriction. Experimental evaluation demonstrates the genetic algorithm's ability to obtain consensus BNs with limited treewidth, providing a valuable tool for aggregating information from diverse sources while returning a computationally actionable model.

cs.NE