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

• URL: http://arxiv.org/abs/2607.16623v1
• Date: Sat, 18 Jul 2026 03:48:00 GMT
• Title: How to Build Marcus's Algebraic Mind: From Minsky's Emotion-Machine Viewpoint
• Abstract summary: 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.
• Score: 18.56157183294801
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In The Algebraic Mind, Marcus identified three cognitive components: operations over variables, recursively structured representations, and an individual/kind distinction. He left the neural substrate open. A companion paper solves this with VaCoAl, an architecture built on GF(2) XOR-and-shift. It offers exact reversible variable binding, compositional bundling, and spatial individual/kind separation. A collision-avoidance scheme ensures exact recovery within a Frontier Size. Its PyVaCoAl implementation demonstrates this algebra scales to millions of records, while the SRAM-CAM version favors hardware speed. Marcus's horizontal framework concerns how a mind represents the world. This paper reads VaCoAl through an orthogonal lens: Minsky's The Emotion Machine, providing the vertical dimension of a mind reasoning about itself. We claim VaCoAl's exact preservation and recovery of structural representations directly enables introspection -- Minsky's Reflective layer. Reflexively unbinding one's own deliberative trace is the operation. We grade deliberation into three tiers by trace faithfulness: probabilistic (LLMs), approximate-algebraic, and exact-algebraic (VaCoAl). Only exact reversibility ensures reflexive recovery is faithful rather than spurious, reaching the Reflective layer. This substrate carries two more Minsky ideas: panalogy (achieved via content-addressable retrieval where match accuracy indicates analogical fit, enabling lifelong learning) and credit assignment (framed as reflexive counterfactual simulation: surgically unbinding a past choice and rebinding a counterfactual to compare). The exact reversibility allowing the companion paper to climb Pearl's causal ladder helps this paper ascend Minsky's introspective stack, finding the intersection. We separate demonstrated trace execution from theoretical Reflection arguments, leaving meta-control loops strictly for future work.

Related papers

• Self-Emergence Agent Architecture:Behavior-Inertia HMM, Reflexive Metacognition,and Social-Contrastive Self-Modeling [7.511170831919511]
  Large language model (LLM) agents exhibit strong language-generation and problem-solving capabilities, yet suffer from three structural limitations.<n>Existing generative-agent simulations rely on memory and fixed prompts, maintaining neither behavioral inertia nor endogenous self-reflection.<n>We propose the Self-Emergence Agent Architecture (SEAA), which integrates three components: (i) a Hidden Markov Model (HMM) that encodes long-term behavioral and cognitive inertia as an editable state-transition matrix; (ii) a Reflexion-style verbal metacognition loop whose output updates the HMM parameters themselves; and (iii
  arXiv  Detail & Related papers  (2026-09-15T15:36:10Z)
• How to Build Marcus's Algebraic Mind: From Thagard's Brain--Mind Viewpoint [18.56157183294801]
  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.
  arXiv  Detail & Related papers  (2026-07-18T01:12:54Z)
• LeanMarathon: Toward Reliable AI Co-Mathematicians through Long-Horizon Lean Autoformalization [104.06650149974585]
  We present LeanMarathon, a multi-agent harness for reliable research-level Lean autoformalization.<n>Four contract-scoped agents construct, audit, prove, and repair this blueprint.<n>We evaluate LeanMarathon on two recent research papers spanning four Erds problems.
  arXiv  Detail & Related papers  (2026-06-03T20:09:39Z)
• STEP: Learning STructured Embeddings for Progressive Time Series [1.034052616244602]
  We present a novel method for learning interpretable representations of progressive time series.<n>Our approach uses a self-supervised contrastive objective to learn a low-dimensional latent space.<n>We evaluate the approach against the state of the art on diverse domains.
  arXiv  Detail & Related papers  (2026-05-29T09:33:34Z)
• 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)
• 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)
• MEMENTO: Teaching LLMs to Manage Their Own Context [50.3558738319336]
  Reasoning models think in long, unstructured streams with no mechanism for compressing or organizing their own intermediate state.<n>We introduce MEMENTO: a method that teaches models to segment reasoning into blocks, compress each block into a memento, and reason forward by attending only to mementos.<n>We show that a two-stage SFT recipe on OpenMementos is effective across different model families and scales.
  arXiv  Detail & Related papers  (2026-04-10T19:30:29Z)
• CAM: A Constructivist View of Agentic Memory for LLM-Based Reading Comprehension [55.29309306566238]
  Current Large Language Models (LLMs) are confronted with overwhelming information volume when comprehending long-form documents.<n>This challenge raises the imperative of a cohesive memory module, which can elevate vanilla LLMs into autonomous reading agents.<n>We draw inspiration from Jean Piaget's Constructivist Theory, illuminating three traits of the agentic memory -- structured schemata, flexible assimilation, and dynamic accommodation.
  arXiv  Detail & Related papers  (2025-10-07T02:16:30Z)
• MARCOS: Deep Thinking by Markov Chain of Continuous Thoughts [82.46857666702924]
  We present a new paradigm for reasoning in large language models (LLMs)<n>Instead of autoregressively generating tokens, we model reasoning as a hidden Markov chain of continuous, high-dimensional "thoughts"<n>For the first time, MARCOS achieves performance comparable to token-based CoT, even surpassing it by 4.7% on GSM8K with up to 15.7x speedup in inference.
  arXiv  Detail & Related papers  (2025-09-29T16:44:22Z)
• LightThinker: Thinking Step-by-Step Compression [74.34839026338342]
  We propose LightThinker, a method that enables large language models to dynamically compress intermediate thoughts during reasoning.<n>Inspired by human cognitive processes, LightThinker compresses thought steps into compact representations and discards the original reasoning chains.<n>Experiments show that LightThinker reduces peak memory usage and inference time, while maintaining competitive accuracy.
  arXiv  Detail & Related papers  (2025-02-21T16:57:22Z)
• Unveiling the Magic of Code Reasoning through Hypothesis Decomposition and Amendment [54.62926010621013]
  We introduce a novel task, code reasoning, to provide a new perspective for the reasoning abilities of large language models.<n>We summarize three meta-benchmarks based on established forms of logical reasoning, and instantiate these into eight specific benchmark tasks.<n>We present a new pathway exploration pipeline inspired by human intricate problem-solving methods.
  arXiv  Detail & Related papers  (2025-02-17T10:39:58Z)

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.