Re: What´s the algorithm that compresses a 20 digit big int, into 8 bytes ?

From: Bob Badour <bbadour_at_pei.sympatico.ca>
Date: Fri, 09 Apr 2010 16:05:01 -0300
Message-ID: <4bbf7a67$0$12427$9a566e8b_at_news.aliant.net>


Rafael Anschau wrote:

> On Apr 9, 2:18 pm, Bob Badour <bbad..._at_pei.sympatico.ca> wrote:
>

>>The proof is trivial. 20 decimal digits have 10^20 distinct values. 64
>>binary digits have 2^64 distinct values.
>>
>>10^20 > 2^64 > 10^19

>
> Sorry Bob, I haven´t expressed myself right. The proof that
> no *binary conversion* algorithm will ever do is trivial.
>
> My question is really theoretical, how can I demonstrate from a given
> set of accepted axioms, that no other algorithm(excluding binary
> conversion) will ever do it.
>
> Stuff like "convert and compress, compress by xamanic enlightenment,
> compression by reiki" or anything else.
>
> My understanding is that a proof on the subset of all binary
> conversion algorithms
> mathematically doesn´t transfer to the super set of all
> algorithms.Even though
> I intuitively know that´s true.
>
> But I understand this is way of topic, so I am off to comp.theory.
>
> Regards and thanks again,
>
> Rafael

The proof above has nothing to do with binary conversion algorithms or any other algorithms. It has to do with the counts of distinct values. Received on Fri Apr 09 2010 - 21:05:01 CEST

Original text of this message