Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #45921
| Path | csiph.com!usenet.pasdenom.info!gegeweb.org!de-l.enfer-du-nord.net!feeder2.enfer-du-nord.net!feeds.phibee-telecom.net!newsfeed.xs4all.nl!newsfeed3.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail |
|---|---|
| Return-Path | <carlosnepomuceno@outlook.com> |
| X-Original-To | python-list@python.org |
| Delivered-To | python-list@mail.python.org |
| X-Spam-Status | OK 0.031 |
| X-Spam-Evidence | '*H*': 0.94; '*S*': 0.00; 'algorithm': 0.04; 'kind,': 0.05; 'tests.': 0.07; 'variables': 0.07; 'imply': 0.09; 'subtle': 0.09; 'subject:question': 0.10; 'suggest': 0.14; 'random': 0.14; "wouldn't": 0.14; '24,': 0.16; '5:00': 0.16; 'behavior,': 0.16; 'cheaper.': 0.16; 'correlation': 0.16; 'interval,': 0.16; 'iteration': 0.16; 'means.': 0.16; 'nodes': 0.16; 'sequence,': 0.16; 'subject: \n ': 0.16; 'when,': 0.16; 'wrote:': 0.18; 'bit': 0.19; 'to:name:python-list@python.org': 0.22; 'mathematical': 0.24; 'precise': 0.24; 'received:65.55.116': 0.24; 'question': 0.24; 'header:In-Reply-To:1': 0.27; 'skip:- 40': 0.29; 'related': 0.29; 'usually': 0.31; 'concern.': 0.31; 'run': 0.32; 'fri,': 0.33; 'date:': 0.34; "can't": 0.35; 'connection': 0.35; 'there': 0.35; 'sequence': 0.36; 'subject:Simple': 0.36; 'should': 0.36; 'email addr:python.org': 0.37; 'being': 0.38; 'somebody': 0.38; 'to:addr:python-list': 0.38; 'pm,': 0.38; 'that,': 0.38; 'does': 0.39; 'subject:': 0.39; 'to:addr:python.org': 0.39; 'how': 0.40; 'skip:u 10': 0.60; 'is.': 0.60; 'negative': 0.60; 'then,': 0.60; 'simple': 0.61; 'email addr:gmail.com': 0.63; 'show': 0.63; 're:': 0.63; 'happen': 0.63; 'more': 0.64; 'taking': 0.65; 'email name :python-list': 0.65; 'series': 0.66; 'world': 0.66; 'between': 0.67; 'close': 0.67; 'it!': 0.67; 'believe': 0.68; 'fact,': 0.69; 'effects,': 0.84; 'recognition': 0.84; 'updated,': 0.84; 'carlos': 0.91; 'simulation': 0.91; '2013': 0.98 |
| X-TMN | [TW5tpffNE2OJEFdFRg31b2/VKlwSe2+x] |
| X-Originating-Email | [carlosnepomuceno@outlook.com] |
| From | Carlos Nepomuceno <carlosnepomuceno@outlook.com> |
| To | "python-list@python.org" <python-list@python.org> |
| Subject | RE: Simple algorithm question - how to reorder a sequence economically |
| Date | Sat, 25 May 2013 00:33:01 +0300 |
| Importance | Normal |
| In-Reply-To | <358d5be7-87e8-4655-82ba-859786cc3d47@l3g2000vbl.googlegroups.com> |
| References | <358d5be7-87e8-4655-82ba-859786cc3d47@l3g2000vbl.googlegroups.com> |
| Content-Type | text/plain; charset="iso-8859-1" |
| Content-Transfer-Encoding | quoted-printable |
| MIME-Version | 1.0 |
| X-OriginalArrivalTime | 24 May 2013 21:33:02.0002 (UTC) FILETIME=[44B84920:01CE58C6] |
| 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 | <http://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 | <http://mail.python.org/mailman/listinfo/python-list>, <mailto:python-list-request@python.org?subject=subscribe> |
| Newsgroups | comp.lang.python |
| Message-ID | <mailman.2080.1369431189.3114.python-list@python.org> (permalink) |
| Lines | 44 |
| NNTP-Posting-Host | 2001:888:2000:d::a6 |
| X-Trace | 1369431189 news.xs4all.nl 16002 [2001:888:2000:d::a6]:34822 |
| X-Complaints-To | abuse@xs4all.nl |
| Xref | csiph.com comp.lang.python:45921 |
Show key headers only | View raw
---------------------------------------- > Date: Fri, 24 May 2013 12:01:35 -0700 > Subject: Re: Simple algorithm question - how to reorder a sequence economically > From: peter.h.m.brooks@gmail.com > To: python-list@python.org > > On May 24, 5:00 pm, Carlos Nepomuceno <carlosnepomuc...@outlook.com> > wrote: >> >> >> I don't know what "spurious evidence of correlation" is. Can you give a mathematical definition? >> > If I run the simulation with the same sequence, then, because event E1 > always comes before event E2, somebody might believe that there is a > causative connection between them in the world that's being simulated, > when, in fact, they only correlate in this way because the sequence is > not being shuffled. That's what it means. Correlation does not imply causation. If "somebody" is an expert system and you want to avoid it's recognition and/or triggering of some kind, and you can't or don't want to change it's behavior, you may take the random way because it's cheaper. > Actually it'll be a bit more subtle than that, because each iteration > of the simulation updates all nodes in one time interval, the events > will not usually show the order of iteration - but, where there are > any secondary effects, that are related to the order in which the > nodes are updated, these will always happen the same way, which is my > concern. You should have a more precise understanding of the dependence of the variables you taking in consideration before randomizing the series of events your are using for tests. I suggest you start using PPMCC. If it's close to zero or negative you wouldn't have to mind about it! ;)
Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 01:14 -0700
Re: Simple algorithm question - how to reorder a sequence economically Chris Angelico <rosuav@gmail.com> - 2013-05-24 18:37 +1000
Re: Simple algorithm question - how to reorder a sequence economically Fábio Santos <fabiosantosart@gmail.com> - 2013-05-24 09:47 +0100
Re: Simple algorithm question - how to reorder a sequence economically Chris Angelico <rosuav@gmail.com> - 2013-05-24 19:11 +1000
Re: Simple algorithm question - how to reorder a sequence economically duncan smith <buzzard@invalid.invalid> - 2013-05-24 15:33 +0100
Re: Simple algorithm question - how to reorder a sequence economically Terry Jan Reedy <tjreedy@udel.edu> - 2013-05-24 06:10 -0400
Re: Simple algorithm question - how to reorder a sequence economically Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2013-05-24 10:52 +0000
Re: Simple algorithm question - how to reorder a sequence economically Ned Batchelder <ned@nedbatchelder.com> - 2013-05-24 07:26 -0400
Re: Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 06:23 -0700
Re: Simple algorithm question - how to reorder a sequence economically Steven D'Aprano <steve+comp.lang.python@pearwood.info> - 2013-05-24 13:57 +0000
Re: Simple algorithm question - how to reorder a sequence economically Robert Kern <robert.kern@gmail.com> - 2013-06-12 14:14 +0100
Re: Simple algorithm question - how to reorder a sequence economically John Ladasky <john_ladasky@sbcglobal.net> - 2013-05-24 10:33 -0700
Re: Simple algorithm question - how to reorder a sequence economically John Ladasky <john_ladasky@sbcglobal.net> - 2013-05-25 18:25 -0700
Re: Simple algorithm question - how to reorder a sequence economically Roy Smith <roy@panix.com> - 2013-05-25 21:49 -0400
RE: Simple algorithm question - how to reorder a sequence economically Carlos Nepomuceno <carlosnepomuceno@outlook.com> - 2013-05-24 18:00 +0300
Re: Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 12:01 -0700
RE: Simple algorithm question - how to reorder a sequence economically Carlos Nepomuceno <carlosnepomuceno@outlook.com> - 2013-05-25 00:33 +0300
Re: Simple algorithm question - how to reorder a sequence economically Peter Brooks <peter.h.m.brooks@gmail.com> - 2013-05-24 17:28 -0700
csiph-web