Jeffrey Barrett

Everett proposed resolving the quantum measurement problem by dropping the nonlinear collapse dynamics from quantum mechanics and taking what is left as a complete physical theory. If one takes such a proposal seriously, then the question becomes how much of the predictive and explanatory power of the standard theory can one recover without the collapse postulate and without adding anything else. Quantum mechanics without the collapse postulate has several suggestive properties, which we will consider in some detail. While these properties are not enough to make it acceptable given the usual standards for a satisfactory physical theory, one might want to exploit these properties to cook up a satisfactory no-collapse formulation of quantum mechanics. In considering how this might work, we will see why any no-collapse theory must generally fail to satisfy at least one of two plausible-sounding conditions.

Signaling games with reinforcement learning have been used to model the evolution of term languages (Lewis 1969, Convention. Cambridge, MA: Harvard University Press; Skyrms 2006, “Signals” Presidential Address. Philosophy of Science Association for PSA). In this article, syntactic games, extensions of David Lewis’s original sender–receiver game, are used to illustrate how a language that exploits available syntactic structure might evolve to code for states of the world. The evolution of a language occurs in the context of available vocabulary and syntax—the role played by each component is compared in the context of simple reinforcement learning

I argue that a strong mind–body dualism is required of any formulation of quantum mechanics that satisfies a relatively weak set of explanatory constraints. Dropping one or more of these constraints may allow one to avoid the commitment to a mind–body dualism but may also require a commitment to a physical–physical dualism that is at least as objectionable. Ultimately, it is the preferred basis problem that pushes both collapse and no-collapse theories in the direction of a strong dualism in resolving the quantum measurement problem. Addressing this problem illustrates how the construction and evaluation of explanatorily rich physical theories are inextricably tied to the evaluation of traditional philosophical issues.

Insofar as empirical inquiry involves the coevolution of descriptive language and theoretical commitments, a satisfactory model of empirical knowledge should describe the coordinated evolution of both language and theory. But since we do not know what conceptual resources we might need to express our future theories or to provide our best future faithful descriptions of the world, we do not now know even what the space of future descriptive options might be. One strategy for addressing this shifting-resource problem is to track the predictive and linguistic dispositions of inquirers rather than to track their theories and conceptual resources directly. Sender-predictor games, a variant of Skyrms–Lewis sender-receiver games, provide very simple models for the coordinated coevolution of predictive and linguistic dispositions. Such models explain how it is possible for (1) predictive and descriptive dispositions of inquirers to coevolve, (2) term-wise incommensurable, but nevertheless descriptively faithful languages, to sequentially evolve, and (3) a sort of underdetermination to occur where inquirers might satisfy their descriptive and predictive aims by revising their linguistic dispositions, their theoretical dispositions, or both. Such models also provide an elementary characterization of what it might mean for descriptions of the world to be faithful and hence for empirical inquiry to be successful. In doing so they provide a relatively weak, but perfectly clear, endogenous account of epistemic norms

Skyrms-Lewis signaling games illustrate how meaningful language may evolve from initially meaningless random signals (Lewis, Convention 1969; Skyrms 2008). Here we will consider how incommensurable languages might evolve in the context of signaling games. We will also consider the types of incommensurability exhibited between evolved languages in such games. We will find that sequentially evolved languages may be strongly incommensurable while still allowing for increasingly faithful descriptions of the world

argued that there are two options for what he called a realistic solution to the quantum measurement problem: (1) select a preferred set of observables for which definite values are assumed to exist, or (2) attempt to assign definite values to all observables simultaneously (1810–1). While conventional wisdom has it that the second option is ruled out by the Kochen-Specker theorem, Vink nevertheless advocated it. Making every physical quantity determinate in quantum mechanics carries with it significant conceptual costs, but it also provides a way of addressing the preferred basis problem that arises if one chooses to pursue the first option. The potential costs and benefits of a formulation of quantum mechanics where every physical quantity is determinate are herein examined. The preferred-basis problem How to solve the preferred-basis problem Relativistic constraints Conclusion.

