[math-fun] coin-toss reply to M.Stay re wikipedia & Salamin
Wikipedia's coin fairness test uses one fixed N. So does Salamin. Therefore it is incapable of detecting unfairnesses which are too small. The only way to do that is to use unboundedly large N, keep tossing coins literally forever until some test passes. If you are going to do that, then take the attitude you are going to do that, and design the best criterion you can. Not a criterion for one particular N, a criterion designed for re-use throughout an unbounded and a priori unknown number of tosses, and without hurting either correctness or efficiency. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)
That's a complete misrepresentation of what I said. The number N of tosses is not fixed. You can toss all you want, until your decision procedure returns fair, unfair, or undecided. -- Gene From: Warren D Smith <warren.wds@gmail.com> To: math-fun@mailman.xmission.com Sent: Friday, March 4, 2016 7:19 PM Subject: [math-fun] coin-toss reply to M.Stay re wikipedia & Salamin Wikipedia's coin fairness test uses one fixed N. So does Salamin. Therefore it is incapable of detecting unfairnesses which are too small. The only way to do that is to use unboundedly large N, keep tossing coins literally forever until some test passes. If you are going to do that, then take the attitude you are going to do that, and design the best criterion you can. Not a criterion for one particular N, a criterion designed for re-use throughout an unbounded and a priori unknown number of tosses, and without hurting either correctness or efficiency. -- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)
As the actress might well have observed to the bishop ... WFL On 3/5/16, Eugene Salamin via math-fun <math-fun@mailman.xmission.com> wrote:
That's a complete misrepresentation of what I said. The number N of tosses is not fixed. You can toss all you want, until your decision procedure returns fair, unfair, or undecided.
-- Gene
From: Warren D Smith <warren.wds@gmail.com> To: math-fun@mailman.xmission.com Sent: Friday, March 4, 2016 7:19 PM Subject: [math-fun] coin-toss reply to M.Stay re wikipedia & Salamin
Wikipedia's coin fairness test uses one fixed N. So does Salamin. Therefore it is incapable of detecting unfairnesses which are too small. The only way to do that is to use unboundedly large N, keep tossing coins literally forever until some test passes. If you are going to do that, then take the attitude you are going to do that, and design the best criterion you can. Not a criterion for one particular N, a criterion designed for re-use throughout an unbounded and a priori unknown number of tosses, and without hurting either correctness or efficiency.
-- Warren D. Smith http://RangeVoting.org <-- add your endorsement (by clicking "endorse" as 1st step)
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com https://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
participants (3)
-
Eugene Salamin -
Fred Lunnon -
Warren D Smith