4 ms·
Importantly, this is only true if you also want to be correct when you say "unsafe." The entire field of static analysis exists and happily moves along solving
by UncleMeat 3y ago
Importantly, this is only true if you also want to be correct when you say "unsafe."
The entire field of static analysis exists and happily moves along solving undecidable problems in practical ways every single day. There are just some false positives or false negatives (or both) depending on how you choose to design a system.
"Does this program ever encounter a typing error at runtime" is an undecidable problem. Yet we have type systems baked right into our compilers that happily reject all programs that might encounter a typing an error at runtime. They just also reject some other programs too.
- dreamcompiler 3y agoThe way I frame this is that the Halting Problem doesn't say you cannot prove any properties of any program with static analysis. It merely says you cannot prove all properties for all programs. This is often misunderstood. Static analysis can indeed prove many useful properties of many useful programs. Likewise, you can eliminate many "unsafe" utterances from LLMs; you just can never eliminate all of them.