No finite rulebook can certify every safe program: an impossibility theorem for gatekeeping AI agents
cs.AI, cs.CR
Submitted: 2026-11-09
Updated: 2026-11-09
Code: https://github.com/Tomasao/ImpossibilityTheorem
Project page: https://ethereum.github.io/yellowpaper/paper.pdf
Terminology
Sources
- Towards Verifiably Safe Tool Use for LLM Agents
- What Can Be Enforced? A Theory of Certified Runtime Safety for Tool-Using Agents
- Constitutional AI: Harmlessness from AI Feedback
- Algorithmic Unverifiability of Safety for Fixed and Recursively Self-Improving Systems
- Alignment Verifiability in Large Language Models: Normative Indistinguishability under Behavioral Evaluation
- Limitations on Accurate, Trusted, Human-level Reasoning
Related papers
- Multi-Objective Structured Pruning of LLMs for Latency and Model Size Optimization
- MAVEN-T: Reinforced Heterogeneous Distillation for Real-Time Multi-Agent Trajectory Prediction
- Model Discovery Agent: LLM-assisted Bayesian experiment design for data-efficient discovery of mechanistic world models
- Embeddings for Preferences, Not Semantics
- Can We Trust Item Response Theory for AI Evaluation?
- Diagnosing Task Insensitivity in Language Agents