Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.16102

Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science

Hiroyuki Chuma·Kanji Otsuka·Yoichi Sato·Kodo Yamauchi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We argue that tacit knowing is better modelled as an operating regime of one memory substrate than as a kind of content. The substrate is VaCoAl, an algebro-deterministic XOR-and-shift hyperdimensional memory over GF(2), realized as CASRAM (commercial SRAM-CAM) and PyVaCoAl (DRAM-CAM).In VaCoAl/PyVaCoAl a directed acyclic graph (DAG) reads two ways. Repairing every collision (Rescue mode) makes the trace exactly auditable but ranks no path higher; tolerating collisions (Don't Care mode) yields a path-integrated confidence, CR$_2$, that silently favours direct routes. This audit-valuation complementarity is a formal counterpart of Polanyi's claim that tacit and explicit knowledge are not sharply divided. It separates contingent tacitness, which a new query brings out (AlphaGo's game tree), from regime-bound tacitness, statable only in a regime where it is gone (AlphaGo's hunches). (1) Polanyi's from-to structure reads as non-commutative binding, the Identikit as role-filler composition, recognition as majority-vote coincidence. (2) Explicating the valuation destroys it, as attending to his fingers can make Polanyi's pianist falter, yet a closed-form law states it. Polanyi, Nonaka, Tsoukas and Collins each capture part of this but narrowly; even Nonaka and von Krogh's continuum cannot tell contingent from regime-bound tacitness. (3) Collins's three tacit knowledges become strata, one outside the substrate. (4) Our mentor-student DAG is a tacit-transmission graph. (5) Terence Tao's remark that AI-solved problems spawn few follow-ups is diagnosed as rootless explicit knowledge: checkable results whose route no one can follow and that no one yet understands well enough to extend, teach or judge. To re-root them, LLMs generate, VaCoAl/PyVaCoAl keeps an auditable trace with its confidence, and people value, a role virtue epistemology shows cannot be offloaded. Testable predictions follow.

Explore related subjects

cs.NEcs.AI

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hiroyuki Chuma, Kanji Otsuka, Yoichi Sato, Kodo Yamauchi. 2026-10-12. Where Polanyi Meets Galois: Tacit Knowing as an Algebro-Deterministic Operation, Toward Re-rooting AI-Generated Science. https://arxiv.org/abs/2610.16102

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Design and Analysis of Temporal Representations in Neural Networks

The ability to represent temporal information is often hypothesized to underlie the efficiency and learning capabilities of biological neural networks. This motivates the development of spiking neural networks. However, it remains unclear how temporal information is actually represented in neural networks and how different forms of temporal representation affect performance and computational efficiency. We introduce the notion of the degree of temporal representation of a neural network, defined by whether its constituent functions (activation, learning, encoding, and decoding) explicitly manipulate time as a computational variable. This perspective yields a continuum ranging from non-temporal representations, where time does not explicitly appear as a computational variable in the network functions, to fully temporal representations, where computations explicitly operate on temporal variables. Using a fixed deep architecture, we compare different encoding, activation mechanisms and decoding with increasing temporal expressiveness: non-temporal weighted-sum activations used in usual artificial neural networks, non-temporal binary spiking activations used in spiking neural networks, and spike-time-based activations used in delay neural networks. Experiments on event-based datasets show that increasing the degree of temporal representation improves both performance and computational efficiency, allowing state-of-the-art performances on the Google Speech Commands dataset. We further analyze how temporal representations induce distinct forward and backward computational trajectories, leading to gradients that depend explicitly on the history of event times.

cs.NE↗
arXiv2026

Controlling the latency in temporal coded spiking models for neuromorphic datasets

Exploiting temporal information in datasets with high temporal dependencies (such as spoken keyword recognition) by spiking models is still an open problem. Promising frameworks include Time-To-First coding (TTFS) and the inclusion of synaptic delays into learning. In TTFS, neurons are forced to spike at most once, forcing the network to found its learning on the spiking times of neurons rather than their spiking rate. Some models use the TTFS framework to directly compute the spiking time of Integrate-and-Fire (IF) or Leaky Integrate-and-Fire (LIF) neurons. However, most models built in the TTFS framework have not been tested against datasets containing temporal information. Little is known about the latency of these models on temporal datasets, where the latency is the time taken by the network to correctly classify a sample. In this work, we study the behaviour of Delay Neural Networks (DeNN) models, i.e. models that directly compute the spiking time of neurons by bypassing the membrane potential and thresholding mechanisms of spiking neurons. We show how to analytically control their latency, and empirically study the latency-accuracy tradeoff in a dynamic temporal dataset.

cs.NE↗
arXiv2026

Distribution Matching Evolutionary Algorithms for Rare Event Sampling

A novel discovery is one which is both useful and surprising: a generative model's output is a useful discovery if it has a low probability of being generated (it's surprising) and a high reward (it's useful). Global optimization can directly increase the probability of sampling high rewards but typically requires updating model weights. Such gradient based optimization is expensive and bars using capable closed-source models. Instead, modern search methods for discovery sacrifice the global target, and use evolutionary algorithms with local reward maximizing objectives, permitting the search to focus only on high probability samples. In this paper, we interpret various evolutionary algorithms as approximate Markov Chain Monte Carlo, an optimization-free method to sample from complex distributions. This interpretation allows developing Distribution Matching Evolutionary Algorithms (DME), a class of search methods which sample from a global target distribution without updating weights. Empirically, DME has a higher sample efficiency than existing methods on problems requiring many samples to find a solution.

cs.NE↗