How to Build Marcus's Algebraic Mind: From Minsky's Emotion-Machine Viewpoint

This paper reports a convergence neither program was looking for. Marcus's The Algebraic Mind named three things any architecture needs -- operations over variables, recursive structure, and individuals distinct from kinds -- showed multilayer perceptrons have none, and left a register-and-treelet implementation as conjecture. Thagard's Brain-Mind ran it from the other end, making binding the mechanism from which the whole of mind is assembled, and circular convolution load-bearing. Marcus leaves his register algebra open; Thagard's is lossy, degrading under the very recursion his own account demands. VaCoAl is a hyperdimensional computing architecture built end-to-end on XOR-and-shift over GF(2) via primitive-polynomial LFSRs; PyVaCoAl is its extended software realization (all results here); the silicon substrate exists as CASRAM. Bind(R,F) = R XOR Shift(F) is exactly reversible and non-commutative: it supplies all three pillars at fixed dimension and removes convolution's depth degradation. Capability: exact reversible binding at O(N) yields compositional generalization with post-hoc auditability, which no lossy or learned substrate offers. Necessity: two independent architecture programs and the dentate gyrus-CA3 circuit require the same algebra -- convergence, not biomimicry. New here: discrimination and failure-tolerance are one. Repair every collision (RR = 1) and the system is bit-identical to a hash dictionary: candidates become indistinguishable and the confidence path-integral collapses; a memory that never fails keeps no record of which routes were hard. Position: we do not surpass large language models but supply the auditable, multi-hop relational reasoning embeddings lack. No consciousness is implemented and no cognitive experiment reported; bit-exactness holds in silicon, approximately under biological noise; speed and power remain unbenchmarked.

In The Algebraic Mind, Gary Marcus identified three components essential for any adequate cognitive architecture: operations over variables, recursively structured representations, and a distinction between mental representations of individuals and kinds. He argued that standard multilayer perceptrons supported none of these, acknowledging that a neural implementation using registers and treelets, constructed via developmental programs rather than gradient descent, remained a programmatic conjecture. Twenty-five years later, the required substrate is now available. Our newly developed PyVaCoAl/VaCoAl is a hyperdimensional computing architecture organized end-to-end around a single algebraic primitive: XOR-and-shift over GF(2), implemented by primitive-polynomial linear-feedback shift registers. The architecture supports reversible variable binding via Bind(R,F) = R XOR shift(F), non-commutative compositional bundling that distinguishes "the dog bites the man" from "the man bites the dog," and address-space individual/kind separation under the same algebra. A companion perspective argues that the dentate gyrus-CA3 circuit is a biological homologue of this same engine, with developmentally specified mossy-fiber targeting supplying the innate microcircuitry Marcus anticipated. In this paper, we map the correspondence between Marcus's three pillars and the operational commitments of PyVaCoAl/VaCoAl. We reinterpret the treelet as an algebraic register set indexed by a primitive generator polynomial, arguing that this architecture provides a functional neural substrate meeting Marcus's specifications far more closely than the tensor products, circular convolution, or temporal synchrony available in 2001. We also demonstrate how this substrate naturally extends to Pearl's rung-3 counterfactual reasoning, a capability the original treelet program did not directly target.

Reflexion-style agents rely on self-generated reflections as memory, implicitly assuming that agents can accurately diagnose their own failures. We show that this assumption can fail systematically: across ALFWorld and HumanEval, agents store confident but incorrect interpretations of the task and continue acting on them across trials, even though the environment resets to the correct task each time. We call this failure mode memory confabulation and introduce the Reflection Repetition Rate (RRR), a log-based metric that detects repeated reliance on incorrect reflective content. Using RRR, we identify 16 frozen environments in ALFWorld, where 0 of 121 reflections mention the correct target object, and 4 analogous cases in HumanEval. Our mitigation replaces open-ended self-diagnosis with programmatic extraction of trajectory-level failure signals, increasing correct object mention from 0% to 86%, reducing RRR from 0.64 to 0.10, and solving 3 of 16 frozen ALFWorld environments, suggesting that reflective memory can reinforce false beliefs rather than correct them.