General-purpose agents cannot be fully safety-verified
No algorithm can guarantee that a language-model agent paired with a general-purpose computer will avoid a dangerous program, so guardrails, blacklists, whitelists, and certifications can only provide imperfect safety. The paper shows that bounded agents are technically decidable but still PSPACE-complete to analyze. It also finds that separately safe agents can become unsafe when combined, breaking safety checks based on components alone.