How to Build Marcus's Algebraic Mind: From Thagard's Brain--Mind Viewpoint

• URL: http://arxiv.org/abs/2607.16573v1
• Date: Sat, 18 Jul 2026 01:12:54 GMT
• Title: How to Build Marcus's Algebraic Mind: From Thagard's Brain--Mind Viewpoint
• Abstract summary: Two critiques of connectionist cognition converge on one missing capacity.<n>We argue one substrate answers both.<n>VaCoAl is a hyperdimensional architecture built on one primitive, XOR-and-shift over GF(2), on primitive-polynomial linear-feedback shift registers.
• Score: 18.56157183294801
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Two critiques of connectionist cognition converge on one missing capacity. In The Algebraic Mind, Marcus isolated three components any architecture must support -- operations over variables, structured representations, and individuals distinct from kinds -- showed perceptrons support none, and left neural implementation as conjecture. In Brain-Mind, Thagard made binding the single mechanism assembling perception, emotion, consciousness, and self, but rested it on circular convolution, a lossy algebra that degrades under the recursion his account of self and emotion demands. We argue one substrate answers both. VaCoAl is a hyperdimensional architecture built on one primitive, XOR-and-shift over GF(2), on primitive-polynomial linear-feedback shift registers; PyVaCoAl is its extended realization, adding a multi-stage rescue circuit, million-dimensional scale, and a Rescue-Rate phase transition (SRAM-CAM hardware and low-power claim remain future work). Binding, Bind(R,F) = R $\oplus$ shift(F), is exactly reversible and non-commutative: it fills Marcus's open register algebra (Pillar 1), supports compositional bundling at fixed dimension (Pillar 2), and separates individuals from kinds (Pillar 3), while removing the depth-degradation that afflicts convolution at Thagard's deepest recursions. We make three scoped claims. Capability: exact reversible binding at O(N) yields compositional generalization with post-hoc auditability no lossy or learned substrate offers. Necessity: two independent cognitive-architecture programs and a biological circuit (dentate gyrus-CA3) requiring the same reversible-compositional algebra is evidence, by convergent evolution not biomimicry, that it is substrate-independent. Position: we do not claim to surpass LLMs; the substrate is orthogonal, supplying the reversible, auditable, multi-hop relational reasoning statistical embeddings structurally lack.

Related papers

• A Compositional Theory of Causally Masked Transformers [50.88598486616582]
  We develop a formalization that derives expressivity directly from the model's implemented dynamics.<n>Each attention head updates its own state independently within a layer.<n>A modified form of soft attention supports irreversible, checklist-like state.
  arXiv  Detail & Related papers  (2026-07-29T14:47:19Z)
• How to Build Marcus's Algebraic Mind: From Minsky's Emotion-Machine Viewpoint [18.56157183294801]
  In The Algebraic Mind, Marcus identified three cognitive components.<n>A companion paper solves this with VaCoAl, an architecture built on GF(2) XOR-and-shift.<n>A collision-avoidance scheme ensures exact recovery within a Frontier Size.
  arXiv  Detail & Related papers  (2026-07-18T03:48:00Z)
• How to Build Marcus's Algebraic Mind: Algebro-Deterministic Substrate over Galois Fields [18.56157183294801]
  PyVaCoAl/VaCoAl is a hyperdimensional computing architecture organized end-to-end around a single algebraic primitive.<n>In this paper, we map the correspondence between Marcus's three pillars and the operational commitments of PyVaCoAl/VaCoAl.
  arXiv  Detail & Related papers  (2026-05-20T16:40:27Z)
• NOETHER: A Constructive Framework for Metamorphic Pattern Discovery from Operator Algebras [6.691613382732758]
  Metamorphic Testing is recognised in IEEE/ISO software-testing standards and increasingly recommended for AI systems.<n>Existing approaches share an inductive grounding that leaves three foundational questions open.<n>We propose a framework whose downstream step from operator algebra to MetaPattern set is mechanical and provable.
  arXiv  Detail & Related papers  (2026-05-17T11:18:35Z)
• Bridging Silicon and the Hippocampus: Algebro-Deterministic Memory "VaCoAl" as a Substrate for Vector-HaSH and TEM [18.56157183294801]
  We introduce VaCoAl, an algebro-deterministic hyperdimensional memory architecture built on Galois-field linear-feedback shift registers.<n>Its deterministic Galois-field diffusion offers a substrate-level alternative to Vector-HaSH's random projections.<n>We derive testable iEEG predictions, uniting computational neuroscience, electrophysiology, and hyperdimensional computing.
  arXiv  Detail & Related papers  (2026-05-15T06:13:58Z)
• Geometric Factual Recall in Transformers [57.48371649045765]
  A common view casts internal weight matrices as associative memories over pairs of embeddings, requiring memorization counts that scale linearly with the number of facts.<n>We develop a theoretical and empirical account of an alternative, emphgeometric form of memorization in which learned embeddings encode structure directly.<n>In a controlled setting where a single-layer transformer must memorize random vectors from subjects to a shared attribute set, we prove that a logarithmic embedding dimension suffices.<n>We extend these results to the multi-hop setting, providing constructions with and without chain-of-thought that exhibit a provable
  arXiv  Detail & Related papers  (2026-05-12T17:22:22Z)
• Beyond LLMs, Sparse Distributed Memory, and Neuromorphics <A Hyper-Dimensional SRAM-CAM "VaCoAl" for Ultra-High Speed, Ultra-Low Power, and Low Cost> [18.56157183294801]
  We propose VaCoAl on ultra-high-dimensional binary spaces on ultra-high-dimensional RAM/DRAM-CAM.<n>It embeds a cognitive bound -- the Frontier Size -- into its architecture, ranking candidates by path-integral confidence.<n>We evaluate multi-hop reasoning on about 470k mentor-student relations from Wikidata, tracing up to 57 generations.
  arXiv  Detail & Related papers  (2026-04-13T16:13:17Z)
• R-Diverse: Mitigating Diversity Illusion in Self-Play LLM Training [65.13759782915164]
  Self-play LLM reasoning through an iterative Challenger bootstrapr loop.<n>R-Diverse sustains gains over more iterations and consistently outperforms prior self-play methods.
  arXiv  Detail & Related papers  (2026-02-13T17:07:42Z)
• ProtInvTree: Deliberate Protein Inverse Folding with Reward-guided Tree Search [77.55575655986252]
  ProtInvTree is a reward-guided tree-search framework for protein inverse folding.<n>It reformulates sequence generation as a deliberate, step-wise decision-making process.<n>It supports flexible test-time scaling by expanding the search depth and breadth without retraining.
  arXiv  Detail & Related papers  (2025-06-01T09:34:20Z)
• Syzygy of Thoughts: Improving LLM CoT with the Minimal Free Resolution [59.39066657300045]
  Chain-of-Thought (CoT) prompting enhances the reasoning of large language models (LLMs) by decomposing problems into sequential steps.<n>We propose Syzygy of Thoughts (SoT)-a novel framework that extends CoT by introducing auxiliary, interrelated reasoning paths.<n>SoT captures deeper logical dependencies, enabling more robust and structured problem-solving.
  arXiv  Detail & Related papers  (2025-04-13T13:35:41Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.