ABSTRACTA popular strategy for understanding the probabilities that arise in physics is to interpret them via reductionist accounts of chance—indeed, it is sometimes claimed that such accounts are uniquely well-suited to make sense of the probabilities in classical statistical mechanics. Here it is argued that reductionist accounts of chance carry a steep but unappreciated cost: when applied to physical theories of the relevant type, they inevitably distort the relations of probability that they take as input.

Bayesians often assume, suppose, or conjecture that for any reasonable explication of the notion of simplicity a prior can be designed that will enforce a preference for hypotheses simpler in just that sense. But it is shown here that there are simplicity-driven approaches to curve-fitting problems that cannot be captured within the orthodox Bayesian framework.

Bayesians often assume, suppose, or conjecture that for any reasonable explication of the notion of simplicity a prior can be designed that will enforce a preference for hypotheses simpler in just that sense. Further, it is often claimed that the Bayesian framework automatically implements Occam's razor—that conditionalizing on data consistent with both a simple theory and a complex theory more or less inevitably favours the simpler theory. But it is shown here that there are simplicity-driven approaches to curve-fitting problems that (...) cannot be captured within the orthodox Bayesian framework and that the automatic razor does not function for such problems. (shrink)

The ‘Principal Principle’ states, roughly, that one's subjective probability for a proposition should conform to one's beliefs about that proposition's objective chance of coming true. David Lewis has argued (i) that this principle provides the defining role for chance; (ii) that it conflicts with his reductionist thesis of Humean supervenience, and so must be replaced by an amended version that avoids the conflict; hence (iii) that nothing perfectly deserves the name ‘chance’, although something can come close enough by playing the (...) role picked out by the amended principle. We show that in fact there must be ‘chances’ that perfectly play what Lewis takes to be the defining role. But this is not the happy conclusion it might seem, since these ‘chances’ behave too strangely to deserve the name. The lesson is simple: much more than the Principal Principle—more to the point, much more than the connection between chance and credence—informs our understanding of objective chance. 1 Introduction 2 Preliminaries 3 Undermining futures and the New Principle 4 The Old Principle rescued? 5 The New Bug 6 Conclusion. (shrink)

It is shown that many different problems have the same degree of unsolvability. Among these problems are: THE INDUCTIVE INFERENCE PROBLEM. Infer in the limit an index for a recursive function f presented as f(0), f(1), f(2),.... THE RECURSIVE INDEX PROBLEM. Decide in the limit if i is the index of a total recursive function. THE ZERO NONVARIANT PROBLEM. Decide in the limit if a recursive function f presented as f(0), f(1), f(2),... has value unequal to zero for infinitely many (...) arguments. Finally, it is shown that these unsolvable problems are strictly easier than the halting problem. (shrink)

This chapter describes the logic of inductive inference as seen through the eyes of the modern theory of personal probability, including a number of its recent refinements and extensions. The structure of the chapter is as follows. After a brief discussion of mathematical probability, to establish notation and terminology, it recounts the gradual evolution of the probabilistic explication of induction from Bayes to the present. The focus is not in this history per se, but in its use to highlight the (...) key assumptions, criticisms, refinements, and achievements of that theory. Along the way, the structure of the modern theory is presented, and its relation to the problem of induction discussed. (shrink)

Michael G. Titelbaum presents a new Bayesian framework for modeling rational degrees of belief—the first of its kind to represent rational requirements on agents who undergo certainty loss.

Intuitively, a sequence such as 101010101010101010… does not seem random, whereas 101101011101010100…, obtained using coin tosses, does. How can we reconcile this intuition with the fact that both are statistically equally likely? What does it mean to say that an individual mathematical object such as a real number is random, or to say that one real is more random than another? And what is the relationship between randomness and computational power. The theory of algorithmic randomness uses tools from computability theory (...) and algorithmic information theory to address questions such as these. Much of this theory can be seen as exploring the relationships between three fundamental concepts: relative computability, as measured by notions such as Turing reducibility; information content, as measured by notions such as Kolmogorov complexity; and randomness of individual objects, as first successfully defined by Martin-Löf. Although algorithmic randomness has been studied for several decades, a dramatic upsurge of interest in the area, starting in the late 1990s, has led to significant advances. This is the first comprehensive treatment of this important field, designed to be both a reference tool for experts and a guide for newcomers. It surveys a broad section of work in the area, and presents most of its major results and techniques in depth. Its organization is designed to guide the reader through this large body of work, providing context for its many concepts and theorems, discussing their significance, and highlighting their interactions. It includes a discussion of effective dimension, which allows us to assign concepts like Hausdorff dimension to individual reals, and a focused but detailed introduction to computability theory. It will be of interest to researchers and students in computability theory, algorithmic information theory, and theoretical computer science. (shrink)

This book explains how we can understand objective chance in a metaphysically neutral way, as reducible to certain patterns that can be discerned in the actual events of our world.

The existence of "undermining futures" appears to show that a contradiction can be deduced from the conjunction of Humean supervenience (HS) about chance and the Principal Principle. A number of strategies for rescuing HS from this problem have been proposed recently. In this paper, a novel way of defending HS from the threat is presented, and it is argued that this defense has advantages not shared by others. In particular, it requires no revisionism about chance, and it is equally available (...) to defenders of HS who hold HS to be necessary and those who hold it to be contingent. (shrink)

