Return-Path: X-Original-To: python-list@python.org Delivered-To: python-list@mail.python.org X-Spam-Status: OK 0.050 X-Spam-Evidence: '*H*': 0.90; '*S*': 0.00; '16,': 0.03; 'before.': 0.09; 'events.': 0.09; 'logic': 0.09; 'zeros': 0.09; 'python': 0.11; '(at': 0.13; '*always*': 0.16; '100,': 0.16; 'combinations': 0.16; 'daughter': 0.16; 'from:addr:mrabarnett.plus.com': 0.16; 'from:addr:python': 0.16; 'from:name:mrab': 0.16; 'hits.': 0.16; 'message-id:@mrabarnett.plus.com': 0.16; 'programmatic': 0.16; 'received:192.168.1.4': 0.16; 'sequence.': 0.16; 'subject:random': 0.16; 'thread.': 0.16; 'wrote:': 0.16; 'pointed': 0.18; 'say,': 0.18; '>>>': 0.20; 'trying': 0.22; 'large,': 0.22; 'code,': 0.23; 'posted': 0.23; '2015': 0.23; 'header:In-Reply-To:1': 0.24; 'header:User-Agent:1': 0.26; 'idea': 0.26; 'least': 0.27; 'have,': 0.27; 'dictionary': 0.29; 'long.': 0.29; 'measure': 0.29; 'thread,': 0.29; 'random': 0.29; '(which': 0.29; 'program,': 0.29; "skip:' 10": 0.30; 'relative': 0.31; 'certain': 0.31; 'are:': 0.32; 'getting': 0.33; 'to:addr:python-list': 0.35; 'next': 0.35; 'problem.': 0.35; 'but': 0.36; 'beginning': 0.36; 'depends': 0.36; 'two': 0.37; 'subject:: ': 0.37; 'things': 0.39; 'does': 0.39; 'to:addr:python.org': 0.39; 'seem': 0.39; 'received:192': 0.39; 'learn': 0.60; 'your': 0.60; 'determine': 0.61; 'son': 0.61; "you'll": 0.61; 'here.': 0.61; 'skip:u 10': 0.62; 'matter': 0.63; 'thomas': 0.63; 'different': 0.64; 'due': 0.65; 'frequency': 0.66; 'everybody': 0.67; 'talking': 0.67; '8bit%:21': 0.70; 'skip:\xe2 10': 0.70; '8bit%:20': 0.72; 'increase': 0.72; '100': 0.79; 'batchelder': 0.84; 'boys': 0.84; 'daughter.': 0.84; 'girl': 0.84; 'million.': 0.84; 'subject:Testing': 0.84; 'utc-4,': 0.84; 'boy,': 0.91; 'girls': 0.91; 'girl,': 0.95 X-CM-Score: 0.00 X-CNFS-Analysis: v=2.1 cv=JOrGyJ+b c=1 sm=1 tr=0 a=0nF1XD0wxitMEM03M9B4ZQ==:117 a=0nF1XD0wxitMEM03M9B4ZQ==:17 a=0Bzu9jTXAAAA:8 a=QrohdLjRRo4A:10 a=IkcTkHD0fZMA:10 a=EBOSESyhAAAA:8 a=c2CfKLkYatotGbd-l10A:9 a=E6w8lA1cJFk2J3Ak:21 a=jKahOqaHJN9AJH0u:21 a=QEXdDO2ut3YA:10 X-AUTH: mrabarnett@:2500 Date: Wed, 17 Jun 2015 01:42:03 +0100 From: MRAB User-Agent: Mozilla/5.0 (Windows NT 6.3; WOW64; rv:31.0) Gecko/20100101 Thunderbird/31.7.0 MIME-Version: 1.0 To: python-list@python.org Subject: Re: Testing random References: <87oaksowwg.fsf@Equus.decebal.nl> <1451048.pW9z17ilMA@PointedEars.de> <3158703.Lr4HFMbMOd@PointedEars.de> <1656356.OjxBvjpJ5d@PointedEars.de> <5515034.V7dcXEWAvK@PointedEars.de> <88ba163e-74f4-40fa-ab3e-1feeb051b961@googlegroups.com> <17701105.fuEQZlnPee@PointedEars.de> <2089101.KkvqnN9Xah@PointedEars.de> <3049728.zPiIGXGd9A@PointedEars.de> In-Reply-To: <3049728.zPiIGXGd9A@PointedEars.de> Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit X-BeenThere: python-list@python.org X-Mailman-Version: 2.1.20+ 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: 68 NNTP-Posting-Host: 2001:888:2000:d::a6 X-Trace: 1434501913 news.xs4all.nl 2843 [2001:888:2000:d::a6]:34360 X-Complaints-To: abuse@xs4all.nl Path: csiph.com!usenet.pasdenom.info!news.stben.net!border1.nntp.ams1.giganews.com!nntp.giganews.com!usenetcore.com!newsfeed.xs4all.nl!newsfeed4a.news.xs4all.nl!xs4all!post.news.xs4all.nl!not-for-mail Xref: csiph.com comp.lang.python:92714 On 2015-06-17 00:45, Thomas 'PointedEars' Lahn wrote: > Ned Batchelder wrote: > >> On Tuesday, June 16, 2015 at 6:01:06 PM UTC-4, Thomas 'PointedEars' Lahn >> wrote: >>> Your programmatic "proof", as all the other intuitive-empirical "proofs", >>> and all the other counter-arguments posted before in this thread, is >>> flawed. As others have pointed out at the beginning of this thread, you >>> *cannot* measure or calculate probability or determine randomness >>> programmatically (at least not with this program). >> >> You *can* estimate probability with a program, which is what is happening >> here. > > No. Just no. > >>> I repeat: Probability is what relative >>> frequency (which you can measure) *approaches* for *large* numbers. 100 >>> is anything but large, to begin with. >> >> The number of trials in this program is not 100, it is 1 million. You >> seem uninterested in trying to understand. > > It still would _not_ a measure or a calculation of *probability*. So much > for “uninterested in trying to understand”. > >>> What is "large" depends on the experiment, not on the experimentator. >>> And with independent events, the probability for getting zero does not >>> increase because you have been getting non-zeros before. It simply does >>> not work this way. >> >> Again, if you look at the code, you'll see that we are not talking about >> the probability of getting a zero on the next roll. We are talking about >> the probability of getting no zeros in an N-roll sequence. I have no idea >> how you have misunderstood this for so long. > > You do not understand that it boils down to the same problem. The > probability of only having sons is _not_ greater than that of having > sons and one daughter or vice-versa. And for that it does _not_ matter > how many children you have *because* it does _not_ matter how many > children you had before. The probability for a boy or a girl is *always* > the same. You are _not_ due for a boy if you have many girls, and not for a > girls if you have many boys. But that is precisely what your flawed logic > is implying. > > Learn probability theory, and use a dictionary in Python when you want to > count random hits. > I think that different people are talking about different things in this thread. You're talking about the probability of each event, while everybody else is talking about the probability of certain combinations of events. If you have, say, two children, the possibilities are: boy, boy boy, girl girl, boy girl, girl The probability of each boy or girl is 1/2. The probability of only boys is 1/4 and of a son and a daughter is 1/4 + 1/4 = 1/2. Therefore, the probability of having only boys is less than the probability of having a son and a daughter.