跳到正文
研踪PaperTrail

论文库

检索计算机领域论文,按研究方向、作者或关键词筛选。

部分采集异常
正在读取账号与研究记录…

全站更新概况

+479新增论文
+361其中 AI 相关
+63已有论文修订
+93新增 AI 导读

arXiv 最近完成扫描:2026-11-16 01:34 · 全站最近入库:2026-11-16 13:44各信源进度 →

统计口径与数据新鲜度

统计 2026-11-15 18:51 — 2026-11-16 18:51(北京时间) · 点击数字查看对应简报;AI 相关包含在新增论文内。

最近完成检查:2026-11-16 01:34最近发现新增版本:2026-11-16 13:44库内论文最新更新时间:2026-11-14 02:59

每分钟刷新已保存的数据。空检查不代表采集异常;新收录可能包含历史论文。AI 导读按新增版本计数。

23,827 已收录论文19,941 AI 相关6,921 有修订112 HF 社区发现

浏览论文库

时间范围跟随排序:版本更新、本站收录或首次发表。最新收录可能包含历史论文。部分信源异常,查看状态 →

找到 1 篇论文 · 按版本更新时间排序上轮扫描起点 2026-11-16 01:33(北京时间)
版本更新 · v4arXiv: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

原文摘要

Tacit knowing is an operating regime of one memory substrate, not a separate kind of content. In VaCoAl (CASRAM, PyVaCoAl), an algebro-deterministic hyperdimensional memory over GF(2), one DAG of bound records is read in two ways. With every collision repaired (Rescue), the trace is exactly auditable but no path outranks another; with collisions tolerated (Don't Care), a path-integrated confidence $CR_2$ ranks direct over circuitous routes without being stated. This audit-valuation complementarity formalizes Polanyi's claim that tacit and explicit knowledge are not sharply divided. (1) Polanyi's from-to structure reads as non-commutative binding. (2) Full explication destroys the valuation (Lemma 1), as with Polanyi's pianist; tacitness is contingent or regime-bound, placing Polanyi, Nonaka, Tsoukas and Collins on one substrate. (3) The same lemma answers the popular dual-process moral ("train slow System 2 to tame fast System 1"), which mirrors the two-store reading of knowledge Polanyi rejected; Mercier and Sperber's reply, that reasoning is intuitive inference about reasons, matches his. (4) To know a large DAG is to cull it. Simon answered Polanyi's Meno argument: a test and a generator suffice. The AlphaGo-to-AlphaProof lineage builds that answer, yet a checker audits an endpoint and values no path: the tacit is relocated, not removed, and results are verified yet rootless. (5) Collins's three tacit knowledges map to bound structure, substrate valuation and value binding. (6) Our mentor-student DAG charts tacit transmission. (7) AI-solved problems with few follow-ups (Tao) are rootless explicit knowledge, re-rooted when LLMs generate, VaCoAl keeps the trace and the community values. (8) On Mercier and Sperber's theory an LLM is a sophist; truth-seeking lies in collective tacit knowing, Polanyi's conviviality, which we conjecture extends beyond humans. Testable predictions follow.

cs.NE · cs.AI