--------------------------------<snip>-------------------------------
The formal proof applies to PKZIP regardless of its internal complexity.
While your statement sounds plausible, it's not compelling.
If you treat PKZIP as a black box.
IE: data in -- compressed out.
Then the formal proof still applies.
If I remember my Computing. Theory correctly, from the mid-1970's, the exact
algorithm is not a fundamental part of the proof.
-----------------------------------<unsnip>---------------------------------
I'm a "results oriented" guy; formal proofs, elegant or otherwise, don't
"float my boat" anywhere near as well as concrete results that I can
quantify. :-)
Rick
---
Accept the fact that some days you're the pigeon, other days you're the
statue.
----------------------------------------------------------------------
For IBM-MAIN subscribe / signoff / archive access instructions,
send email to [email protected] with the message: GET IBM-MAIN INFO
Search the archives at http://bama.ua.edu/archives/ibm-main.html
