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

Path	csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!goblin3!goblin1!goblin.stu.neva.ru!uio.no!news.tele.dk!news.tele.dk!small.news.tele.dk!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail
Return-Path	<ian.g.kelly@gmail.com>
X-Original-To	python-list@python.org
Delivered-To	python-list@mail.python.org
X-Spam-Status	OK 0.096
X-Spam-Evidence	'H': 0.83; 'S': 0.02; 'algorithm': 0.04; 'encoding': 0.05; 'compact': 0.09; 'encode': 0.09; 'cryptic': 0.16; 'guessing': 0.16; 'wrote:': 0.18; 'all,': 0.19; 'initial': 0.24; 'header:In-Reply-To:1': 0.27; 'am,': 0.29; 'message- id:@mail.gmail.com': 0.30; "i'm": 0.30; 'subject:that': 0.31; 'fri,': 0.33; 'but': 0.35; 'received:google.com': 0.35; 'impression': 0.36; 'should': 0.36; 'starting': 0.37; 'nov': 0.38; 'to:addr:python-list': 0.38; 'to:addr:python.org': 0.39; 'how': 0.40; 'details.': 0.61; 'simply': 0.61; 'such': 0.63; 'skip:n 10': 0.64; 'more': 0.64; 'algorithm,': 0.84; 'mistaken': 0.84; 'whereas': 0.91; '2013': 0.98
DKIM-Signature	v=1; a=rsa-sha256; c=relaxed/relaxed; d=gmail.com; s=20120113; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :content-type; bh=K//nMpPstBQjzACrjFG7emxPpeIpI5nYZc2Njv4bD/c=; b=YXBZDYRL+Z9WdPpE1lnxDqLxPxuBLPi2444TsYqBmB1lgaPwtrOX0T/rUImshddfWJ ksaDfxd085rZ1mcNYYBgjsrVp0z9oxui+0t4e3H2+kuHjcjhBlJcRpQuoYR/nXQett2p oRS7u+ikXBcBh7R7O4hEr7leIQPJxcedGNKWsUen239vQSBPYYc1jEBG8enGRyZIL90o PRA56txNAR9AF27bi5XI3DxtGw7TIIjIGVy9GGGVYl5wWeVLYot8GbdghjiHtQ7P7Bwf sesYzX4v40GMA5J6wTG7xcPkavg2cFK3F1VQ5zBelNydohVXEOswOwVAzue8fr4oIzL0 p/Tg==
X-Received	by 10.68.197.234 with SMTP id ix10mr16404085pbc.185.1383936559045; Fri, 08 Nov 2013 10:49:19 -0800 (PST)
MIME-Version	1.0
In-Reply-To	<992d347f-8e90-4c6b-b9e0-e539272f9721@googlegroups.com>
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> <mailman.2161.1383863216.18130.python-list@python.org> <9b62770c-7ca1-4a4d-81a5-bf7251bac957@googlegroups.com> <mailman.2171.1383877064.18130.python-list@python.org> <13c04f06-f1f2-4f67-b975-3cff28714641@googlegroups.com> <CAPTjJmpkHUQEXH8E0c8athUs8RNCEFuNVj8jDoi-zYm8+qKcnQ@mail.gmail.com> <mailman.2178.1383878604.18130.python-list@python.org> <992d347f-8e90-4c6b-b9e0-e539272f9721@googlegroups.com>
From	Ian Kelly <ian.g.kelly@gmail.com>
Date	Fri, 8 Nov 2013 11:48:38 -0700
Subject	Re: Algorithm that makes maximum compression of completly diffused data.
To	Python <python-list@python.org>
Content-Type	text/plain; charset=ISO-8859-1
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.2242.1383936569.18130.python-list@python.org> (permalink)
Lines	10
NNTP-Posting-Host	2001:888:2000:d::a6
X-Trace	1383936569 news.xs4all.nl 15998 [2001:888:2000:d::a6]:36848
X-Complaints-To	abuse@xs4all.nl
Xref	csiph.com comp.lang.python:58837

Show key headers only | View raw

On Fri, Nov 8, 2013 at 8:48 AM,  <jonas.thornvall@gmail.com> wrote:
> 3^2-2^2=5

How do you intend to encode 3**2 - 2**2 in such a way that it is more
compact than simply encoding 5?  If you actually have an algorithm,
you should share it instead of dropping these cryptic one-line
non-explanations and leaving us guessing about the details.  But I'm
starting to think that you don't actually have an algorithm at all,
whereas my initial impression was that you did and were simply
mistaken about its effectiveness.

Thread

csiph-web