sleeping_beauty.txt 1.2 KB

123456789101112131415161718192021222324252627282930
  1. Solution to the sleeping beauty problem: 1/2.
  2. Why?
  3. HEADS monday (A)
  4. /
  5. coin flip <
  6. \
  7. TAILS monday (B) tuesday (C)
  8. A, B and C are NOT independent cases as it might seem and suggest the 1/3
  9. answer, because cases B and C aren't independent: if B happens, C happens as
  10. well and vice versa, if C happens, B happens as well. So B and C are in fact a
  11. single outcome. Whether we are awoken at B or C is just a subcase of TAILS and
  12. is irrelevant to reasoning about the coin flip. The credences are therefore:
  13. A = HEADS = 1/2
  14. B = C = 1/4 = TALIS / 2
  15. TAILS = B + C = 1/2
  16. HEADS + TAILS = 1
  17. Imagine the modified case in which TAILS awakes the bauty a million times. Would
  18. this make the probability of coin landing HEADS 1/1000001? Certainly not. There
  19. will be a million more cases of awakening for TALIS, but we can imagine these
  20. happening simultaneously, as a single awakening, since all of the 1000000
  21. awakenings are 100% correlated. The probability of correctly guessing the
  22. sequence number of awakening in the TAILS case will be 1/1000000 but that's a
  23. completely different question, the original question asks about the coin flip
  24. credence, which is 1/2.