Related papers: Three classical probability problems: the Hungaria…
Classical countably additive real-valued probabilities come at a philosophical cost: in many infinite situations, they assign the same probability value -- namely, zero -- to cases that are impossible as well as to cases that are possible.…
The Monty Hall puzzle has been solved and dissected in many ways, but always using probabilistic arguments, so it is considered a probability puzzle. In this paper the puzzle is set up as an orthodox statistical problem involving an unknown…
In this lecture I will talk about three mathematical puzzles involving mathematics and computation that have preoccupied me over the years. The first puzzle is to understand the amazing success of the simplex algorithm for linear…
We generalize the classical probability frame by adopting a wider family of random variables that includes nondeterministic ones. The frame that emerges is known to host a ''classical'' extension of quantum mechanics. We discuss the notion…
In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…
This is a joint introduction to classical and free probability, which are twin sisters. We first review the foundations of classical probability, notably with the main limiting theorems (CLT, CCLT, PLT, CPLT), and with a look into examples…
A simple classical probabilistic system (a simple card game) classically exemplifies Aharonov and Vaidman's "Three-Box 'paradox'" [J. Phys. A 24, 2315 (1991)], implying that the Three-Box example is neither quantal nor a paradox and leaving…
Winning probabilities of The Hat Game (Ebert's Hat Problem) with three players and three colors are only known in the symmetric case: all probabilities of the colors are equal. This paper solves the asymmetric case: probabilities may be…
In this paper we present three simple applications of probability and highlight and discuss their paradoxical flavour.
This paper examines the classical matching distribution arising in the "problem of coincidences". We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed…
I argue that we must distinguish between: (0) the Three-Doors-Problem Problem [sic], which is to make sense of some real world question of a real person. (1) a large number of solutions to this meta-problem, i.e., many specific…
The theory of probability and the quantum theory, the one mathematical and the other physical, are related in that each admits a number of very different interpretations. It has been proposed that the conceptual problems of the quantum…
We examine the possible trajectories of a classical particle, trapped in a two-dimensional infinite rectangular well, using the Hamilton-Jacobi equation. We observe that three types of trajectories are possible: periodic orbits, open orbits…
We propose a new approach to solve the classical Monty Hall problem in its general form. The solution is based on basic tools of probability theory, by defining three elementary events which decompose the sample space into a partition. The…
Math is widely considered as a powerful tool and its strong appeal depends on the high level of abstraction it allows in modelling a huge number of heterogeneous phenomena and problems, spanning from the static of buildings to the flight of…
This paper investigates logical consequence defined in terms of probability distributions, for a classical propositional language using a standard notion of probability. We examine three distinct probabilistic consequence notions, which we…
The aim of this article is to promote the use of probabilistic methods in the study of problems in mathematical general relativity. Two new and simple singularity theorems, whose features are different from the classical singularity…
The Hamiltonian cycle problem (HCP), which is an NP-complete problem, consists of having a graph G with n nodes and m edges and finding the path that connects each node exactly once. In this paper we compare some algorithms to solve a…
In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…
We express classical, free, Boolean and monotone cumulants in terms of each other, using combinatorics of heaps, pyramids, Tutte polynomials and permutations. We completely determine the coefficients of these formulas with the exception of…