4 ms·
Sure, but in certain languages you can reason formally about them, and prove properties of them. It's not completely perfect, but particularly for relatively si
by darawk 8y ago
Sure, but in certain languages you can reason formally about them, and prove properties of them. It's not completely perfect, but particularly for relatively simple models you can get pretty high confidence in correctness, at least, up to certain invariance assumptions.
- WalterBright 8y agoProofs have bugs in them, too. Would you bet your life on them? Algorithms are also based on a model of reality. The models are usually wrong, too.
- darawk 8y agoYou bet your life on them all the time. Every time you cross a bridge. Medical devices rely on algorithms. The standard of evidence you're requesting here is unreasonable, and not applied in any other domain.