Belief-revision models of knowledge describe how to update one’s degrees of belief associated with hypotheses as one considers new evidence, but they typically do not say how probabilities become associated with meaningful hypotheses in the first place. Here we consider a variety of Skyrms–Lewis signaling game (Lewis in Convention. Harvard University Press, Cambridge, 1969; Skyrms in Signals evolution, learning, & information. Oxford University Press, New York, 2010) where simple descriptive language and predictive practice and associated basic expectations coevolve. Rather than assigning prior probabilities to hypotheses in a fixed language then conditioning on new evidence, the agents begin with no meaningful language or expectations then evolve to have expectations conditional on their descriptions as they evolve to have meaningful descriptions for the purpose of successful prediction. The model, then, provides a simple but concrete example of how the process of evolving a descriptive language suitable for inquiry might also provide agents with conditional expectations that reflect the type and degree of predictive success in fact afforded by their evolved predictive practice. This illustrates one way in which the traditional problem of priors may simply fail to apply to one’s model of evolving inquiry

On Bohm''s formulation of quantum mechanics particles always have determinate positions and follow continuous trajectories. Bohm''s theory, however, requires a postulate that says that particles are initially distributed in a special way: particles are randomly distributed so that the probability of their positions being represented by a point in any regionR in configuration space is equal to the square of the wave-function integrated overR. If the distribution postulate were false, then the theory would generally fail to make the right statistical predictions. Further, if it were false, then there would at least in principle be situations where a particle would approach an eigenstate of having one position but in fact always be somewhere very different. Indeed, we will see how this might happen even if the distribution postulate were true. This will help to show how loose the connection is between the wave-function and the positions of particles in Bohm''s theory and what the precise role of the distribution postulate is. Finally, we will briefly consider two attempts to formulate a version of Bohm''s theory without the distribution postulate.

There is significant interest in type-free systems that allow flexible self-application. Such systems are of interest in property theory, natural language semantics, the theory of truth, theoretical computer science, the theory of classes, and category theory. While there are a variety of proposed type-free systems, there is a particularly natural type-free system that we believe is prototypical: the logic of recursive algorithms. Algorithmic logic is the study of basic statements concerning algorithms and the algorithmic rules of inference between such statements. As shown in [1], the threat of paradoxes, such as the Curry paradox, requires care in implementing rules of inference in this context. As in any type-free logic, some traditional rules will fail. The first part of the paper develops a rich collection of inference rules that do not lead to paradox. The second part identifies traditional rules of logic that are paradoxical in algorithmic logic, and so should be viewed with suspicion in type-free logic generally.

Because of the conceptual difficulties it faces, quantum mechanics provides a salient example of how alternative metaphysical commitments may clarify our understanding of a physical theory and the explanations it provides. Here we will consider how postulating alternative quantum worlds in the context of Hugh Everett III’s pure wave mechanics may serve to explain determinate measurement records and the standard quantum statistics. We will focus on the properties of such worlds, then briefly consider other metaphysical options available for interpreting pure wave mechanics. These reflections will serve to illustrate both the nature and the limits of naturalized metaphysics.

A resolution of the quantum measurement problem would require one to explain how it is that we end up with determinate records at the end of our measurements. Metaphysical commitments typically do real work in such an explanation. Indeed, one should not be satisfied with one's metaphysical commitments unless one can provide some account of determinate measurement records. I will explain some of the problems in getting determinate records in relativistic quantum field theory and pay particular attention to the relationship between the measurement problem and a generalized version of Malament's theorem.

