No finite formal verifier can certify all policy-compliant AI instances of arbitrarily high Kolmogorov complexity.
ISBN 978-3-642-14623-7
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Incompleteness of AI Safety Verification via Kolmogorov Complexity
No finite formal verifier can certify all policy-compliant AI instances of arbitrarily high Kolmogorov complexity.