All Topics
All Topics
Technology
Technology
Design
Design
Programming
Programming
Science
Science
News
News
Gaming
Gaming
Entertainment
Entertainment
Business
Business
Finance
Finance
Sports
Sports
Health
Health
Food
Food
Travel
Travel
Art
Art
Music
Music
Books
Books
Education
Education
Politics
Politics
Personal
Personal
Bluesky
Twitter
No algorithm. No AI slop. No ads. Just RSS. Pro-human. Indie writers. Real journalism. Open web. Chronological. Hand toasted.

NIST scientist uses Gödel's incompleteness theorems to prove AI systems cannot be made fully secure

By

Chad Boutin

8d ago· 5 min readenNews

Summary

A NIST senior scientist, Apostol Vassilev, has published a peer-reviewed paper in IEEE Security and Privacy using Gödel's incompleteness theorems to prove that AI systems cannot be made completely secure using conventional security models. The mathematical proof demonstrates that AI will always have vulnerabilities that adversaries can exploit, supporting the need for a continuous-monitor-and-update security model rather than attempting to achieve perfect, static security. This extends nearly century-old mathematical logic to modern AI systems.

Source

bskyNIST scientist uses Gödel's incompleteness theorems to prove AI systems cannot be made fully securenist.gov

Key quotes

· 3 pulled
Can we make artificial intelligence impervious to adversaries who want to twist the technology to nefarious ends?
Though AI is among the newest of technologies, the question's answer is nearly a century old.
Try as we might, we can never render AI completely unassailable using conventional security models.
Snippet from the RSS feed
The proof extends to AI the logic used by famed mathematician Kurt Gödel, whose incompleteness theorems have had a profound effect on math for nearly a century.

You might also wanna read