Switch to: References

Add citations

You must login to add citations.
  1. Supertasks.Jon Pérez Laraudogoitia - 2008 - Stanford Encyclopedia of Philosophy.
  • Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes.John Earman & John D. Norton - 1993 - Philosophy of Science 60 (1):22-42.
    The standard theory of computation excludes computations whose completion requires an infinite number of steps. Malament-Hogarth spacetimes admit observers whose pasts contain entire future-directed, timelike half-curves of infinite proper length. We investigate the physical properties of these spacetimes and ask whether they and other spacetimes allow the observer to know the outcome of a computation with infinitely many steps.
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   44 citations  
  • Effective Physical Processes and Active Information in Quantum Computing.Ignazio Licata - 2007 - Quantum Biosystems 1 (1):51-65.
    The recent debate on hypercomputation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics.We propose here the idea of “effective physical process” as the essentially physical notion of computation. By using the Bohm and Hiley active information concept we analyze the differences between the standard form (quantum gates) and the non-standard one (adiabatic and morphogenetic) of Quantum Computing, and we point out how its Super-Turing potentialities derive from an incomputable information (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logically Possible Machines.Eric Steinhart - 2002 - Minds and Machines 12 (2):259-280.
    I use modal logic and transfinite set-theory to define metaphysical foundations for a general theory of computation. A possible universe is a certain kind of situation; a situation is a set of facts. An algorithm is a certain kind of inductively defined property. A machine is a series of situations that instantiates an algorithm in a certain way. There are finite as well as transfinite algorithms and machines of any degree of complexity (e.g., Turing and super-Turing machines and more). There (...)
    Direct download (15 more)  
     
    Export citation  
     
    Bookmark   7 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 (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations