3 ms·

That's the great fallacy though. The amount of technical knowledge required to make truly informed security decisions is out of the question for 99% of all comp

That's the great fallacy though. The amount of technical knowledge required to make truly informed security decisions is out of the question for 99% of all computer/mobile users. It isn't about being passive; it's about having lives and jobs and other things to do with their time. A heart surgeon may be a genius but he doesn't have time to keep up with the latest research and teach himself PKI, certificates, crypto, and permission models across all the platforms he uses (and keep up to date on those too!) Users will not waste their time thinkin about trust. The history of our industry is ample evidence that it would be a losing battle. Not to mention a single mistake can be ruinous, requiring absolute perfection 100% of the time (from users and programmers).

nitrogen 11y ago
Not to mention a single mistake can be ruinous, requiring absolute perfection 100% of the time (from users and programmers). One can hope that, eventually, formally mathematically verified open source systems will help solve the issue, at least on the programming side.
- namplaa 11y ago
  I doubt the halting problem will be solved.
  - nitrogen 11y ago
    The solution to the halting problem is to stop building universal/Turing-complete machines. Edit: since this was downvoted, I will elaborate. The halting problem only applies to arbitrary programs on Turing-complete systems. It is possible to create useful systems that are not Turing complete. As a baseline example, it is easy to tell that the following Ruby program halts: exit Problems arise when one allows unbounded loops and unbounded recursion. If all loops and all recursions are provably finite, then a program can be proven to exit. All sorts of useful things can be done with systems composed of small, provably terminating programs. And it turns out, the vast majority (if not all) of the things relevant to securing a computer system can be implemented in formally provable ways.

nitrogen 11y ago

Not to mention a single mistake can be ruinous, requiring absolute perfection 100% of the time (from users and programmers). One can hope that, eventually, formally mathematically verified open source systems will help solve the issue, at least on the programming side.

namplaa 11y ago
I doubt the halting problem will be solved.
- nitrogen 11y ago
  The solution to the halting problem is to stop building universal/Turing-complete machines. Edit: since this was downvoted, I will elaborate. The halting problem only applies to arbitrary programs on Turing-complete systems. It is possible to create useful systems that are not Turing complete. As a baseline example, it is easy to tell that the following Ruby program halts: exit Problems arise when one allows unbounded loops and unbounded recursion. If all loops and all recursions are provably finite, then a program can be proven to exit. All sorts of useful things can be done with systems composed of small, provably terminating programs. And it turns out, the vast majority (if not all) of the things relevant to securing a computer system can be implemented in formally provable ways.