The stupid question is the question not asked | |
PerlMonks |
Re^5: Comparative satisfiability of regexps.by BrowserUk (Patriarch) |
on Jan 20, 2005 at 16:09 UTC ( [id://423723]=note: print w/replies, xml ) | Need Help?? |
In programming in particular, there's almost always a formal proof of correctness available. I have to counter that statement. Formal proof of a computer program's correctness is not possible. and anyone suggesting to you that it is, is not a scientist, but a snakeoil salesman. Formal proof of an algorithm is possible. And you can certify a particular implementation on a particular hardware setup--with the use of comprehensive and rigorous testing--provided the domain and range of every variable can be determined and catagorised. But it had best be a very important, and probably very simple program. Any other kind of "proof" is either statistical or snakeoil. Examine what is said, not who speaks.
Silence betokens consent.
Love the truth but pardon error.
In Section
Seekers of Perl Wisdom
|
|