26 (edited by Selur Ku 26-Aug-2008 21:59:22)

Re: The Harrington Compression Method (HCM) details

Is it possible to compress 2 random bits of data to 1 bit and be able to restore the 2 original bits without loss?

Of course not, thats plain for anyone to see.

likewise its not possible to compress all 8 bits files  of random data to 7bits .

and so on...

The counting argument is a mathematical proof, you haven't "disproved the counting argument" just because you say so.

If your magic compression method works then the fundamental rules of mathematics fall apart.

not very likely tongue

Re: The Harrington Compression Method (HCM) details

you COULD but you'd need a very sophisticated extrapolation program. If I'm sending 1 2 3 4 5 6 7 8 9 0
the opening/decoder would have to be able to know that 1234567880  was a botch, also 2234567890, 1234455890, etc.

I suppose if you put all your messages into iambic pentameter that would do it!

Flint!

You owe me 40% for that one!

The core joke of Hitchhiker's Guide to the Galaxy is that of course no civilization would develop personal computers with instant remote database recovery, and then waste this technology to find good drinks.
Steve Jobs has ruined this joke.

Re: The Harrington Compression Method (HCM) details

Selur Ku

That is an incorrect analogy

If you have 3 files, with a 1 or 2 bit value in each, you have 216 possible outcomes. 1 bit = 2, 2 bit = 4, add, each file is worth 6 points. Then 6^3.

This is almost how my system works.

In my system file #1 will ALWAYS represent an initial 44.4~% or more of the original file.

File #2 however can represent 0% to 55.6% of the file

File #3 can only represent a range between 0% to 33.3% of the original file.

This gives a new means to store data.

Variable file size via self generating files.

It can compress, it can store data.

Everything bad in the economy is now Obama's fault. Every job lost, all the debt, all the lost retirement funds. All Obama. Are you happy now? We all get to blame Obama!
Kemp currently not being responded to until he makes CONCISE posts.
Avogardo and Noir ignored by me for life so people know why I do not respond to them. (Informational)

Re: The Harrington Compression Method (HCM) details

Let me break this down into a real simple example

64 bits goes in.

Stage 1 increases it to 72 bits statistically

Stage 2 puts it in files, we then run file #1 again.

File #1 had 32 bits when put in, now it has 36 and is split into 3
subfiles.

1.1 has 16 bits
1.2 has 12 bits
1.3 has 8 bits

Now the ratio's:
File 1.1
93.75% to 6.25%.

File 1.2
80% to 20%

File 1.3
75% to 25%

File 1.1 comes out with a statistical 9.47 bits remaining.

File 1.2 comes out with a statistical 9.36 bits remaining

File 1.3 comes out with a statistical 6.75 bits remaining

This is 25.58 bits.

Compare this to the 28.44 bits that it would normally hold

Since this is repeatable upon any file (1.1, 1.2, 1.3, 2, 3 currently
in existance in this example) this means we can compress ALL files of
sufficient size.

If no matter what file #1 after being run through the system again is
smaller than what it went in as, we have proven compression of
entropic data.

Let me stress that again.

So long as 1.1, 1.2, 1.3 is smaller than file #1 was to begin with, we
have compression of random binary data.

I will stand by this to the end of my days, and be right always!

Everything bad in the economy is now Obama's fault. Every job lost, all the debt, all the lost retirement funds. All Obama. Are you happy now? We all get to blame Obama!
Kemp currently not being responded to until he makes CONCISE posts.
Avogardo and Noir ignored by me for life so people know why I do not respond to them. (Informational)

Re: The Harrington Compression Method (HCM) details

and that is why at the end of your days, you will still be a failure

LORD HELP OREGON

31 (edited by Selur Ku 27-Aug-2008 13:38:28)

Re: The Harrington Compression Method (HCM) details

Flint has been challenged by "Jym" on google compression groups yikes

OK. Then let's do the following bet.

******************************************
1/ The bet starts on Monday Spetember the first, 00:00 GMT.


2/ The bet pauses once you produce a program that implements HCM.


3/ The bet stops once a program implementing HCM has been checked to (for   
a given n of your choice)
     * Compress every n bits strings into a strictly less than n bits string
AND * Compress two different n bits strings in two different results.


4/ While the bet run and is not paused, you give me 1 euro each day.


5/ At the time the bet stops, I give you 1,000,000 euros.


******************************************


Will he take up the challenge?

Re: The Harrington Compression Method (HCM) details

oh BTW einstien
you might also wanna do the thing Yell mentioned, with mailing yourself the details, and keeping it seeled
the postage company's stamp with the date and such,[if the program works] will make sure you were the first one to come up with it..it will proove very usefull...if it doest actually work

and today's wednesday...wasn't today the day you were supposed to show the actual plan?

Re: The Harrington Compression Method (HCM) details

I showed it Tuesday, duh tongue

And the Patent Papers will prove beyond a doubt the exact same The Yell is talking about tongue

Everything bad in the economy is now Obama's fault. Every job lost, all the debt, all the lost retirement funds. All Obama. Are you happy now? We all get to blame Obama!
Kemp currently not being responded to until he makes CONCISE posts.
Avogardo and Noir ignored by me for life so people know why I do not respond to them. (Informational)

34 (edited by Phoenix Mailer 27-Aug-2008 20:44:51)

Re: The Harrington Compression Method (HCM) details

