Search results
Results from the WOW.Com Content Network
Bertrand's box paradox: A paradox of conditional probability closely related to the Boy or Girl paradox. Bertrand's paradox: Different common-sense definitions of randomness give quite different results. Birthday paradox: In a random group of only 23 people, there is a better than 50/50 chance two of them have the same birthday.
This category contains paradoxes in mathematics, but excluding those concerning informal logic. "Paradox" here has the sense of "unintuitive result", rather than "apparent contradiction". "Paradox" here has the sense of "unintuitive result", rather than "apparent contradiction".
The St. Petersburg paradox or St. Petersburg lottery [1] is a paradox involving the game of flipping a coin where the expected payoff of the lottery game is infinite but nevertheless seems to be worth only a very small amount to the participants. The St. Petersburg paradox is a situation where a naïve decision criterion that takes only the ...
In mathematical logic, Russell's paradox (also known as Russell's antinomy) is a set-theoretic paradox published by the British philosopher and mathematician Bertrand Russell in 1901. [ 1 ] [ 2 ] Russell's paradox shows that every set theory that contains an unrestricted comprehension principle leads to contradictions. [ 3 ]
The Bertrand paradox is a problem within the classical interpretation of probability theory. Joseph Bertrand introduced it in his work Calcul des probabilités (1889) [1] as an example to show that the principle of indifference may not produce definite, well-defined results for probabilities if it is applied uncritically when the domain of possibilities is infinite.
The Principles of Mathematics (PoM) is a 1903 book by Bertrand Russell, in which the author presented his famous paradox and argued his thesis that mathematics and logic are identical. [ 1 ] The book presents a view of the foundations of mathematics and Meinongianism and has become a classic reference.
The discovery of these paradoxes revealed that not all sets which can be described in the language of naive set theory can actually be said to exist without creating a contradiction. The 20th century saw a resolution to these paradoxes in the development of the various axiomatizations of set theories such as ZFC and NBG in common
Newcomb's paradox was created by William Newcomb of the University of California's Lawrence Livermore Laboratory. However, it was first analyzed in a philosophy paper by Robert Nozick in 1969 [ 1 ] and appeared in the March 1973 issue of Scientific American , in Martin Gardner 's " Mathematical Games ". [ 2 ]