Metraipolis › archive › dc_f2c8dcf28674
Can a Dynamic Internal Field Govern a Transformer's Cognition? Certifiability, not Superiority, in Homeostatic Compute Control — arXiv:2608.24319
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.24319
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T06:36:52.475Z
- SHA-256 of the archived text
fdc2c488dcab0e39f37d90fc071d25170770fdd339ce9be01ff1655721f542cf- Stable URL of this page
https://metraipolis.com/documento/dc_f2c8dcf28674
How to cite
Can a Dynamic Internal Field Govern a Transformer's Cognition? Certifiability, not Superiority, in Homeostatic Compute Control — arXiv:2608.24319 — arXiv (en), https://arxiv.org/abs/2608.24319 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f2c8dcf28674 (Metraipolis archive dc_f2c8dcf28674, sha256 fdc2c488dcab0e39f37d90fc071d25170770fdd339ce9be01ff1655721f542cf)
BibTeX
@misc{dcf2c8dcf28674,
title = {Can a Dynamic Internal Field Govern a Transformer's Cognition? Certifiability, not Superiority, in Homeostatic Compute Control — arXiv:2608.24319},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.24319},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f2c8dcf28674; sha256 fdc2c488dcab0e39f37d90fc071d25170770fdd339ce9be01ff1655721f542cf},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.24319. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
An intelligent system does not merely reason: it governs its own reasoning - how much to compute, when to stop, which module to activate. Can that role be played by a dynamic internal field - a low-dimensional homeostatic state with explicit physics and certified stability - that modulates cognition without performing it? Ours is a field on the module graph governed by a family of PDEs on the graph Laplacian, advancing with an adaptive-depth reasoner. We certify the stability of the integrator of the whole family - an integrator certificate, not a closed-loop one. New, and proved here: a discrete Schur-Cohn criterion for Verlet with velocity coupling, necessary and sufficient per latent root, with no commutation hypothesis. The answer is threefold: substance no, structure only in part, certifiability yes. The type of the field's physics is irrelevant for accuracy: wave, diffusion, gated mixtures and a 2D Navier-Stokes substrate tie. A twenty-seed preregistered deconfounding campaign bounds the structural claim: at equalized caps the second-order effect is strong in one family (+0.087 [+0.042, +0.132], t=4.0) but is not detected in the other (+0.014 [-0.013, +0.040], n.s.), so part of the original contrast was capacity, not order; and a matched-interface GRU is indistinguishable in the first and nominally exceeds the field in the second (-0.035 [-0.067, -0.002]). What distinguishes the field is not capability but that its one-step operator admits an exact runtime stability check - a difference of kind, not of existence: learned recurrences carry certificates too, sufficient and conservative ones. A kill-gate with a positive control finds no evidence for the field as evidence accumulator (Delta AUC +0.0007 [-0.0065, +0.0079] vs a 0.03 threshold). A dynamic internal field is a viable, certifiable compute governor, but not an enhancer of cognition: it modulates, it does not think. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-26 in cs.LG). Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (cs.LG); Systems and Control (eess.SY). Pagina del lavoro: https://arxiv.org/abs/2608.24319 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-18T06:28:52.348Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-08-26?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).