Inverse gambler's fallacy

From Wikipedia, the free encyclopedia

(Redirected from Inverse gamblers fallacy)
Jump to: navigation, search

The inverse gambler's fallacy is a term coined by philosopher Ian Hacking to refer to a formal fallacy of Bayesian inference which is similar to the better known gambler's fallacy. It is the fallacy of concluding, on the basis of an unlikely outcome of a random process, that the process is likely to have occurred many times before. For example, if one observes a pair of fair dice being rolled and turning up double sixes, it is wrong to suppose that this lends any support to the hypothesis that the dice have been rolled before. We can see this from the Bayesian update rule: letting U denote the unlikely outcome of the random process and M the proposition that the process has occurred before, we have

P(M|U) = P(M) \frac{P(U|M)}{P(U)}

and since P(U|M) = P(U) (the outcome of the process is unaffected by previous occurrences), it follows that P(M|U) = P(M); that is, our confidence in M should be unchanged when we learn U.

The inverse gambler's fallacy is unquestionably a fallacy, but there is disagreement over whether and where it has been committed in practice. In his original paper,[1] Hacking takes as his main example a certain response to the argument from design. The argument from design asserts, first, that the universe is fine tuned to support life, and second, that this fine tuning points to the existence of an intelligent designer. The rebuttal attacked by Hacking consists of accepting the first premise, but rejecting the second on the grounds that our (big bang) universe is just one in a long sequence of universes, and that the fine tuning merely shows that there have been many other (badly tuned) universes preceding this one. Hacking draws a sharp distinction between this argument and the argument that all possible worlds coexist in some non-temporal sense. He proposes that these arguments, often treated as minor variations of one another, should be considered fundamentally different because one is formally invalid while the other is not.

A rebuttal paper[2] by John Leslie points out a difference between the observation of double sixes and the observation of fine tuning, namely that the former is not necessary (the roll could have come out differently) while the latter is necessary (our universe must support life, which means ex hypothesi that we must see fine tuning). He suggests the following analogy: instead of being summoned into a room to observe a particular roll of the dice, we are told that we will be summoned into the room immediately after a roll of double sixes. In this situation it may be quite reasonable, upon being summoned, to conclude with high confidence that we are not seeing the first roll. In particular, if we know that the dice are fair and that the rolling would not have been stopped before double sixes turned up, then the probability that we are seeing the first roll is at most 1/36. (It may be smaller because we have not assumed that the roller is obliged to summon us the first time double sixes come up.)

  1. ^ Ian Hacking, The Inverse Gambler's Fallacy: The Argument from Design. The Anthropic Principle Applied to Wheeler Universes. Mind 96:383 (July 1987), pp. 331–340.
  2. ^ John Leslie, No Inverse Gambler's Fallacy in Cosmology. Mind 97:386 (April 1988), pp. 269–272.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.