We pose and resolve several vexing decision theoretic puzzles. Some are variants of existing puzzles, such as 'Trumped' (Arntzenius and McCarthy 1997), 'Rouble trouble' (Arntzenius and Barrett 1999), 'The airtight Dutch book' (McGee 1999), and 'The two envelopes puzzle' (Broome 1995). Others are new. A unified resolution of the puzzles shows that Dutch book arguments have no force in infinite cases. It thereby provides evidence that reasonable utility functions may be unbounded and that reasonable credence functions need not be countably (...) additive. The resolution also shows that when infinitely many decisions are involved, the difference between making the decisions simultaneously and making them sequentially can be the difference between riches and ruin. Finally, the resolution reveals a new way in which the ability to make binding commitments can save perfectly rational agents from sure losses. (shrink)

Our relationship to the infinite is controversial. But it is widely agreed that our powers of reasoning are finite. I disagree with this consensus; I think that we can, and perhaps do, engage in infinite reasoning. Many think it is just obvious that we can't reason infinitely. This is mistaken. Infinite reasoning does not require constructing infinitely long proofs, nor would it gift us with non-recursive mental powers. To reason infinitely we only need an ability to perform infinite inferences. I (...) argue that we have this ability. My argument looks to our best current theories of inference and considers examples of apparent infinite reasoning. My position is controversial, but if I'm right, our theories of truth, mathematics, and beyond could be transformed. And even if I'm wrong, a more careful consideration of infinite reasoning can only deepen our understanding of thinking and reasoning. -/- (Note for readers: the paper's brief discussion of uniform reflection and omega inconsistency is misleading. The imagined interlocutor's argument makes an assumption about the PA-provability of provability generalizations that, while true for the Godel sentence's instances, is unjustified, in general. This means my position is stronger against this objection than the paper suggests, since omega inconsistent theories are not automatically inconsistent with their uniform reflection principles, you also need to assume the arithmetically true Pi-2 sentences.). (shrink)

I defend a new argument for causal finitism, the view that nothing can have an infinite causal history. I begin by defending a number of plausible metaphysical principles, after which I explore a host of novel variants of the Littlewood-Ross and Thomson’s Lamp paradoxes that violate such principles. I argue that causal finitism is the best solution to the paradoxes.

A survey of the field of hypercomputation, including discussion of a variety of objections.

Accelerating Turing machines have attracted much attention in the last decade or so. They have been described as “the work-horse of hypercomputation” (Potgieter and Rosinger 2010: 853). But do they really compute beyond the “Turing limit”—e.g., compute the halting function? We argue that the answer depends on what you mean by an accelerating Turing machine, on what you mean by computation, and even on what you mean by a Turing machine. We show first that in the current literature the term (...) “accelerating Turing machine” is used to refer to two very different species of accelerating machine, which we call end-stage-in and end-stage-out machines, respectively. We argue that end-stage-in accelerating machines are not Turing machines at all. We then present two differing conceptions of computation, the internal and the external, and introduce the notion of an epistemic embedding of a computation. We argue that no accelerating Turing machine computes the halting function in the internal sense. Finally, we distinguish between two very different conceptions of the Turing machine, the purist conception and the realist conception; and we argue that Turing himself was no subscriber to the purist conception. We conclude that under the realist conception, but not under the purist conception, an accelerating Turing machine is able to compute the halting function in the external sense. We adopt a relatively informal approach throughout, since we take the key issues to be philosophical rather than mathematical. (shrink)

Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of contains n consecutive 7s, for any n; solve the Turing-machine halting problem; and decide the predicate calculus. Are accelerating Turing machines, then, logically impossible devices? I argue that they are not. There are implications concerning the nature of effective procedures and the theoretical limits of computability. Contrary (...) to a recent paper by Bringsjord, Bello and Ferrucci, however, the concept of an accelerating Turing machine cannot be used to shove up Searle's Chinese room argument. (shrink)

