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)

The Barrett and Arntzenius (1999) decision paradox involves unbounded wealth, the relationship between period-wise and sequence-wise dominance, and an infinite-period split-minute setting. A version of their paradox involving bounded (in fact, constant) wealth decisions is presented, along with a version involving no decisions at all. The common source of paradox in Barrett–Arntzenius and these other examples is the indeterminacy of their infinite-period split-minute setting.

I consider two puzzles in which an agent undergoes a sequence of decision problems. In both cases it is possible to respond rationally to any given problem yet it is impossible to respond rationally to every problem in the sequence, even though the choices are independent. In particular, although it might be a requirement of rationality that one must respond in a certain way at each point in the sequence, it seems it cannot be a requirement to respond as such (...) at every point for that would be to require the impossible. (shrink)

The idea that beliefs may be stake-sensitive is explored. This is the idea that the strength with which a single, persistent belief is held may vary and depend upon what the believer takes to be at stake. The stakes in question are tied to the truth of the belief—not, as in Pascal’s wager and other cases, to the belief’s presence. Categorical beliefs and degrees of belief are considered; both kinds of account typically exclude the idea and treat belief as stake-invariant (...) , though an exception is briefly described. The role of the assumption of stake-invariance in familiar accounts of degrees of belief is also discussed, and morals are drawn concerning finite and countable Dutch book arguments. (shrink)

Suppose that you prefer A to B, B to C, and C to A. Your preferences violate Expected Utility Theory by being cyclic. Money-pump arguments offer a way to show that such violations are irrational. Suppose that you start with A. Then you should be willing to trade A for C and then C for B. But then, once you have B, you are offered a trade back to A for a small cost. Since you prefer A to B, you (...) pay the small sum to trade from B to A. But now you have been turned into a money pump. You are back to the alternative you started with but with less money. This Element shows how each of the axioms of Expected Utility Theory can be defended by money-pump arguments of this kind. The Element also defends money-pump arguments from the standard objections to this kind of approach. This title is also available as Open Access on Cambridge Core. (shrink)

It is usually supposed that, with his dichotomy paradox, Zeno gave birth to the modern so-called supertask debate – the debate of whether carrying out an infinite sequence of actions or operations...

In this survey, a recent computational methodology paying a special attention to the separation of mathematical objects from numeral systems involved in their representation is described. It has been introduced with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework in all the situations requiring these notions. The methodology does not contradict Cantor’s and non-standard analysis views and is based on the Euclid’s Common Notion no. 5 “The whole is greater than the (...) part” applied to all quantities (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The methodology uses a computational device called the Infinity Computer (patented in USA and EU) working numerically (recall that traditional theories work with infinities and infinitesimals only symbolically) with infinite and infinitesimal numbers that can be written in a positional numeral system with an infinite radix. It is argued that numeral systems involved in computations limit our capabilities to compute and lead to ambiguities in theoretical assertions, as well. The introduced methodology gives the possibility to use the same numeral system for measuring infinite sets, working with divergent series, probability, fractals, optimization problems, numerical differentiation, ODEs, etc. (recall that traditionally different numerals lemniscate; Aleph zero, etc. are used in different situations related to infinity). Numerous numerical examples and theoretical illustrations are given. The accuracy of the achieved results is continuously compared with those obtained by traditional tools used to work with infinities and infinitesimals. In particular, it is shown that the new approach allows one to observe mathematical objects involved in the Hypotheses of Continuum and the Riemann zeta function with a higher accuracy than it is done by traditional tools. It is stressed that the hardness of both problems is not related to their nature but is a consequence of the weakness of traditional numeral systems used to study them. It is shown that the introduced methodology and numeral system change our perception of the mathematical objects studied in the two problems. (shrink)

Approaching Infinity addresses seventeen paradoxes of the infinite, most of which have no generally accepted solutions. The book addresses these paradoxes using a new theory of infinity, which entails that an infinite series is uncompletable when it requires something to possess an infinite intensive magnitude. Along the way, the author addresses the nature of numbers, sets, geometric points, and related matters. The book addresses the need for a theory of infinity, and reviews both old and new theories of infinity. It (...) discussing the purposes of studying infinity and the troubles with traditional approaches to the problem, and concludes by offering a solution to some existing paradoxes. (shrink)

This paper considers non-standard analysis and a recently introduced computational methodology based on the notion of ①. The latter approach was developed with the intention to allow one to work with infinities and infinitesimals numerically in a unique computational framework and in all the situations requiring these notions. Non-standard analysis is a classical purely symbolic technique that works with ultrafilters, external and internal sets, standard and non-standard numbers, etc. In its turn, the ①-based methodology does not use any of these (...) notions and proposes a more physical treatment of mathematical objects separating the objects from tools used to study them. It both offers a possibility to create new numerical methods using infinities and infinitesimals in floating-point computations and allows one to study certain mathematical objects dealing with infinity more accurately than it is done traditionally. In these notes, we explain that even though both methodologies deal with infinities and infinitesimals, they are independent and represent two different philosophies of Mathematics that are not in a conflict. It is proved that texts :539–555, 2017; Gutman and Kutateladze in Sib Math J 49:835–841, 2008; Kutateladze in J Appl Ind Math 5:73–75, 2011) asserting that the ①-based methodology is a part of non-standard analysis unfortunately contain several logical fallacies. Their attempt to show that the ①-based methodology can be formalized within non-standard analysis is similar to trying to show that constructivism can be reduced to the traditional Mathematics. (shrink)

This paper considers a range of infinite exchange problems, including one recent example discussed by Barrett and Arntzenius, and propose a general taxonomy based on cardinality considerations and the possibility of identifying and tracking the units of exchange.

Pragmatic arguments seek to demonstrate that you can be placed in a situation in which you will face a sure and foreseeable loss if you do not behave in accordance with some principle P. In this article I show that for every P entailed by the principle of maximizing expected utility you will not be better off from a pragmatic point of view if you accept P than if you don’t, because even if you obey the axioms of expected utility (...) theory it is possible to place you in a situation in which you will face a certain and foreseeable loss. This shows that for a large class of Ps, there is no pragmatic difference between people who accept P and those who don’t. (shrink)

We examine a distinctive kind of problem for decision theory, involving what we call discontinuity at infinity. Roughly, it arises when an infinite sequence of choices, each apparently sanctioned by plausible principles, converges to a ‘limit choice’ whose utility is much lower than the limit approached by the utilities of the choices in the sequence. We give examples of this phenomenon, focusing on Arntzenius et al.’s Satan’s apple, and give a general characterization of it. In these examples, repeated dominance reasoning (...) (a paradigm of rationality) apparently gives rise to a situation closely analogous to having intransitive preferences (a paradigm of irrationality). Indeed, the agents in these examples are vulnerable to a money pump set-up despite having preferences that exhibit no obvious defect of rationality. We explore several putative solutions to such problems, particularly those that appeal to binding and to deliberative dynamics. We consider the prospects for these solutions, concluding that if they fail, the examples show that money pump arguments are invalid. (shrink)

The recently proposed ``infinite decision puzzle'' is based on incorrect mathematics.