Computational Prosopography across a Millennium: Mathematically Oriented Lineages Traced from the Fields Medalists

We reconstruct the mentor--student network through which documented scholarly training passed across roughly nine centuries, and subject both the network and the means of reconstructing it to source criticism. From Wikidata, which aggregates the Mathematics Genealogy Project and the MacTutor Archive, we extract approximately 470,000 mentor--student assertions, yielding a directed acyclic graph of 372,853 persons. Using all 64 historical Fields Medalists as a fixed, ex ante tracer set, backward traversal enumerates some 25.5 million distinct paths reaching 57 generations. Three structural observations follow. Genealogical traffic through Leibniz forms an hourglass: thin upstream, 5.3 paths per node on average, and thick downstream, 53.4, a ratio near 10:1, with no counterpart at Newton, who lies on only four of the 64 lineages. Across a window centered on Leibniz, seven independently extracted predicate dimensions reorganize together, and recorded learned-society membership rises from 6.5 to 82.1 percent of the cohort. Upstream, 54 of the 64 lineages converge on the same five twelfth- and thirteenth-century Islamic and Byzantine scholars before terminating at an eleventh-century boundary we name the Monastery Wall. We argue that such observations cannot be assessed without tool criticism. The traversal engine is algebraically reversible, so every ranking decision it makes can be reconstructed afterward. We characterize its measurement bias in closed form, show that the macro-structures survive switching that bias off, and report the family of lineages the traversal returns at different resolutions rather than a single ranked list.

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

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.

Institutions and the transmission of upper-tail human capital: scientific lineages across a millennium

What made useful knowledge cumulative was not discovery alone but the institutions that transmitted it. We provide the first exhaustive structural measurement of the network through which upper-tail human capital passed from master to student across a millennium. Using 470,000 mentor-student records from Wikidata (which integrates the Mathematics Genealogy Project and MacTutor Archive), and all 64 historical Fields Medalists as a fixed, ex ante tracer set, backward traversal yields a directed acyclic graph of 25.5 million paths reaching 57 generations. We document two institutional transitions. First, a 17th-century watershed concentrates lineage traffic on Leibniz: 47 of 64 lineages pass through him with a 10:1 downstream-to-upstream ratio, and seven independent attributes -- learned-society membership (a 46-fold rise per scholar), field, language, employer, institutional diversification, student production, and diffusion entropy -- re-organize coherently across the same window. This is the network signature of Mokyr's Republic of Letters, and it reframes the Newton-Leibniz priority dispute as a distinction between the possession and the transmission of upper-tail human capital: it is transmission that generates the spillovers on which growth depends. Second, 84% of lineages converge upstream on five 12th-13th-century Islamic and Byzantine scholars before terminating at an 11th-century boundary -- the ``Monastery Wall'' -- at which personal academic mentorship first becomes record-generating in Europe. Our claims are descriptive-structural, not causal. Because exhaustive traversal at this scale defeats standard tools, we also contribute a deterministic, algebraic graph-traversal instrument whose measurement bias we characterize in closed form, and report one emergent property of independent methodological interest.

How to Build Marcus's Algebraic Mind: Algebro-Deterministic Substrate over Galois Fields

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.

Beyond LLMs, Sparse Distributed Memory, and Neuromorphics <A Hyper-Dimensional SRAM-CAM "VaCoAl" for Ultra-High Speed, Ultra-Low Power, and Low Cost>

This paper reports an unexpected finding: in a deterministic hyperdimensional computing (HDC) architecture based on Galois-field algebra, a path-dependent semantic selection mechanism emerges, equivalent to spike-timing-dependent plasticity (STDP), with magnitude predictable a priori by a closed-form expression matching large-scale measurements. This addresses limitations of modern AI including catastrophic forgetting, learning stagnation, and the Binding Problem at an algebraic level. We propose VaCoAl (Vague Coincident Algorithm) and its Python implementation PyVaCoAl, combining ultra-high-dimensional memory with deterministic logic. Rooted in Sparse Distributed Memory, it resolves orthogonalisation and retrieval in high-dimensional binary spaces via Galois-field diffusion, enabling low-load deployment. VaCoAl is a memory-centric architecture prioritising retrieval and association, enabling reversible composition while preserving element independence and supporting compositional generalisation with a transparent reliability metric (CR score). We evaluated multi-hop reasoning on about 470k mentor-student relations from Wikidata, tracing up to 57 generations (over 25.5M paths). Using HDC bundling and unbinding with CR-based denoising, we quantify concept propagation over DAGs. Results show a reinterpretation of the Newton-Leibniz dispute and a phase transition from sparse convergence to a post-Leibniz "superhighway", from which structural indicators emerge supporting a Kuhnian paradigm shift. Collision-tolerance mechanisms further induce path-based pruning that favors direct paths, yielding emergent semantic selection equivalent to STDP. VaCoAl thus defines a third paradigm, HDC-AI, complementing LLMs with reversible multi-hop reasoning.