Re: Algorithm that makes maximum compression of completly diffused data.

Path	csiph.com!usenet.pasdenom.info!weretis.net!feeder1.news.weretis.net!feeder4.news.weretis.net!feeds.phibee-telecom.net!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail
Return-Path	<timr@probo.com>
X-Original-To	python-list@python.org
Delivered-To	python-list@mail.python.org
X-Spam-Status	OK 0.005
X-Spam-Evidence	'H': 0.99; 'S': 0.00; 'compact': 0.09; 'refresh': 0.09; 'cc:addr:python-list': 0.11; 'cc:name:python list': 0.16; 'equation': 0.16; 'exponential': 0.16; 'janssen': 0.16; 'sequence,': 0.16; 'skip:6 30': 0.16; 'subject: \n ': 0.16; 'wrote:': 0.18; 'result.': 0.19; 'working.': 0.19; '>>>': 0.22; 'input': 0.22; 'memory': 0.22; 'cc:addr:python.org': 0.22; 'header :User-Agent:1': 0.23; 'cc:2**0': 0.24; 'header:In-Reply-To:1': 0.27; 'idea': 0.28; 'tim': 0.29; 'that.': 0.31; 'subject:that': 0.31; 'becomes': 0.33; 'implemented': 0.33; 'noticed': 0.34; 'could': 0.34; 'problem': 0.35; 'but': 0.35; 'explain': 0.39; 'number,': 0.60; 'ago.': 0.61; 'to:addr:gmail.com': 0.65
Date	Thu, 7 Nov 2013 11:22:45 -0800
From	Tim Roberts <timr@probo.com>
Organization	Providenza & Boekelheide, Inc.
User-Agent	Mozilla/5.0 (Windows NT 6.1; WOW64; rv:24.0) Gecko/20100101 Thunderbird/24.1.0
MIME-Version	1.0
To	Mark Janssen <dreamingforward@gmail.com>
Subject	Re: Algorithm that makes maximum compression of completly diffused data.
References	<205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> <mailman.1835.1383162420.18130.python-list@python.org> <c73c8aa6-cac4-4f02-ae83-31cea167c172@googlegroups.com> <s9ra79dvvnd01rpuqg9hfh6bija8u2q49h@4ax.com> <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> <q7im799jqj9ap3jb94lnqka1m0hnn9bnpv@4ax.com> <CAMjeLr8jao50FSqM9pT=77in0nPNCOA8SQwHC_Jm50eiQYTs+g@mail.gmail.com>
In-Reply-To	<CAMjeLr8jao50FSqM9pT=77in0nPNCOA8SQwHC_Jm50eiQYTs+g@mail.gmail.com>
X-Enigmail-Version	1.6
Content-Type	text/plain; charset="ISO-8859-1"
Content-Transfer-Encoding	7bit
X-Brightmail-Tracker	H4sIAAAAAAAAC+NgFjrJosTGxXJgxQEeXd4X1UEGG5ZMM7J48L6TxaKnv4/FgSmAIYo1My8pvyKBNePRtklMBbNZK3p2X2BrYJzE0sXIxSEksIxR4vKrhcxdjJwcvAJqEtfnP2fqYuTgYBFQkVi/nwXEZBNQkpi22xSkgl9AR+LK6e+MILaoQJTEw9nToDoFJU7OfMICYosA1SzbuokdxGYW0JCYt/A7WFxYIFhi1rlF7BBrO5klVjV+BiviFAiU+DR/JyPILgkBcYmexiCIXj2JKVdbGCFseYntb+eA7RISkJb4s+YQWFwCqPXinWYWCNtcYtPVJ+wQtrbE9lf7WCFsHYmTU46wTmAUmYXk1FlIVsxCsmIBI/MqRgFXZw9/vYKi/KR8vZz85MScTYyQYGbawXhql/UhRkkOJiVR3qNPq4OE+JLyUyozEosz4otKc1KLDzFKcPAoifCuBMnxFhck5hZnpsOkZDg4lCR4PZ4BpQSLUtNTK9Iyc0pSiyDSpxglpcR5k0CSAiB9GaV5cLlLjKJSwry2T4ByPAWpRbmZJRDxW4zCHA+ZhFjy8vNSpYBOZAACDcZXjOIcjErCvDogs3gy80rgTngFdB0T0HUhvypBritJREhJNTBGrZTam7DzeLfUl69S/97eE5yglfTP6P/afQuuRarp9abcWcN8be9tjWBvfdfrt31e/77HsIpXelfTjzlWv8PecwZ5Rx5b8qrW3Uo36YRbglpafLr3xoIQocuX4k1d/0zfq9WrIqzG8dBnHnf+djkTkeCX12eZ/DoeFyWw723/kXtHcvh40kSVWIozEg21mIuKEwF/OXit3AIAAA==
Cc	Python List <python-list@python.org>
X-BeenThere	python-list@python.org
X-Mailman-Version	2.1.15
Precedence	list
List-Id	General discussion list for the Python programming language <python-list.python.org>
List-Unsubscribe	<https://mail.python.org/mailman/options/python-list>, <mailto:python-list-request@python.org?subject=unsubscribe>
List-Archive	<http://mail.python.org/pipermail/python-list/>
List-Post	<mailto:python-list@python.org>
List-Help	<mailto:python-list-request@python.org?subject=help>
List-Subscribe	<https://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe>
Newsgroups	comp.lang.python
Message-ID	<mailman.2152.1383852240.18130.python-list@python.org> (permalink)
Lines	17
NNTP-Posting-Host	2001:888:2000:d::a6
X-Trace	1383852240 news.xs4all.nl 15997 [2001:888:2000:d::a6]:35058
X-Complaints-To	abuse@xs4all.nl
Xref	csiph.com comp.lang.python:58694

Show key headers only | View raw

Mark Janssen wrote:
>>> Well let me try to explain why it is working and i have implemented one.
>>> I only need to refresh my memory it was almost 15 years ago.
>>> This is not the solution but this is why it is working.
>>> 65536=256^2=16^4=***4^8***=2^16
>>
>> I think the idea is that you could take any arbitrary input sequence,
>> view it as a large number, and then find what exponential equation can
>> produce that result.  The equation becomes the "compression".

Interesting -- I hadn't noticed that.  Of course, now you have the
problem of expressing 4^8 in a compact way.

-- 
Tim Roberts, timr@probo.com
Providenza & Boekelheide, Inc.

Thread

csiph-web