Related papers: Chance and the Continuum Hypothesis
We derive a quenched invariance principle for random walks in random environments whose transition probabilities are defined in terms of weighted cycles of bounded length. To this end, we adapt the proof for random walks among random…
We address ZFC inequalities between some cardinal invariants of the continuum, which turned to be true in spite of strong expectations given by [RoSh:470].
In this paper we are shown the following facts: The probability of increased $ A_{k}=P(T^{k} (x_{0})>T^{k-1} (x_{0})) $, and the probability of decrease $B_{k}=P(T^{k} (x_{0})<T^{k-1} (x_{0}))$ in step $ k $ of a Collataz procedure…
This paper argues for a modal view of probability. The syntax and semantics of one particularly strong probability logic are discussed and some examples of the use of the logic are provided. We show that it is both natural and useful to…
For any particularly interesting theorem one proof is never enough. Instead, the first proof sets the challenge to find a more elegant method that illuminates subtle features of the math, is simpler to understand, or even avoids using…
The principle of the common cause claims that if an improbable coincidence has occurred, there must exist a common cause. This is generally taken to mean that positive correlations between non-causally related events should disappear when…
Can a physicist make only a finite number of errors in the eternal quest to uncover the law of nature? This millennium-old philosophical problem, known as inductive inference, lies at the heart of epistemology. Despite its significance to…
In the modern Bayesian view classical probability theory is simply an extension of conventional logic, i.e., a quantitative tool that allows for consistent reasoning in the presence of uncertainty. Classical theory presupposes, however,…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…
We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…
In calculations of the probability distribution for the cosmological constant, it has been previously assumed that the a priori probability distribution is essentially constant in the very narrow range that is anthropically allowed. This…
Hartle and Srednicki have suggested that standard quantum theory does not favor our typicality. Here an alternative version is proposed in which typicality is likely, Eventual Quantum Mechanics. This version allows one to calculate…
We consider $n$-sided dice whose face values lie between $1$ and $n$ and whose faces sum to $n(n+1)/2$. For two dice $A$ and $B$, define $A \succ B$ if it is more likely for $A$ to show a higher face than $B$. Suppose $k$ such dice…
Since the seminal paper by Tversky and Kahneman, the conjunction fallacy has been the subject of multiple debates and become a fundamental challenge for cognitive theories in decision-making. In this article, we take a rather uncommon…
We utilize operational methods to generalize the Chernoff inequality and prove a new result that relates the moment bound to strictly absolute monotonic functions. We show that the Chernoff bound is part of a continuum of probability…
The hypothesis of randomness is fundamental in statistical machine learning and in many areas of nonparametric statistics; it says that the observations are assumed to be independent and coming from the same unknown probability…
Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…
The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the…
We provide a formal, simple and intuitive theory of rational decision making including sequential decisions that affect the environment. The theory has a geometric flavor, which makes the arguments easy to visualize and understand. Our…