In this paper I present a novel supertask in a Newtonian universe that destroys and creates infinite masses and energies, showing thereby that we can have infinite indeterminism. Previous supertasks have managed only to destroy or create finite masses and energies, thereby giving cases of only finite indeterminism. In the Nothing from Infinity paradox we will see an infinitude of finite masses and an infinitude of energy disappear entirely, and do so despite the conservation of energy in all collisions. I (...) then show how this leads to the Infinity from Nothing paradox, in which we have the spontaneous eruption of infinite mass and energy out of nothing. I conclude by showing how our supertask models at least something of an old conundrum, the question of what happens when the immovable object meets the irresistible force. (shrink)

Presented here is a new result concerning the computational power of so-called SADn computers, a class of Turing-machine-based computers that can perform some non-Turing computable feats by utilising the geometry of a particular kind of general relativistic spacetime. It is shown that SADn can decide n-quantifier arithmetic but not (n+1)-quantifier arithmetic, a result that reveals how neatly the SADn family maps into the Kleene arithmetical hierarchy. Introduction Axiomatising computers The power of SAD computers Remarks regarding the concept of computability.

Recent work on hypercomputation has raised new objections against the Church–Turing Thesis. In this paper, I focus on the challenge posed by a particular kind of hypercomputer, namely, SAD computers. I first consider deterministic and probabilistic barriers to the physical possibility of SAD computation. These suggest several ways to defend a Physical version of the Church–Turing Thesis. I then argue against Hogarth's analogy between non-Turing computability and non-Euclidean geometry, showing that it is a non-sequitur. I conclude that the Effective version (...) of the Church–Turing Thesis is unaffected by SAD computation. (shrink)

We discuss two supertasks invented recently by Laraudogoitia [1996, 1997], Both involve an infinite number of particle collisions within a finite amount of time and both compromise determinism. We point out that the sources of the indeterminism are rather different in the two cases - one involves unbounded particle velocities, the other involves particles with no lower bound to their sizes - and consequently that the implications for determinism are rather different - one form of indeterminism affects Newtonian but not (...) relativistic physics, while the other form is insensitive to the classical vs relativistic distinction. We also note some interesting linkages among supertasks, indeterminism and foundations problems in the general theory of relativity. (shrink)

Supertasks recently discussed in the literature purport to display a failure ofenergy conservation and determinism in Newtonian mechanics. We debatewhether these supertasks are admissible as Newtonian systems, with Earmanand Norton defending the affirmative and Alper and Bridger the negative.

This article shows a clear sense in which general relativity allows for a type of ‘machine’ that can bring about a spacetime structure suitable for the implementation of ‘supertasks’. 1Introduction2Preliminaries3Malament–Hogarth Spacetimes4Machines5Malament–Hogarth Machines6Conclusion.

We tell a story where an agent who chooses in such a way as to make the greatest possible profit on each of an infinite series of transactions ends up worse off than an agent who chooses in such a way as to make the least possible profit on each transaction. That is, contrary to what one might suppose, it is not necessarily rational always to choose the option that yields the greatest possible profit on each transaction.

We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)

A recent proposal by Norton (2003) to show that a simple Newtonian system can exhibit stochastic acausal behavior by giving rise to spontaneous movements of a mass on the dome of a certain shape is examined. We discuss the physical significance of an often overlooked and yet important Lipschitz condition the violation of which leads to the existence of anomalous nontrivial solutions in this and similar cases. We show that the Lipschitz condition is closely linked with the time reversibility of (...) certain solutions in Newtonian mechanics and the failure to incorporate this condition within Newtonian mechanics may unsurprisingly lead to physically impossible solutions that have no serious metaphysical implications. ‡I thank Steven Savitt of the Philosophy Department at the University of British Columbia for drawing my attention to the Lipschitz condition, and Alexei Cheviakov of the Mathematics Department at the University of British Columbia for useful discussions. †To contact the author, please write to: Department of Philosophy, University of British Columbia, Vancouver, BC, V6T 1Z1, Canada; e-mail: [email protected]. (shrink)

