Compression - Re: Recursive Compression Method -- Eureka!!

You are viewing an archived Text-only version of the thread. To view this thread in it's original format and/or if you want to reply to this thread please [click here]

Author

Re: Recursive Compression Method -- Eureka!!

Sachin Garg

2006-05-09, 6:55 pm

Erik Evenson wrote:
> For your consideration:
>
> Recursive compression must occur on a bit by bit basis.
> Compession is easy; decompression is hard.
> A recursive compression method must have an implicit
> way to store overhead in order to defeat the Counting Theorem.
[All details snipped]

"defeat the Counting Theorem"?

This is where I stopped reading.

But I promise you that I will come back and read this complete post,
all its replies and all the upcoming threads on this topic as soon as
you, or someone else, says that they have a working implementation
which proves this.

btw, if this is million dollar idea, why waste time trying to convince
everyone here. They are too dumb to ever take you seriously. Find a way
to implement it, sell it, and live a happy life ever after...

Best of luck.

Sponsored Links