AI Cannot Govern AI: A Formal Proof of Structural Openness in Intelligent Systems
Abstract
This note formalizes the Ghost Authority Invariant, proving that AI governance cannot achieve mathematical closure. By mapping authorization to a non-trivial semantic property of program behavior, we demonstrate via Rice’s Theorem that a total computable decider for authority is impossible. This establishes that the hypothesized technological singularity is structurally non-singular due to the non-computable nature of the authority term.
Fields of Study & Subjects
Ethics and Social Impacts of AI
Computability
Logic
AI Algorithms
Access Control and Trust
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 10 January 2026
- Language
- EN