Compression by descent - comp.compression

Message from discussion Compression by descent

Phil Carmody

View profile

More options Aug 10 2007, 7:23 pm

Newsgroups: comp.compression

From: Phil Carmody <thefatphil_demun...@yahoo.co.uk>

Date: 11 Aug 2007 02:23:02 +0300

Local: Fri, Aug 10 2007 7:23 pm

Subject: Re: Compression by descent

  Reply to author
  |
  Forward
  | Print
  | View thread
  | Show original
  | Report this message
  | Find messages by this author
  

Ashley Labowitz <sporecoun...@gmail.com> writes:
> Good day everyone,

Well it was a good day...

> I've been programming a technique that allows most, if not all files
> to be reduced in size.

You have not.

> It is done using cyclic roots and high-degree
> polynomials where the total information content of the coefficients is
> smaller (sometimes much smaller) than the original text.

No it's not.

> The FAQ has been pointed out to me where it "proves"

It's not just *called* a proof. It *is* a proof. If you think it's
not a proof, then you are a loon.

> that not all
> files can be compressed by any algorithm, but it seems to me that it
> has some mistakes.

Ergo you are a loon.

> They aren't serious, but they are oversights that
> prevent it from applying to fractal bits, permutations and sorting the
> bytes of the original file.

> The gist of this algorithm is that when certain polynomials are
> iterated over the complex plain (e.g., like the Mandelbrot set),
> information can be encoded in the "ragged" edges of the curve. I'm
> afraid this may have been done before, and I don't want to waste any
> work. Does it ring a bell to anyone?

Yes. I call it "compression by coincidence". You're about the
thousandth loon to pretend its got any merit at all. You won't
be the last.

> If someone would like to look at my pseudocode, I would be grateful.

I wouldn't.

Phil
--
Dear aunt, let's set so double the killer delete select all.
-- Microsoft voice recognition live demonstration

Reply to author Forward