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.
-
On 28 August 2006 15:30, Ondrej Mikle wrote:
Ad. compression algorithm: I conjecture there exists an algorithm (not
necessarily *finite*) that can compress large numbers
(strings/files/...) into small space, more precisely, it can
compress number that is N bytes long into O(P(log N)) bytes,
We are both talking about the same thing :-)
I am not saying there is a finite deterministic algorithm to compress
every string into small space, there isn't. BTW, thanks for There
is ***NO*** way round the counting theory. :-)
All I wanted to say is:
For a specific structure (e.g. movie,
On 28 August 2006 17:12, Ondrej Mikle wrote:
We are both talking about the same thing :-)
Oh!
I am not saying there is a finite deterministic algorithm to compress
every string into small space, there isn't. BTW, thanks for There
is ***NO*** way round the counting theory. :-)
All I
