result for nontrivial, self-authorizing continuation under persistent disturbance and fixed per-step resources
收藏官方服务：
资源简介：
A scoped impossibility result for nontrivial, self-authorizing continuation under persistent disturbance and fixed per-step resources. PMTT v2.2 defines PFS-SACMs and proves a case split: bounded self-model complexity forces trivial certification or fidelity failure (Bridge Lemma), while unbounded complexity triggers at least one obstruction module (stability/identifiability/absorption/channel/feasibility) under explicit assumptions. Intended as a regime-specific warning and a falsification target
提供机构：
Zenodo创建时间：
2026-02-13
