Abstract

The Monty Hall problem has received its fair share of attention in mathematics. Recently, an entire monograph has been devoted to its history. There has been a multiplicity of approaches to the problem. These approaches are not necessarily mutually exclusive. The design of the present paper is to add one more approach by analyzing the mathematical structure of the Monty Hall problem in digital terms. The structure of the problem is described as much as possible in the tradition and the spirit—and as much as possible by means of the algebraic conventions—of George Boole’s Investigation of the Laws of Thought (1854), the Magna Charta of the digital age, and of John Venn’s Symbolic Logic (second edition, 1894), which is squarely based on Boole’s Investigation and elucidates it in many ways. The focus is not only on the digital-mathematical structure itself but also on its relation to the presumed digital nature of cognition as expressed in rational thought and language. The digital approach is outlined in part 1. In part 2, the Monty Hall problem is analyzed digitally. To ensure the generality of the digital approach and demonstrate its reliability and productivity, the Monty Hall problem is extended and generalized in parts 3 and 4 to related cases in light of the axioms of probability theory. In the full mapping of the mathematical structure of the Monty Hall problem and any extensions thereof, a digital or non-quantitative skeleton is fleshed out by a quantitative component. The pertinent mathematical equations are developed and presented and illustrated by means of examples.

Highlights

  • The Monty Hall problem, named after the television host Monty Hall who made it famous in a TV show, has received its fair share of attention in mathematics

  • The Monty Hall problem has received its fair share of attention in mathematics

  • To ensure the generality of the digital approach and demonstrate its reliability and productivity, the Monty Hall problem is extended in parts 3 and 4 to related cases in light of the axioms of probability theory

Read more

Summary

Introduction

The Monty Hall problem, named after the television host Monty Hall who made it famous in a TV show, has received its fair share of attention in mathematics. To ensure the generality of the digital approach and to demonstrate its reliability and productivity, it would seem to be critically important to extend and generalize the analysis of the Monty Hall problem to any number of doors, cars, opened doors, and picked doors in light of the axioms of probability theory. Such an extension and generalization is the subject of parts 3 and 4 of this paper. The pertinent mathematical Equations are developed and presented and illustrated by means of examples

Digital Mathematics and Quantitative Mathematics
Boole’s Algebra and the Algebra of Electrical Engineering
The Digital Nature of Rational Thought and Language
Empirical Basis for Observing the Digitality of Rational Thought and Language
The Digital Supplements
The Digital Combination Classes
Limits to the Universe
Excursus
Boole and Probability
Description of the Monty Hall Problem
Intuitive Grasp of the Need to Switch Doors
Mathematical Notation of Things and Events
The Two Classes and Their Supplements in Boole’s Algebra
3.10. The Probabilities of the Digital Combination Events
3.12. The Two Empty Digital Combination Classes of Events
Examples
Preamble
The Probability of Digital Combination Event
The Probability of Digital Combination Event c g o d d 1 o
The Probability of Digital Combination Event g c d d 1 o
The Probability of Digital Combination Event g g 1 o d d 1 o
The Increase in Digital Complexity
The 16 Digital Combinations of the “Doubled” Monty Hall Problem
Dependence
Comparison of the Original and the “Doubled” Monty Hall Problems
Compressing Probability as an Effect of Opening Doors to Reveal Goats
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call