We show that infinitesimal probabilities are much too small for modeling the individual outcome of a countably infinite fair lottery.

While there are several arguments on either side, it is far from clear as to whether or not countable additivity is an acceptable axiom of subjective probability. I focus here on de Finetti's central argument against countable additivity and provide a new Dutch book proof of the principle, To argue that if we accept the Dutch book foundations of subjective probability, countable additivity is an unavoidable constraint.

Isn't probability 1 certainty? If the probability is objective, so is the certainty: whatever has chance 1 of occurring is certain to occur. Equivalently, whatever has chance 0 of occurring is certain not to occur. If the probability is subjective, so is the certainty: if you give credence 1 to an event, you are certain that it will occur. Equivalently, if you give credence 0 to an event, you are certain that it will not occur. And so on for other (...) kinds of probability, such as evidential probability. The formal analogue of this picture is the regularity constraint: a probability distribution over sets of possibilities is regular just in case it assigns probability 0 only to the null set, and therefore probability 1 only to the set of all possibilities. (shrink)

Isn't probability 1 certainty? If the probability is objective, so is the certainty: whatever has chance 1 of occurring is certain to occur. Equivalently, whatever has chance 0 of occurring is certain not to occur. If the probability is subjective, so is the certainty: if you give credence 1 to an event, you are certain that it will occur. Equivalently, if you give credence 0 to an event, you are certain that it will not occur. And so on for other (...) kinds of probability, such as evidential probability. The formal analogue of this picture is the regularity constraint: a probability distribution over sets of possibilities is regular just in case it assigns probability 0 only to the null set, and therefore probability 1 only to the set of all possibilities. (shrink)

This article discusses how the concept of a fair finite lottery can best be extended to denumerably infinite lotteries. Techniques and ideas from non-standard analysis are brought to bear on the problem.

It is possible that a fair coin tossed infinitely many times will always land heads. So the probability of such a sequence of outcomes should, intuitively, be positive, albeit miniscule: 0 probability ought to be reserved for impossible events. And, furthermore, since the tosses are independent and the probability of heads (and tails) on a single toss is half, all sequences are equiprobable. But Williamson has adduced an argument that purports to show that our intuitions notwithstanding, the probability of an (...) infinite sequence is 0. In this paper, I rebut his argument.No Abstract. (shrink)

The recent discovery of an indeterministic system in classical mechanics, the Norton dome, has shown that answering the question whether classical mechanics is deterministic can be a complicated matter. In this paper I show that indeterministic systems similar to the Norton dome were already known in the nineteenth century: I discuss four nineteenth century authors who wrote about such systems, namely Poisson, Duhamel, Boussinesq and Bertrand. However, I argue that their discussion of such systems was very different from the contemporary (...) discussion about the Norton dome, because physicists in the nineteenth century conceived of determinism in essentially different ways: whereas in the contemporary literature on determinism in classical physics, determinism is usually taken to be a property of the equations of physics, in the nineteenth century determinism was primarily taken to be a presupposition of theories in physics, and as such it was not necessarily affected by the possible existence of systems such as the Norton dome. (shrink)

Newton’s equations of motion tell us that a mass at rest at the apex of a dome with the shape specified here can spontaneously move. It has been suggested that this indeterminism should be discounted since it draws on an incomplete rendering of Newtonian physics, or it is “unphysical,” or it employs illicit idealizations. I analyze and reject each of these reasons. †To contact the author, please write to: Department of History and Philosophy of Science, University of Pittsburgh, Pittsburgh, PA (...) 15260; e‐mail: [email protected]. (shrink)

That quantum mechanical measurement processes are indeterministic is widely known. The time evolution governed by the differential Schrödinger equation can also be indeterministic under the extreme conditions of a quantum supertask, the quantum analogue of a classical supertask. Determinism can be restored by requiring normalizability of the supertask state vector, but it must be imposed as an additional constraint on the differential Schrödinger equation.

Two reverse supertasks—one new and one invented by Pérez Laraudogoitia —are discussed. Contra Kerkvliet and Pérez Laraudogoitia, it is argued that these supertasks cannot be used to conduct fair infinite lotteries, i.e., lotteries on the set of natural numbers with a uniform probability distribution. The new supertask involves an infinity of gods who collectively select a natural number by each removing one ball from a collection of initially infinitely many balls in a reverse omega-sequence of actions.

We describe in some detail how to build an infinite computing machine within a continuous Newtonian universe. The relevance of our construction to the Church-Turing thesis and the Platonist-Intuitionist debate about the nature of mathematics is also discussed.

De Finetti would claim that we can make sense of a draw in which each positive integer has equal probability of winning. This requires a uniform probability distribution over the natural numbers, violating countable additivity. Countable additivity thus appears not to be a fundamental constraint on subjective probability. It does, however, seem mandated by Dutch Book arguments similar to those that support the other axioms of the probability calculus as compulsory for subjective interpretations. These two lines of reasoning can be (...) reconciled through a slight generalization of the Dutch Book framework. Countable additivity may indeed be abandoned for de Finetti's lottery, but this poses no serious threat to its adoption in most applications of subjective probability. Introduction The de Finetti lottery Two objections to equiprobability 3.1 The ‘No random mechanism’ argument 3.2 The Dutch Book argument Equiprobability and relative betting quotients The re-labelling paradox 5.1 The paradox 5.2 Resolution: from symmetry to relative probability Beyond the de Finetti lottery. (shrink)

We propose an alternative approach to probability theory closely related to the framework of numerosity theory: non-Archimedean probability (NAP). In our approach, unlike in classical probability theory, all subsets of an infinite sample space are measurable and only the empty set gets assigned probability zero (in other words: the probability functions are regular). We use a non-Archimedean field as the range of the probability function. As a result, the property of countable additivity in Kolmogorov’s axiomatization of probability is replaced by (...) a different type of infinite additivity. (shrink)