Path: csiph.com!v102.xanadu-bbs.net!xanadu-bbs.net!feeder.erje.net!eu.feeder.erje.net!newsfeed.xs4all.nl!newsfeed1.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.029 X-Spam-Evidence: '*H*': 0.94; '*S*': 0.00; 'output': 0.05; 'true,': 0.05; 'texts.': 0.09; 'cc:addr:python-list': 0.11; 'bit.': 0.16; 'cc:name:python list': 0.16; 'janssen': 0.16; 'bit': 0.19; 'cc:addr:python.org': 0.22; 'cheers,': 0.24; 'cc:2**0': 0.24; 'source': 0.25; 'header:In-Reply-To:1': 0.27; 'function': 0.29; 'message-id:@mail.gmail.com': 0.30; 'subject:that': 0.31; 'could': 0.34; 'received:google.com': 0.35; 'clear': 0.37; 'eventually': 0.60; 'hope': 0.61; 'back': 0.62; 'such': 0.63; 'different': 0.65; 'hey,': 0.75; 'restore': 0.78 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=3YGaJIOKYfloHPfr4DOMUUPmBkJwXXDBmxIgYAdz2fs=; b=lid+evJBFldUMuQkqNhU+BWjgqEdoOeIaODs1lcB2s1Yr85e2ZkjnukhUNnJJ9BR7V 8Yovk7BYEye7U84JKJ0FTXayE0m3nO2Qwo5+fT1ftu73sPwZlKIDQYMzyQwfKzazz34F hX8wzXagDfUM8Y41XeiTdytSlTAM8rxq7MEjXdxELp14HdZ6C76LZEmqVcenXlBwqwEf oZb6uNf2/LxzHTtOUDDwGmmaVFM8/Z9U4BcMWcH87sac0xbxxm8JULVbZE1FcV97crEM cYADVJ5wdpya/jSt2gvmknxueP4uk9tvzsRyUECoYp7jKm87CoXTHYKExY7UTNKAVIb6 QTBA== MIME-Version: 1.0 X-Received: by 10.180.104.129 with SMTP id ge1mr6602959wib.6.1383428265702; Sat, 02 Nov 2013 14:37:45 -0700 (PDT) In-Reply-To: References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> Date: Sat, 2 Nov 2013 14:37:45 -0700 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: 14 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1383428272 news.xs4all.nl 15993 [2001:888:2000:d::a6]:50255 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:58349 > Let me try to get you to understand WHY what you say is impossible. Let's > say you do have a function f(x) that can produce a compressed output y for > any given x, such that y is always smaller than x. If that were true, then > I could call f() recursively: > f(f(...f(f(f(f(f(x)))))...)) > and eventually the result get down to a single bit. I hope it is clear > that there's no way to restore a single bit back into different source > texts. Hey, that's a nice proof! Cheers, Mark Janssen