Insofar as empirical inquiry involves the coevolution of descriptive language and theoretical commitments, a satisfactory model of empirical knowledge should describe the coordinated evolution of both language and theory. But since we do not know what conceptual resources we might need to express our future theories or to provide our best future faithful descriptions of the world, we do not now know even what the space of future descriptive options might be. One strategy for addressing this shifting-resource problem is to track the predictive and linguistic dispositions of inquirers rather than to track their theories and conceptual resources directly. Sender-predictor games, a variant of Skyrms–Lewis sender-receiver games, provide very simple models for the coordinated coevolution of predictive and linguistic dispositions. Such models explain how it is possible for predictive and descriptive dispositions of inquirers to coevolve, term-wise incommensurable, but nevertheless descriptively faithful languages, to sequentially evolve, and a sort of underdetermination to occur where inquirers might satisfy their descriptive and predictive aims by revising their linguistic dispositions, their theoretical dispositions, or both. Such models also provide an elementary characterization of what it might mean for descriptions of the world to be faithful and hence for empirical inquiry to be successful. In doing so they provide a relatively weak, but perfectly clear, endogenous account of epistemic norms.

We consider how cue-reading, sensory-manipulation, and signaling games may initially evolve from ritualized decisions and how more complex games may evolve from simpler games by polymerization, template transfer, and modular composition. Modular composition is a process that combines simpler games into more complex games. Template transfer, a process by which a game is appropriated to a context other than the one in which it initially evolved, is one mechanism for modular composition. And polymerization is a particularly salient example of modular composition where simpler games evolve to form more complex chains. We also consider how the evolution of new capacities by modular composition may be more efficient than evolving those capacities from basic decisions.

Accuracy in the philosophical theory of rationality demands that we recognize particular beliefs as arising within the context of larger units, the cultural or conceptual schemes, patterns, or practices, involvement in which itself provides standards and grounds for their rational evaluation. At the same time, though, a satisfactory account of rationality cannot hold the standards, values, or commitments of one particular culture, practice, or conceptual scheme, even one’s own, immune from rational criticism. In order to accurately and responsibly picture the shape of our commitments and the dynamics of their revision over time, in other words, the theory of rationality must reconcile the immanence of reason to particular cultural and conceptual units with its transcendence of them. This raises a deep and far-ranging problem of perspective. In his perspicuous presentation of it, Hilary Putnam put the problem this way: There are two points that must be balanced, both points that have been made by philosophers of many different kinds: (1) talk of what is ‘right’ and ‘wrong’ in any area only makes sense against the background of an inherited tradition; but (2) traditions themselves can be criticized … On the one hand, there is no notion of reasonableness at all without cultures, practices, procedures; on the other hand, the cultures, practices, procedures we inherit are not an algorithm to be slavishly followed. As Mill said, commenting on his own inductive logic, there is no rule book which will not lead to terrible results ‘if supposed to be conjoined with universal idiocy.’ Reason is, in this sense, both immanent (not to be found outside of concrete language games and institutions) and transcendent (a regulative idea that we use to criticize the conduct of all activities and institutions). (p. 431). As Putnam argues, it is difficult to find a standpoint of theory from which the contrasting claims of immanence and transcendence can be reconciled..

This paper is concerned with how a simple metalanguage might coevolve with a simple descriptive base language in the context of interacting Skyrms–Lewis signaling games Lewis. We will first consider a metagame that evolves to track the successful and unsuccessful use of a coevolving base language, then we will consider a metagame that evolves a truth predicate for expressions in a coevolving base language. We will see how a metagame that tracks truth provides an endogenous way to break the symmetry between indicative and imperative interpretations of the base language. Finally, we will consider how composite signaling games provide a way to characterize alternative pragmatic notions of truth.

On Bohm's formulation of quantum mechanics particles always have determinate positions and follow continuous trajectories. Bohm's theory, however, requires a postulate that says that particles are initially distributed in a special way: particles are randomly distributed so that the probability of their positions being represented by a point in any regionR in configuration space is equal to the square of the wave-function integrated overR. If the distribution postulate were false, then the theory would generally fail to make the right statistical predictions. Further, if it were false, then there would at least in principle be situations where a particle would approach an eigenstate of having one position but in fact always be somewhere very different. Indeed, we will see how this might happen even if the distribution postulate were true. This will help to show how loose the connection is between the wave-function and the positions of particles in Bohm's theory and what the precise role of the distribution postulate is. Finally, we will briefly consider two attempts to formulate a version of Bohm's theory without the distribution postulate.