Einstein can u give me the answer to the following question - is it true that your algorithm can compress any string of length N to some string of lesser length M (M<N) ?
If the answer is yes then the 2nd question is - Is there a reverse algorithm that can decompress any compressed string of length M to its original string of lenght N ?

Re: The Harrington Compression Method (HCM) details

oh that Compression again...

in case you forgot ..
thats a basic proof i wrote like  3 years ago
http://www.daddelbande.de:7001/compress/

limitless compression not possible if you want to keep it lossless

Re: The Harrington Compression Method (HCM) details

lol Spooky your prove is very good and clear but i just dont understand why Einstein keeps on trying smile ? Did not he understand that it is impossible ?

Re: The Harrington Compression Method (HCM) details

Anyhow, we've seen this topic come up plenty of times and I've had enough with the flint bashing.

Regardless of whether or not it works (I'm no programmer so I can't comment) Flint has actually put some effort into trying to do something. More than what a lot of ppl do on a daily basis. Flint, best of luck to you and your theory. Whether it's a success, it may possibly be the ground work of someone else's success later.

Now anyone who wants to discuss it can debate the possibilities and ask for explanations but I don't want to see another insult. Otherwise, forum ban. Ty, have a nice day.

Sex without the e is still SX!

Re: The Harrington Compression Method (HCM) details

There is a difference between:

being determined to do something and putting effort in something
AND
-still continueing something while dozens of counter proofs have been provided.
-not being able to accept that there are people who are smarter than you and not accepting their advice
-still not accepting something won't work while basicly hundreds of people (including some very smart ones) showed you it's impossible
-still continueing something (which if it works would earn you millions) while you can't find a programmer willing to implement it despite them both being a millionaire if the programmer actually succeeded in it

I wasn't really insulting in my previous post, i was just trying to find an explanation for this kind of behaviour.

What do I have to work with?

Re: The Harrington Compression Method (HCM) details

It keeps him from playing this game... leave him in his denial.

This forum is stupid.

Re: The Harrington Compression Method (HCM) details

Ok to go over this.

1) Each step clearly leads to the next step, with no chance of a conflict like 2 results appearing to be one result, or visa versa.

2) The math shows that it can be done... which defies logic.

I will cover the math in as low a term as I can tonight

Everything bad in the economy is now Obama's fault. Every job lost, all the debt, all the lost retirement funds. All Obama. Are you happy now? We all get to blame Obama!
Kemp currently not being responded to until he makes CONCISE posts.
Avogardo and Noir ignored by me for life so people know why I do not respond to them. (Informational)

Re: The Harrington Compression Method (HCM) details

It must be noted that it should work the other way around too Flint.

4+5=9; but 9 can be fractured differently too!

God: Behold ye angels, I have created the ass.. Throughout the ages to come men and women shall grab hold of these and shout my name...

Re: The Harrington Compression Method (HCM) details

@Michael:
You need proof of concept. If you cannot find a programmer willing to do it for you then learn to program yourself, after all, what is a few extra months?

"So, it's defeat for you, is it? Someday I must meet a similar fate..."

Re: The Harrington Compression Method (HCM) details

All I want is for him to just make the damn thing and stop trying to gloat about having some awesome method. As the chans would put it, pix or it didn't happen.

Praise Kek

Re: The Harrington Compression Method (HCM) details

i can compress anything to one byte!!!



i can't retrieve it afterwards but that's not my concern!

What do I have to work with?

45 (edited by You_Fool 30-Aug-2008 22:34:00)

Re: The Harrington Compression Method (HCM) details

>>Wild Foolish Soul
    Forum Moderator<<

I claim copyright infringement!!!!! X( X( X(




oh and less importantly, didn't we go over this before? Haven't we decided that this is full of crap?


On another note, last time he posted a massive post explaining his concept as somesort of patent application via the IC forums i did show it to some friends of mine, computer software and electrical and electronic engineers, and they laughed... apparently this is a concept every 2nd year student will come up with and think they have made a startling discovery... it works well in theory, but apparently there are too many issues in reality that you never actually get compression, or full data recovery.


though main point, i demand compensation for use of my name!

"Sticks and stones may break my bones, but i am Jesus"
"Nothing is worse than a fully prepared fool"

46 (edited by TheYell 30-Aug-2008 23:12:43)

Re: The Harrington Compression Method (HCM) details

You're storing an awful lot of information in these command sections. I don't think you're taking the size of these into account. The huffman method is only viable when these command sections are smaller than the space gained by compression, this isn't the case here.

Therefore calling [baloney], and requesting a full mathematical proof.

(At the minute i'm sniggering at the lack of detail and liberal use of the word "statistically")

Also can I just point out that posting this on the internet is quite possibly the stupidest thing you could have done? Yes, you may have filed a patent, but if this turns out to be mathematically viable, any organisation in the world could set their top mathematicians on it, then with the aid of unlimited amounts of money, develop a slightly different method and fabricate a patent that claims they developed it in 2005?

On the plus side though, your surname is a good surname for having something named after it. The Harrington Method sounds very grand.

Avast Ye!!

Re: The Harrington Compression Method (HCM) details

UNfortunatly for flint this has been thought up before by countless people, as early as 2000, howevcer it is an entirely theoritical proof that works on paper but not in reality...

"Sticks and stones may break my bones, but i am Jesus"
"Nothing is worse than a fully prepared fool"

Re: The Harrington Compression Method (HCM) details

Oh, gutted.

Avast Ye!!