[40336] in cryptography@c2.net mail archive
Re: Impossible compression still not possible. [was RE: Debunking
daemon@ATHENA.MIT.EDU (John Denker)
Sun Sep 3 23:43:49 2006
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Wed, 30 Aug 2006 13:07:40 -0400
From: John Denker <jsd@av8n.com>
To: Dave Korn <dave.korn@artimi.com>
Cc: 'Ondrej Mikle' <ondrej.mikle@gmail.com>,
cryptography@metzdowd.com
In-Reply-To: <026c01c6cab5$ef9a8390$a501a8c0@CAM.ARTIMI.COM>
Dave Korn asked:
> Is it *necessarily* the case that /any/
> polynomial of log N /necessarily/ grows slower than N?
Yes.
Hint: L'Hôpital's rule.
> if P(x)==e^(2x)
That's not a polynomial.
x^Q is a polynomial. Q^x is not.
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