This paper discusses the relevance of supertask computation for the determinacy of arithmetic. Recent work in the philosophy of physics has made plausible the possibility of supertask computers, capable of running through infinitely many individual computations in a finite time. A natural thought is that, if supertask computers are possible, this implies that arithmetical truth is determinate. In this paper we argue, via a careful analysis of putative arguments from supertask computations to determinacy, that this natural thought is mistaken: supertasks (...) are of no help in explaining arithmetical determinacy. (shrink)

There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable can exceed the computational barriers of a Turing machine. By suggesting a concrete implementation of a beyond-Turing computer in a spacetime setting, Istvan Nemeti and Gyula David have shown how an appreciation of the physical Church-Turing thesis necessitates the confluence of mathematical, computational, physical, and indeed cosmological ideas. In this (...) essay, I will honour Istvan's seventieth birthday, as well as his longstanding interest in, and his seminal contributions to, this field going back to as early as 1987 by modestly proposing how the concrete implementation in Nemeti and D\'avid might be complemented by a quantum-information-theoretic communication protocol between the computing device and the logician who sets the beyond-Turing computer a task such as determining the consistency of Zermelo-Fraenkel set theory. This suggests that even the foundations of quantum theory and, ultimately, quantum gravity may play an important role in determining the validity of the physical Church-Turing thesis. (shrink)

This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack on a straw man (the ‘maximality thesis’), it discusses proposals for digital hypercomputing with Zeno-machines , i.e. computing machines that compute an infinite number of computing steps in finite time, thus performing supertasks. It argues that effective computing with Zeno-machines falls into a dilemma: either they are specified such (...) that they do not have output states, or they are specified such that they do have output states, but involve contradiction. Repairs though non-effective methods or special rules for semi-decidable problems are sought, but not found. The paper concludes that hypercomputing supertasks are impossible in the actual world and thus no reason for rejection of the Church-Turing thesis in its traditional interpretation. (shrink)

This paper surveys a wide range of proposed hypermachines, examining the resources that they require and the capabilities that they possess. 2005 Elsevier Inc. All rights reserved.

Malament-Hogarth spacetimes are the sort of models within general relativity that seem to allow for the possibility of supertasks. There are various ways in which these spacetimes might be considered physically problematic. Here, we examine these criticisms and investigate the prospect of escaping them.

In this paper I will argue that Tait’s axiomatic conception of mathematics implies that it is in principle impossible to be justified in believing a mathematical statement without being justified in believing that statement to be provable. I will then show that there are possible courses of experience which would justify acceptance of a mathematical statement without justifying belief that this statement is provable.

This chapter contains sections titled: Relationism, Substantivalism and Space‐time Conventionalism about Space‐time Black Holes and Singularities Horizons and Uniformity Conclusion.

This article addresses the question whether supertasks are possible within the context of non-relativistic quantum mechanics. The supertask under consideration consists of performing an infinite number of quantum mechanical measurements in a finite amount of time. Recent arguments in the physics literature claim to show that continuous measurements, understood as N discrete measurements in the limit where N goes to infinity, are impossible. I show that there are certain kinds of measurements in quantum mechanics for which these arguments break down. (...) This suggests that there is a new context in which quantum mechanics, in principle, permits the performance of a supertask. (shrink)

If the computational theory of mind is right, then minds are realized by machines. There is an ordered complexity hierarchy of machines. Some finite machines realize finitely complex minds; some Turing machines realize potentially infinitely complex minds. There are many logically possible machines whose powers exceed the Church–Turing limit (e.g. accelerating Turing machines). Some of these supermachines realize superminds. Superminds perform cognitive supertasks. Their thoughts are formed in infinitary languages. They perceive and manipulate the infinite detail of fractal objects. They (...) have infinitely complex bodies. Transfinite games anchor their social relations. (shrink)

A simultaneous collision that produces paradoxical indeterminism (involving N0 hypothetical particles in a classical three-dimensional Euclidean space) is described in Section 2. By showing that a similar paradox occurs with long-range forces between hypothetical particles, in Section 3, the underlying cause is seen to be that collections of such objects are assumed to have no intrinsic ordering. The resolution of allowing only finite numbers of particles is defended (as being the least ad hoc) by looking at both -sequences (in the (...) context of a very basic supertask, in Section 4) and *-sequences (reversed -sequences, in the form of paradoxical results from the recent literature). Introduction The simultaneous collision The paradox in other contexts The basic problem is N0 things The recent literature Generating N0 things. (shrink)

