Jeffrey Barrett

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.