Path: csiph.com!usenet.pasdenom.info!aioe.org!news.stack.nl!newsfeed.xs4all.nl!newsfeed4.news.xs4all.nl!xs4all!newsgate.cistron.nl!newsgate.news.xs4all.nl!post.news.xs4all.nl!not-for-mail Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.032 X-Spam-Evidence: '*H*': 0.94; '*S*': 0.00; 'compact': 0.09; 'equation': 0.16; 'exponential': 0.16; 'from:addr:rosuav': 0.16; 'from:name:chris angelico': 0.16; 'janssen': 0.16; 'notation': 0.16; 'sequence,': 0.16; 'wrote:': 0.18; 'result.': 0.19; 'input': 0.22; 'header:In-Reply-To:1': 0.27; 'idea': 0.28; 'am,': 0.29; 'message-id:@mail.gmail.com': 0.30; 'idea,': 0.31; 'subject:that': 0.31; 'becomes': 0.33; 'fri,': 0.33; 'could': 0.34; 'but': 0.35; 'received:google.com': 0.35; 'representing': 0.36; 'nov': 0.38; 'to:addr:python-list': 0.38; 'anything': 0.39; 'to:addr:python.org': 0.39; 'how': 0.40; 'number,': 0.60; 'skip:2 20': 0.60; '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:date:message-id:subject:from:to :content-type; bh=dHM/R9l0OZG7RQGH3Qmh9l3dp/RC5dhGrfbGRDHp4No=; b=Pdd5YbtOrMnPaM0dwG9g6RfBgAXkAwXsxkEhao3leKWHrSNLI0r1phQVMwrSBlxHe0 GQ9jYz6NGjYPFi4/UrnjUYrcwpQfltjeAOf5dVj6EIJLfkF7onp4sM0yt2K06IvAA7YQ DSeDC5v8u8OTB2zE5j1Xa7n9yEsBjJrv6EpaOKGiM6RWCDXaDJGKUEiAzyDIpWO1Q4xB e7OD9zmg8L6c6wWQux/gM/8GvP2YA7SPus3SVM5JAwIZflotrl1N8IRpduTAA8C3QQKx mwYyXVXEc10llzXApt+w6SijJQjKe/bds9cWMrdDhWjhxfqg/nD61tzFeUdPvauzOsRU Fd3A== MIME-Version: 1.0 X-Received: by 10.66.26.236 with SMTP id o12mr12160819pag.136.1383863205879; Thu, 07 Nov 2013 14:26:45 -0800 (PST) In-Reply-To: References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> Date: Fri, 8 Nov 2013 09:26:45 +1100 Subject: Re: Algorithm that makes maximum compression of completly diffused data. From: Chris Angelico To: 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 List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , Newsgroups: comp.lang.python Message-ID: Lines: 11 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1383863216 news.xs4all.nl 15871 [2001:888:2000:d::a6]:46359 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:58708 On Fri, Nov 8, 2013 at 5:59 AM, Mark Janssen wrote: > 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 idea, but I don't see how this has anything to do with compressing arbitrary data. We already have a compact notation for representing a large number as 2^24*x+2^16*y+2^8*z+q, so I don't see how this will be any better, other than eliding NULs. ChrisA