Path: csiph.com!usenet.pasdenom.info!weretis.net!feeder1.news.weretis.net!feeder.erje.net!eu.feeder.erje.net!news-2.dfn.de!news.dfn.de!npeer.de.kpn-eurorings.net!npeer-ng0.de.kpn-eurorings.net!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: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.021 X-Spam-Evidence: '*H*': 0.96; '*S*': 0.00; 'anyway.': 0.05; 'bits': 0.09; 'patent': 0.09; 'received:80.91': 0.09; 'received:80.91.229': 0.09; 'received:gmane.org': 0.09; 'received:list': 0.09; 'refresh': 0.09; 'received:80.91.229.3': 0.16; 'received:plane.gmane.org': 0.16; 'skip:6 30': 0.16; 'wrote:': 0.18; 'working.': 0.19; 'memory': 0.22; 'header:User- Agent:1': 0.23; 'byte': 0.24; 'mon,': 0.24; 'values': 0.27; 'header:X-Complaints-To:1': 0.27; 'header:In-Reply-To:1': 0.27; 'tim': 0.29; 'subject:that': 0.31; 'file': 0.32; 'another': 0.32; 'implemented': 0.33; 'but': 0.35; 'there': 0.35; 'machine.': 0.36; 'possible': 0.36; 'so,': 0.37; 'two': 0.37; 'nov': 0.38; 'to:addr :python-list': 0.38; 'explain': 0.39; 'to:addr:python.org': 0.39; 'received:org': 0.40; 'office': 0.60; 'tell': 0.60; 'ago.': 0.61; 'lost': 0.61; 'email addr:gmail.com': 0.63; 'yes': 0.68; 'subjectcharset:utf-8': 0.72; 'from.': 0.93; 'received:108': 0.93; '2013': 0.98 X-Injected-Via-Gmane: http://gmane.org/ To: python-list@python.org From: Dave Angel Subject: =?UTF-8?Q?Re:_Algorithm_that_makes_maximum_com?= =?UTF-8?Q?pression_of_completly_diffused=0A_data.?= Date: Mon, 04 Nov 2013 08:27:19 -0600 References: <205bfa4f-29de-43de-be5a-72a12d77d0c9@googlegroups.com> <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit X-Gmane-NNTP-Posting-Host: pool-108-12-92-205.hstntx.dsl-w.verizon.net In-Reply-To: <9d998707-a6e9-4911-a585-c2310e4a2b31@googlegroups.com> User-Agent: Groundhog Newsreader for Android 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: 54 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1383575253 news.xs4all.nl 15993 [2001:888:2000:d::a6]:43407 X-Complaints-To: abuse@xs4all.nl Xref: csiph.com comp.lang.python:58445 On Mon, 4 Nov 2013 05:53:28 -0800 (PST), jonas.thornvall@gmail.com wrote: > Den lördagen den 2:e november 2013 kl. 22:31:09 UTC+1 skrev Tim Roberts: > > Here's another way to look at it. If f(x) is smaller than x for every x, > > that means there MUST me multiple values of x that produce the same f(x). > > Do you see? If x is three bits and f(x) is two bits, that means there are > > 8 possible values for x but only 4 values for f(x). So, given an f(x), y= > > cannot tell which value of x it came from. You have lost information. > 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 > Yes i am aware that 256 is a single byte 8 bits, but the approach is valid = > anyway. And e ^ (I * pi) == -1 So what. ? Better file that patent, before the patent office realizes the analogy to the perpetual motion machine. -- DaveA