Lewis signaling games illustrate how language might evolve from random behavior. The probability of evolving an optimal signaling language is, in part, a function of what learning strategy the agents use. Here we investigate three learning strategies, each of which allows agents to forget old experience. In each case, we find that forgetting increases the probability of evolving an optimal language. It does this by making it less likely that past partial success will continue to reinforce suboptimal practice. The learning strategies considered here show how forgetting past experience can promote learning in the context of games with suboptimal equilibria.

Lewis sender‐receiver games illustrate how a meaningful term language might evolve from initially meaningless random signals (Lewis 1969; Skyrms 2006). Here we consider how a meaningful language with a primitive grammar might evolve in a somewhat more subtle sort of game. The evolution of such a language involves the co‐evolution of partitions of the physical world into what may seem, at least from the perspective of someone using the language, to correspond to canonical natural kinds. While the evolved language may allow for the sort of precise representation that is required for successful coordinated action and prediction, the apparent natural kinds reflected in its structure may be purely conventional. This has both positive and negative implications for the limits of naturalized metaphysics

This paper concerns how rule-following behavior might evolve in the context of a variety of Skyrms–Lewis signaling game, how such rules might subsequently evolve to be used in new contexts, and how such appropriation allows for the composition of evolved rules. We will also consider how the composition of simpler rules to form more complex rules may be significantly more efficient than evolving the complex rules directly. And we will review an example of rule following by pinyon and scrub jays as an illustration of the appropriation of a rule to a new context :142–150, 2013a; Barrett, Philos Sci, 2014). The proposal here is that the composition of rules might occur in a way that is precisely analogous to such simple appropriation. Finally, we will briefly consider how any finite truth-functional operation might evolve by the sequential appropriation of simpler rules.

A many-worlds interpretation is of quantum mechanics tells us that the linear equations of motion are the true and complete laws for the time-evolution of every physical system and that the usual quantum-mechanical states provide complete descriptions of all possible physical situations. Such an interpretation, however, denies the standard way of understanding quantum-mechanical states. When the pointer on a measuring device is in a superposition of pointing many different directions, for example, we are to understand this as many pointers, each in a differentworld, each pointing in a different determinate direction. We ask here whether such talk makes any genuinely intelligible sense of the term world. We conclude that it does not.

This article concerns how rule-following behavior might evolve, how an old evolved rule might come to be appropriated to a new context, and how simple concepts might coevolve with rule-following behavior. In particular, we consider how the transitive inferential rule-following behavior exhibited by pinyon and scrub jays might evolve in the context of a variety of the Skyrms-Lewis signaling game, then how such a rule might come to be appropriated to carry out inferences regarding stimuli different from those involved in the original evolution of the rule, and how this appropriation involves a step toward the evolution of basic ordinal concepts

α-recursion lifts classical recursion theory from the first transfinite ordinal ω to an arbitrary admissible ordinal α [10]. Idealized computational models for α-recursion analogous to Turing machine models for classical recursion have been proposed and studied [4] and [5] and are applicable in computational approaches to the foundations of logic and mathematics [8]. They also provide a natural setting for modeling extensions of the algorithmic logic described in [1] and [2]. On such models, an α-Turing machine can complete a θ-step computation for any ordinal θ < α. Here we consider constraints on the physical realization of α-Turing machines that arise from the structure of physical spacetime. In particular, we show that an α-Turing machine is realizable in a spacetime constructed from R only if α is countable. While there are spacetimes where uncountable computations are possible and while they may even be empirically distinguishable from a standard spacetime, there is good reason to suppose that such nonstandard spacetimes are nonphysical. We conclude with a suggestion for a revision of Church’s thesis appropriate as an upper bound for physical computation.