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.044 X-Spam-Evidence: '*H*': 0.91; '*S*': 0.00; 'refresh': 0.09; 'cc:addr :python-list': 0.11; 'cc:name:python list': 0.16; 'equation': 0.16; 'exponential': 0.16; 'sequence,': 0.16; 'result.': 0.19; 'working.': 0.19; 'input': 0.22; 'memory': 0.22; 'cc:addr:python.org': 0.22; 'cc:2**0': 0.24; 'values': 0.27; 'header:In-Reply-To:1': 0.27; 'idea': 0.28; 'message- id:@mail.gmail.com': 0.30; 'subject:that': 0.31; 'becomes': 0.33; 'implemented': 0.33; 'could': 0.34; 'but': 0.35; 'received:google.com': 0.35; 'explain': 0.39; 'number,': 0.60; 'ago.': 0.61; 'believe': 0.68; 'same,': 0.91; 'washington': 0.93 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 :cc:content-type; bh=CSF5FyDO5q0LKLiBZH8wGBSBqxeFK2jxVxNTXPb/Erw=; b=F5cJSggTxV09NAGhC2oaw7iJReBzHeFGUA5Dzs/v5IYGQiQVMqrX3YQPleAXnI2Sgm Gan6g6mfkV+byevWuZWYeog/T+3EiaDx7a+88B9CRI+cUIrowT9Qyf8Tyc3u7ZjzMRVY qRUqA1Ut2h8GSr/kCvpxQZbkzU7bycGztMZ9o1Uz8Op3cVMpZZAKeQ9JdLXdZTwjS8qB OSih0fXxcnWA7VAMpDRHYvoQ8lkgX58Te8Q8CEOsGizuFJ0w44Zof9w/yOGkakanzEOl qu1MU6waRMjYQPtMa5DVeqg9ZC7j5zkKmZEbBhQklWcz+mvX2lFdp/jnT41WCHCf0pOr aBdg== MIME-Version: 1.0 X-Received: by 10.180.189.80 with SMTP id gg16mr3970503wic.32.1383850783141; Thu, 07 Nov 2013 10:59:43 -0800 (PST) In-Reply-To: References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> Date: Thu, 7 Nov 2013 10:59:43 -0800 Subject: Re: Algorithm that makes maximum compression of completly diffused data. From: Mark Janssen To: Tim Roberts Content-Type: text/plain; charset=ISO-8859-1 Cc: Python List 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: 15 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1383850790 news.xs4all.nl 15958 [2001:888:2000:d::a6]:49222 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:58690 >>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 > > All of those values are indeed the same, and yet that is completely > unrelated to compression. Did you honestly believe this was actually > explaining anything? 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". MarkJ Tacoma, Washington