- #36
- 14,373
- 6,866
It seems that nobody payed attention to my ##k=0## argument in post #4. Let me explain this argument in more detail. Consider the generalized Sleeping Beauty problem defined as follows:
In the case of tails, the Beauty will be awaken ##n## times.
In the case heads, the Beauty will be awaken ##k## times.
What is the probability ##p(heads;n,k)##?
The original Sleeping Beauty problem corresponds to ##n=2##, ##k=1##.
According to halfers, the solution of the original problem is ##p(heads;2,1)=1/2##. But this means that halfers think that ##p(heads;n,k)=1/2## is independent of ##n## and ##k##. On the other hand this cannot be correct because it is certainly wrong for ##k=0##. It is quite obvious that ##p(heads;n,0)=0##.
The halfer might argue that ##p(heads;n,k)=1/2## is correct only for ##n\neq 0## and ##k\neq 0##. But then he/she must explain why ##n=0## or ##k=0## is an exception.
EDIT: If someone wonders, the general solution (consistent with a thirder's way of reasoning) is
$$p(heads;n,k)=\frac{k}{n+k}$$
It is ill defined only for ##n=k=0##, which is perfectly sensible because in that case the Beauty is never awaken so the question "what is her probability when she is awaken" does not make sense. It must be assumed from the beginning that at least one of the numbers ##n## and ##k## is non-zero.
In the case of tails, the Beauty will be awaken ##n## times.
In the case heads, the Beauty will be awaken ##k## times.
What is the probability ##p(heads;n,k)##?
The original Sleeping Beauty problem corresponds to ##n=2##, ##k=1##.
According to halfers, the solution of the original problem is ##p(heads;2,1)=1/2##. But this means that halfers think that ##p(heads;n,k)=1/2## is independent of ##n## and ##k##. On the other hand this cannot be correct because it is certainly wrong for ##k=0##. It is quite obvious that ##p(heads;n,0)=0##.
The halfer might argue that ##p(heads;n,k)=1/2## is correct only for ##n\neq 0## and ##k\neq 0##. But then he/she must explain why ##n=0## or ##k=0## is an exception.
EDIT: If someone wonders, the general solution (consistent with a thirder's way of reasoning) is
$$p(heads;n,k)=\frac{k}{n+k}$$
It is ill defined only for ##n=k=0##, which is perfectly sensible because in that case the Beauty is never awaken so the question "what is her probability when she is awaken" does not make sense. It must be assumed from the beginning that at least one of the numbers ##n## and ##k## is non-zero.
Last edited: