Sleeping Beauty problem
The Sleeping Beauty problem is a puzzle in decision theory in which whenever an ideally rational epistemic agent is awoken from sleep, they have no memory of whether they have been awoken before. Upon being told that they have been woken once or twice according to the toss of a coin, once if heads and twice if tails, they are asked their degree of belief for the coin having come up heads.
Sleeping Beauty problem - Wikipedia Jump to content From Wikipedia, the free encyclopedia Mathematical problem The Sleeping Beauty problem , also known as the Sleeping Beauty paradox , [ 1 ] is a puzzle in decision theory in which an ideally rational epistemic agent is told she will be awoken from sleep either once or twice according to the toss of a coin . Each time she will have no memory of whether she has been awoken before, and is asked what her degree of belief that "the outcome of the coin toss is Heads" ought to be when she is first awakened. Illustration of the original sleepi
Explore this link on the map →saved by
related reading
- If a tree falls on Sleeping Beauty... — LessWronglesswrong.com
- Bayesian Mindsetcold-takes.com
- Probabilities are not the right concept — LessWronglesswrong.com
- On The Independence Axiom — LessWronglesswrong.com
- The St. Petersburg Paradox (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Interpretations of Probability (Stanford Encyclopedia of Philosophy)plato.stanford.edu
- Self-Indication Assumption — LessWronglesswrong.com
- Self-Sampling Assumption — LessWronglesswrong.com
- Pascal's mugging - Wikipediaen.wikipedia.org
- Evidential decision theory - Wikipediaen.wikipedia.org
- Newcomb's problem - Wikipediaen.wikipedia.org
- Probabilities Without Measurements | Vaden Masranivmasrani.github.io