The existence of “undermining futures” appears to show that a contradiction can be deduced from the conjunction of Humean supervenience about chance and the Principal Principle. A number of strategies for rescuing HS from this problem have been proposed recently. In this paper, a novel way of defending HS from the threat is presented, and it is argued that this defense has advantages not shared by others. In particular, it requires no revisionism about chance, and it is equally available to (...) defenders of HS who hold HS to be necessary and those who hold it to be contingent. (shrink)

In ‘A Non-Pragmatic Vindication of Probabilism’, Jim Joyce attempts to ‘depragmatize’ de Finetti’s prevision argument for the claim that our partial beliefs ought to satisfy the axioms of probability calculus. In this paper, I adapt Joyce’s argument to give a non-pragmatic vindication of various versions of David Lewis’ Principal Principle, such as the version based on Isaac Levi's account of admissibility, Michael Thau and Ned Hall's New Principle, and Jenann Ismael's Generalized Principal Principle. Joyce enumerates properties that must be had (...) by any measure of the distance from a set of partial beliefs to the set of truth values; he shows that, on any such measure, and for any set of partial beliefs that violates the probability axioms, there is a set that satisfies those axioms that is closer to every possible set of truth values. I replace truth values by objective chances in his argument; I show that for any set of partial beliefs that violates the probability axioms or a version of the Principal Principle, there is a set that satisfies them that is closer to every possible set of objective chances. (shrink)

Tn this paper I explore and to an extent defend HS. The main philosophical challenges to HS come from philosophical views that say that nomic concepts-laws, chance, and causation-denote features of the world that fail to supervene on non-nomic features. Lewis rejects these views and has labored mightily to construct HS accounts of nomic concepts. His account of laws is fundamental to his program, since his accounts of the other nomic notions rely on it. Recently, a number of philosophers have (...) criticized Lewis's account, and Humean accounts of laws generally, for delivering, at best, a pale imitation ofthe genuine item. These philosophers think that the notion of law needed by science requires laws-if there are any-to be fundamental features of our world that are completely distinct from and not supervenient on the particular facts that they explain. I side with Lewis against these philosophers. Here I will argue that although Lewis-laws don't fulfill all our philosophical expectations, they do play the roles that science needs laws to play. The metaphysics and epistemology of Humean laws, and more specifically, Lewis-laws, are in much better shape than the metaphysics and epistemology of the main anti-Humean alternatives. However, I do have inisgivings about Lewis's account. Both he and his critics assume that the basic properties are so individuated so that the laws are not metaphysically necessary. If this assumption is rejected, then the question of Humean supervenience lapses. I conclude with a brief discussion of this position. (shrink)

One of Ian Hacking's earliest publications, this book showcases his early ideas on the central concepts and questions surrounding statistical reasoning. He explores the basic principles of statistical reasoning and tests them, both at a philosophical level and in terms of their practical consequences for statisticians. Presented in a fresh twenty-first-century series livery, and including a specially commissioned preface written by Jan-Willem Romeijn, illuminating its enduring importance and relevance to philosophical enquiry, Hacking's influential and original work has been revived for (...) a new generation of readers. (shrink)

There is currently no viable alternative to the Bayesian analysis of scientific inference, yet the available versions of Bayesianism fail to do justice to several aspects of the testing and confirmation of scientific hypotheses. Bayes or Bust? provides the first balanced treatment of the complex set of issues involved in this nagging conundrum in the philosophy of science. Both Bayesians and anti-Bayesians will find a wealth of new insights on topics ranging from Bayes's original paper to contemporary formal learning theory. (...) In a paper published posthumously in 1763, the Reverend Thomas Bayes made a seminal contribution to the understanding of "analogical or inductive reasoning." Building on his insights, modem Bayesians have developed an account of scientific inference that has attracted numerous champions as well as numerous detractors. Earman argues that Bayesianism provides the best hope for a comprehensive and unified account of scientific inference, yet the presently available versions of Bayesianisin fail to do justice to several aspects of the testing and confirming of scientific theories and hypotheses. By focusing on the need for a resolution to this impasse, Earman sharpens the issues on which a resolution turns. John Earman is Professor of History and Philosophy of Science at the University of Pittsburgh. (shrink)

Like Lewis, many philosophers hold reductionist accounts of chance (on which claims about chance are to be understood as claims that certain patterns of events are instantiated) and maintain that rationality requires that credence should defer to chance (in the sense that under certain circumstances one's credence in an event must coincide with the chance of that event). It is a shortcoming of an account of chance if it implies that this norm of rationality is unsatisfiable by computable agents. This (...) shortcoming is more common than one might have hoped. (shrink)

This paper is concerned with learners who aim to learn patterns in infinite binary sequences: shown longer and longer initial segments of a binary sequence, they either attempt to predict whether the next bit will be a 0 or will be a 1 or they issue forecast probabilities for these events. Several variants of this problem are considered. In each case, a no-free-lunch result of the following form is established: the problem of learning is a formidably difficult one, in that (...) no matter what method is pursued, failure is incomparably more common that success; and difficult choices must be faced in choosing a method of learning, since no approach dominates all others in its range of success. In the simplest case, the comparison of the set of situations in which a method fails and the set of situations in which it succeeds is a matter of cardinality (countable vs. uncountable); in other cases, it is a topological matter (meagre vs. co-meagre) or a hybrid computational-topological matter (effectively meagre vs. effectively co-meagre). (shrink)