Algorithm that makes maximum compression of completly diffused data.
Chris Angelico
rosuav at gmail.com
Fri Nov 8 04:05:55 CET 2013
On Fri, Nov 8, 2013 at 1:43 PM, Mark Janssen <dreamingforward at gmail.com> wrote:
>>> I am not sure if it is just stupidness or laziness that prevent you from seeing that 4^8=65536.
>>
>> I can see that 4^8 = 65536. Now how are you going to render 65537? You
>> claimed that you could render *any* number efficiently. What you've
>> proven is that a small subset of numbers can be rendered efficiently.
>
> I think the idea would be to find the prime factorization for a given
> number, which has been proven to be available (and unique) for any and
> every number. Most numbers can compress given this technique. Prime
> numbers, of course, would not be compressed.
Also an interesting theory.
1) How do you represent the prime factors?
2) How do you factor large numbers efficiently? Trust me, if you've
solved this one, there are a *LOT* of people who want to know. People
with money, like Visa.
3) Still doesn't deal with all possible numbers.
ChrisA
More information about the Python-list
mailing list