Switch to: References

Citations of:

Comments on Professor Benacerraf's Paper

In Wesley Charles Salmon (ed.), Zeno’s Paradoxes. Indianapolis, IN, USA: Bobbs-Merrill. pp. 130--138 (1970)

Add citations

You must login to add citations.
  1. The Infinity from Nothing paradox and the Immovable Object meets the Irresistible Force.Nicholas Shackel - 2018 - European Journal for Philosophy of Science 8 (3):417-433.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A discrete solution for the paradox of Achilles and the tortoise.Vincent Ardourel - 2015 - Synthese 192 (9):2843-2861.
    In this paper, I present a discrete solution for the paradox of Achilles and the tortoise. I argue that Achilles overtakes the tortoise after a finite number of steps of Zeno’s argument if time is represented as discrete. I then answer two objections that could be made against this solution. First, I argue that the discrete solution is not an ad hoc solution. It is embedded in a discrete formulation of classical mechanics. Second, I show that the discrete solution cannot (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Do Accelerating Turing Machines Compute the Uncomputable?B. Jack Copeland & Oron Shagrir - 2011 - Minds and Machines 21 (2):221-239.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • A proof of the impossibility of completing infinitely many tasks.Jeremy Gwiazda - 2012 - Pacific Philosophical Quarterly 93 (1):1-7.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Accelerating Turing machines.B. Jack Copeland - 2002 - Minds and Machines 12 (2):281-300.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • (1 other version)Lamps, cubes, balls and walls: Zeno problems and solutions.Jeanne Peijnenburg & David Atkinson - 2010 - Philosophical Studies 150 (1):49-59.
    Various arguments have been put forward to show that Zeno-like paradoxes are still with us. A particularly interesting one involves a cube composed of colored slabs that geometrically decrease in thickness. We first point out that this argument has already been nullified by Paul Benacerraf. Then we show that nevertheless a further problem remains, one that withstands Benacerraf’s critique. We explain that the new problem is isomorphic to two other Zeno-like predicaments: a problem described by Alper and Bridger in 1998 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • The three arrows of Zeno.Craig Harrison - 1996 - Synthese 107 (2):271 - 292.
    We explore the better known paradoxes of Zeno including modern variants based on infinite processes, from the point of view of standard, classical analysis, from which there is still much to learn (especially concerning the paradox of division), and then from the viewpoints of non-standard and non-classical analysis (the logic of the latter being intuitionist).The standard, classical or Cantorian notion of the continuum, modeled on the real number line, is well known, as is the definition of motion as the time (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Lamps, cubes, balls and walls: Zeno problems and solutions.Jeanne Peijnenburg & David Atkinson - 2010 - Philosophical Studies 150 (1):49 - 59.
    Various arguments have been put forward to show that Zeno-like paradoxes are still with us. A particularly interesting one involves a cube composed of colored slabs that geometrically decrease in thickness. We first point out that this argument has already been nullified by Paul Benacerraf. Then we show that nevertheless a further problem remains, one that withstands Benacerraf s critique. We explain that the new problem is isomorphic to two other Zeno-like predicaments: a problem described by Alper and Bridger in (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • ‘Whys’ and ‘Hows’ of Using Philosophy in Mathematics Education.Uffe Thomas Jankvist & Steffen Møllegaard Iversen - 2014 - Science & Education 23 (1):205-222.
    Download  
     
    Export citation  
     
    Bookmark  
  • The Impossibility of Superfeats.Michael B. Burke - 2000 - Southern Journal of Philosophy 38 (2):207-220.
    Is it logically possible to perform a "superfeat"? That is, is it logically possible to complete, in a finite time, an infinite sequence of distinct acts? In opposition to the received view, I argue that all physical superfeats have kinematic features that make them logically impossible.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Quantum measurements and supertasks.Alisa Bokulich - 2003 - International Studies in the Philosophy of Science 17 (2):127 – 136.
    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. (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations