How to Build Marcus's Algebraic Mind: From Minsky's Emotion-Machine Viewpoint
Neural and Evolutionary Computing
Summary
The authors build on Marcus's ideas about how the mind handles complex information by introducing VaCoAl, a system using special algebra (XOR-and-shift) for perfectly reversible operations on mental 'variables' and representations. They argue this exact reversibility allows the mind to 'reflect' on its own thinking process, based on Minsky's theory of introspection. The paper compares different levels of thinking fidelity, showing only exact algebraic methods like VaCoAl can truly recover past thought states without errors. This approach also supports lifelong learning and evaluating 'what if' scenarios by revisiting prior decisions. The authors separate practical demonstrations from theoretical discussions about higher-level self-awareness, leaving some aspects for future research.
Authors
Hiroyuki Chuma, Kanji Otsuka, Yoichi Sato
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.