The Two Boundaries: Why Behavioral AI Governance Fails Structurally
Not on the map. Why?
Abstract (arXiv)
Every system that performs effects has two boundaries: what it can do (expressiveness) and what governance covers (governance). In nearly all deployed AI systems, these boundaries are defined independently, creating three regions: governed capabilities (the only useful region), ungoverned capabilities (risk), and governance policies that address non-existent capabilities (theater). Two of the three regions are failure modes. We focus on the governance of effects: actions that AI systems perform in the world (API calls, database writes, tool invocations). This is distinct from the governance of model outputs (content quality, bias, fairness), which operates at a different level and requires different mechanisms. We present a formal framework for analyzing this structural gap. Rice's theorem (1953) proves the gap is undecidable in the general case for any Turing-complete architecture that attempts to govern effects behaviorally: no algorithm can decide non-trivial semantic properties of arbitrary programs, including the property "this program's effects comply with the governance policy." We define coterminous governance: a system property where the expressivenessboundary equals the governance boundary. We show that coterminous governance requires an architectural decision (separatingcomputation from effect) rather than a governance layer added after the fact. We show that structural governance under this separation subsumes separate governance infrastructure: governance checks become part of the execution pipeline rather than a second system running alongside it. We propose coterminous governance as the testable criterion for any AI governance system: either the two boundaries are provably identical, or risk and theater are structurally inevitable. Proofs are mechanized in Coq (454 theorems, 36 modules, 0 admitted).
Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 8 of its 41 references that are in the map. First posted on arXiv 30 Apr 2026.
Builds on
8 of 41 references.
References · 8
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2023Universal and Transferable Adversarial Attacks on Aligned Language Modelscited by 3,104
- 2022Constitutional AI: Harmlessness from AI Feedbackcited by 3,050
- 2023Jailbroken: How Does LLM Safety Training Fail?cited by 1,651
- 2023DSPy: Compiling Declarative Language Model Calls into Self-Improving Pipelinescited by 832
- 2023NeMo Guardrails: A Toolkit for Controllable and Safe LLM Applications with Programmable Railscited by 365
- 2024Towards Guaranteed Safe AI: A Framework for Ensuring Robust and Reliable AI Systemscited by 96
- 2016Do be do be docited by 4
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundariescited by 1
- 2026Algebraic Semantics of Governed Execution: Monoidal Categories, Effect Algebras, and Coterminous Boundariescited by 1
- 2026Certified Purity for Cognitive Workflow Executors: From Static Analysis to Cryptographic Attestationcited by 1
- 2026Cryptographic Registry Provenance: Structural Defense Against Dependency Confusion in AI Package Ecosystemscited by 1
- 2026Cryptographic Registry Provenance: Structural Defense Against Dependency Confusion in AI Package Ecosystems5 May 2026
- 2026Certified Purity for Cognitive Workflow Executors: From Static Analysis to Cryptographic Attestation1 May 2026
- 2026Algebraic Semantics of Governed Execution: Monoidal Categories, Effect Algebras, and Coterminous Boundaries1 May 2026
- 2026Effect-Transparent Governance for AI Workflow Architectures: Semantic Preservation, Expressive Minimality, and Decidability Boundaries1 May 2026