David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
I argue in this paper that not all computations are effective methods. I consider a number of examples, and focus on those drawn from quantum computation. I consider three responses that would allow one to hold onto the claim that all computations are effective methods. I argue that none of these responses is satisfactory. I conclude that the idea motivating the claim, namely, that the class of computations can be characterised in terms of the notion of effective method, has to be given up.1..
|Keywords||No keywords specified (fix it)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Shimon Edelman (2008). On the Nature of Minds, Or: Truth and Consequences. Journal of Experimental and Theoretical Ai 20:181-196.
Gualtiero Piccinini (2007). Connectionist Computation. In , Proceedings of the 2007 International Joint Conference on Neural Networks.
Gualtiero Piccinini (2008). Some Neural Networks Compute, Others Don't. Neural Networks 21 (2-3):311-321.
Paul P. Maglio (1997). Beyond Embodiment: Cognition as Interactive Skill. Behavioral and Brain Sciences 20 (4):753-754.
Mark Sprevak (2010). Computation, Individuation, and the Received View on Representation. Studies in History and Philosophy of Science Part A 41 (3):260-270.
Gualtiero Piccinini (2010). The Resilience of Computationalism. Philosophy of Science 77 (5):852-861.
Clement F. Kent & Bernard R. Hodgson (1989). Extensions of Arithmetic for Proving Termination of Computations. Journal of Symbolic Logic 54 (3):779-794.
E. J. Farkas (1988). A Faithful Embedding of Parallel Computations in Star-Finite Models. Studia Logica 47 (3):203 - 212.
Verónica Becher & Santiago Figueira (2005). Kolmogorov Complexity for Possibly Infinite Computations. Journal of Logic, Language and Information 14 (2):133-148.
Added to index2009-01-28
Total downloads8 ( #165,478 of 1,096,839 )
Recent downloads (6 months)1 ( #273,068 of 1,096,839 )
How can I increase my downloads?