Category:Probability theory paradoxes
 | Computing portal |
Here is a list of articles in the category Probability theory paradoxes of the Computing portal that unifies foundations of mathematics and computations using computers.
Pages in category "Probability theory paradoxes"
The following 19 pages are in this category, out of 19 total.
1
- 100 prisoners problem (computing)
B
- Berkson's paradox (computing)
- Bertrand paradox (probability) (computing)
- Bertrand's box paradox (computing)
- Birthday problem (computing)
- Borel–Kolmogorov paradox (computing)
- Boy or Girl paradox (computing)
E
- Ellsberg paradox (computing)
- Exchange paradox (computing)
L
- Littlewood's law (computing)
M
- Monty Hall problem (computing)
N
- Necktie paradox (computing)
- Nontransitive dice (computing)
S
- Siegel's paradox (computing)
- Simpson's paradox (computing)
- Sleeping Beauty problem (computing)
- St. Petersburg paradox (computing)
T
- Three Prisoners problem (computing)
- Two envelopes problem (computing)
Mathematics
Organizations
Books
About