Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

It can be proven false



Awesome! How?


It is possible to prove that a piece of code matches a given mathematical specification. That spec has to be good though, and there can still be hardware failures (e.g. bitflips), problems with the environment (if not proven correct as well), and more. It theoretically is possible though that way to at least 100% secure a not-too-complex piece of software by itself (without hardware).


Are we asking for the mathmatical answer (which I cant provide) or the practical answer (which most of us may take a stab at).




Consider applying for YC's Fall 2025 batch! Applications are open till Aug 4

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: