News for hackers. Stuff that matters.
Re:The envelope paradox (2006) by sidedishes on Sunday November 29, 2015 @09:24PM (#10647249)
One way to resolve this problem is to use a continuous, increasing map f from the reals to say, (-1, 1). Something like arctan(x)/pi. You can then pick a number randomly from (-1, 1), then compare that with f(A), rather than a random real with A.
Re:The envelope paradox (2006) by idlewords on Sunday November 29, 2015 @09:27PM (#10647261)
But then it's not really uniform, is it? That innocent instruction to 'pick a random number' is carrying a lot of conceptual baggage.
Re:The envelope paradox (2006) by sidedishes on Sunday November 29, 2015 @09:36PM (#10647285)
Right, though I don't think uniform is the necessary condition here. We only need a positive chance of picking an R so that f(A) and f(B) are on different sides of R, which isn't as much of a problem if we're picking R from (-1, 1).
Re:The envelope paradox (2006) by idlewords on Sunday November 29, 2015 @09:48PM (#10647330)
There's also the question of how the first two numbers were chosen; in other words, what it means that 'the numbers are completely arbitrary'.

I can't math real good, but this is the part that smells fishy to me.

Re:The envelope paradox (2006) by aidenn0 on Monday November 30, 2015 @03:24AM (#10648371)
So long as you have a non-zero chance of your number "R" being between A and B, you have an advantage.