Pulier (2000, Theory and Decision 49: 291) and Machina (2000, Theory and Decision 49: 293) seek to dissolve the Barrett–Arntzenius infinite decision puzzle (1999, Theory and Decision 46: 101). The proposed dissolutions, however, are based on misunderstandings concerning how the puzzle works and the nature of supertasks more generally. We will describe the puzzle in a simplified form, address the recent misunderstandings, and describe possible morals for decision theory.

This paper develops transfinite extensions of transitivity and acyclicity in the context of population ethics. They are used to argue that it is better to add good lives, worse to add bad lives, and equally good to add neutral lives, where a life's value is understood as personal value. These conclusions rule out a number of theories of population ethics, feed into an argument for the repugnant conclusion, and allow us to reduce different-number comparisons to same-number ones. Challenges to these (...) arguments are addressed, including the issue of comparing existence and non-existence in terms of personal value, the possibility of minimal quanta of time and life, and the meaningfulness of measuring closeness between outcomes with different population sizes. An asymmetry is uncovered between transfinite cycles of worseness and betterness, supporting a version of the weak procreative asymmetry. Transfinite transitivity principles are also favourably compared to the better-known principles of continuity. (shrink)

Kellert (In the Wake of Chars, University of Chicago press, Chicago, 1993) has argued that Laplacean determinism in classical physics is actually a layered concept, where various properties or layers composing this form of determinism can be peeled away. Here, I argue that a layered conception of determinism is inappropriate and that we should think in terms of different deterministic models applicable to different kinds of systems. The upshot of this analysis is that the notion of state is more closely (...) tied to the kind of system being investigated than is usually considered in discussions of determinism. So when investigating determinism corresponding changes to the appropriate notion of state – and, perhaps, the state space itself – also need to be considered. (shrink)

Mi objetivo es discutir las principales dificultades que Frank P. Ramsey encontró en Principia Mathematica y la solución que, vía el Tractatus Logico-Philosophicus, propuso al respecto. Sostengo que las principales dificultades que Ramsey encontró en Principia Mathematica están, todas, relacionadas con que Russell y Whitehead desatendieron la forma lógica de las proposiciones matemáticas, las cuales, según Ramsey, deben ser tautológicas.

The purpose of this paper is to suggest that we are in the midst of a Cantorian bubble, just as, for example, there was a dot com bubble in the late 1990’s.

In this article, I argue that it is impossible to complete infinitely many tasks in a finite time. A key premise in my argument is that the only way to get to 0 tasks remaining is from 1 task remaining, when tasks are done 1-by-1. I suggest that the only way to deny this premise is by begging the question, that is, by assuming that supertasks are possible. I go on to present one reason why this conclusion (that supertasks are (...) impossible) is important, namely that it implies a new verdict on a decision puzzle propounded by Jeffrey Barrett and Frank Arntzenius. (shrink)

This chapter contains sections titled: Highlights of Past Literature Current Work Future Work.

For infinite machines that are free from the classical Thomson’s lamp paradox, we show that they are not free from its inverted-in-time version. We provide a program for infinite machines and an infinite mechanism that demonstrate this paradox. While their finite analogs work predictably, the program and the infinite mechanism demonstrate an undefined behavior. As in the case of infinite Davies machines :671–682, 2001), our examples are free from infinite masses, infinite velocities, infinite forces, etc. Only infinite divisibility of space (...) and time is assumed. Thus, the infinite devices considered are possible in a Newtonian Universe and they do not conflict with Newtonian mechanics. Note that the classical Thomson’s lamp paradox leads to infinite velocities which may not be producible in acceptable models of Newtonian mechanics. Finally, it is shown that the “paradox of predictability” is similar to the inverted Thomson’s lamp paradox. (shrink)