Switch to: Citations

Add references

You must login to add references.
  1. Quine.Elliott Sober & Peter Hylton - 2000 - Aristotelian Society Supplementary Volume 74:237-299.
    In 'Two Dogmas of Empiricism', Quine attacks the analytic/synthetic distinction and defends a doctrine that I call epistemological holism. Now, almost fifty years after the article's appearance, what are we to make of these ideas? I suggest that the philosophical naturalism that Quine did so much to promote should lead us to reject Quine's brief against the analytic/synthetic distinction; I also argue that Quine misunderstood Carnap's views on analyticity. As for epistemological holism, I claim that this thesis does not follow (...)
    Download  
     
    Export citation  
     
    Bookmark   75 citations  
  • The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
    This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...)
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Quine, I.Elliott Sober - 2000 - Aristotelian Society Supplementary Volume 74 (1):237–280.
    In 'Two Dogmas of Empiricism', Quine attacks the analytic/synthetic distinction and defends a doctrine that I call epistemological holism. Now, almost fifty years after the article's appearance, what are we to make of these ideas? I suggest that the philosophical naturalism that Quine did so much to promote should lead us to reject Quine's brief against the analytic/synthetic distinction; I also argue that Quine misunderstood Carnap's views on analyticity. As for epistemological holism, I claim that this thesis does not follow (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • A natural axiomatization of computability and proof of Church’s thesis.Nachum Dershowitz & Yuri Gurevich - 2008 - Bulletin of Symbolic Logic 14 (3):299-350.
    Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turing-computable numeric functions. The Abstract State Machine Theorem states that every classical algorithm is behaviorally equivalent to an abstract state machine. This theorem presupposes three natural postulates about algorithmic computation. Here, we show that augmenting those postulates with an additional requirement regarding basic operations gives a natural axiomatization of computability and a proof of Church's (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • IElliott Sober.Elliott Sober - 2000 - Aristotelian Society Supplementary Volume 74 (1):237-280.
    In ‘Two Dogmas of Empiricism’, Quine attacks the analytic/synthetic distinction and defends a doctrine that I call epistemological holism. Now, almost fifty years after the article’s appearance, what are we to make of these ideas? I suggest that the philosophical naturalism that Quine did so much to promote should lead us to reject Quine’s brief against the analytic/synthetic distinction; I also argue that Quine misunderstood Carnap's views on analyticity. As for epistemological holism, I claim that this thesis does not follow (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • An informal exposition of proofs of gödel's theorems and church's theorem.Barkley Rosser - 1939 - Journal of Symbolic Logic 4 (2):53-60.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • The Physical Church Thesis and Physical Computational Complexity.Itamar Pitowski - 1990 - Iyyun 39:81-99.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • What is an algorithm.Yuri Gurevich - 2012 - Lecture Notes in Computer Science.
    Download  
     
    Export citation  
     
    Bookmark   19 citations