Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Laplace's demon consults an oracle: The computational complexity of prediction.Itamar Pitowsky - 1996 - Studies in History and Philosophy of Science Part B: Studies in History and Philosophy of Modern Physics 27 (2):161-180.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • 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.
    Download  
     
    Export citation  
     
    Bookmark   54 citations  
  • Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
    Download  
     
    Export citation  
     
    Bookmark   223 citations  
  • The Church-Turing Thesis and Hyper-computation.O. Shagrir & I. Pitowsky - forthcoming - Minds and Machines.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Church's Thesis and Principles for Mechanisms.Robin Gandy - 1980 - In The Kleene Symposium. North-Holland. pp. 123--148.
    Download  
     
    Export citation  
     
    Bookmark   74 citations  
  • (1 other version)An Abstract Model For Parallel Computations: Gandy’s Thesis.Wilfried Sieg & John Byrnes - 1999 - The Monist 82 (1):150-164.
    Wilfried Sieg and John Byrnes. AnModel for Parallel Computation: Gandy's Thesis.
    Download  
     
    Export citation  
     
    Bookmark   13 citations