Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re^6: Comparative satisfiability of regexps.

by Meowse (Beadle)
on Jan 21, 2005 at 01:12 UTC ( [id://423859]=note: print w/replies, xml ) Need Help??


in reply to Re^5: Comparative satisfiability of regexps.
in thread Comparative satisfiability of regexps.

Indeed, I should have said, "In reasoning about formal logic, and algorithm design in particular, there's almost always a formal proof of correctness available." And even then, one must keep in mind Knuth's famous, "Be careful in using this algorithm. I have only proven it correct, not tested it."

But statistical proof is, IMHO, no proof at all. It is at best evidence.

Take care,

Mickey.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://423859]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (9)
As of 2024-03-28 14:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found