CORTEXA
← Browse
arxivcs.NE2026-07-18

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

Hiroyuki Chuma, Kanji Otsuka, Yoichi Sato

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.

View free PDFSource page

Related papers

arxivcs.LGcs.NE2026-07-17

Constrained Hebbian Learning Supports Efficient Representational Allocation under Structural Constraints

Patrick Inoue, Florian Röhrbein, Andreas Knoblauch

Introduction: Biological systems face anatomical and metabolic constraints, including costly synaptic maintenance and limited connectivity. These constraints favor neural codes that compress behaviorally relevant information into low-redundancy patterns. We test whether an excita…

View free PDFSource page
arxivcs.NE2026-07-17

Transient State Reorganization and Cell Differentiation in the Developmental Dynamics of Growing Neural Cellular Automata

Hiroki Sato, Atsushi Masumori, Takashi Ikegami

Growing Neural Cellular Automata (GNCA) develop complex morphologies from a single seed cell through shared local rules, yet the internal dynamics of this process remain poorly understood. To investigate how GNCA grows, the full developmental trajectory of trained GNCA models was…

View free PDFSource page
arxivcs.NEcs.AI2026-07-17

Evolutionary Algorithm-Guided LLMs for Physics-Informed Neural Network Design

Xu Yang, Mingyang Yu, Jing Xu, Keqian Li

Physics-informed neural networks (PINNs) are unusually sensitive to interacting choices of architecture, activation, loss weighting, collocation, optimization, and constraint enforcement. Large language models (LLMs) can propose these choices, but independent recommendations do n…

View free PDFSource page
arxivmath.OCcs.LGcs.NEmath.NA2026-07-16

Fast and Scalable Caputo Fractional Gradient Descent via Perturbation-Preserving Memory Compression

Hwanseo Lee, Junseo Lee, Hyunju Kim

Fractional gradient descent (FGD) incorporates long-range memory through Caputo-type operators and has been shown to improve stability in ill-conditioned and nonconvex optimization problems. Despite these advantages, its practical use remains limited, mainly due to the high compu…

View free PDFSource page
arxivcs.NEcs.LG2026-06-26

Criticality-Constrained Iterative Pruning for Energy-Efficient Spiking Neural Networks via Combined Importance Scoring

Muhammad Hamza

Deploying spiking neural networks (SNNs) on neuromorphic hardware demands aggressive synaptic pruning while preserving temporal computation integrity. Existing strategies either neglect neuronal criticality or rely on convex relaxations of the inherently combinatorial pruning pro…

View free PDFSource page