- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Narrow versus wide mechanism
In Matthias Scheutz (ed.), Computationalism: New Directions. MIT Press. pp. 5-32 (2002)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Narrow Versus Wide Mechanism: Including a Re-Examination of Turing’s Views on the Mind-Machine Issue.B. Jack Copeland - 2000 - Journal of Philosophy 97 (1):5-32.
The irrelevance of Turing machines to AI.Aaron Sloman - 2002 - In Matthias Scheutz (ed.), Computationalism: New Directions. MIT Press.
B. jack Copeland (ed), the essential Turing.Amnon H. Eden - 2007 - Minds and Machines 17 (1):121-123.
From Symbol to ‘Symbol’, to Abstract Symbol: Response to Copeland and Shagrir on Turing-Machine Realism Versus Turing-Machine Purism.Eli Dresner & Ofra Rechter - 2016 - Minds and Machines 26 (3):253-257.
The foundations of computing.Brian Cantwell Smith - 2002 - In Matthias Scheutz (ed.), Computationalism: New Directions. MIT Press.
Wide computationalism revisited: distributed mechanisms, parismony and testability.Luke Kersten - 2024 - Philosophical Explorations 27 (2):1-18.
Review of The essential turing by B. Jack Copeland (ed), Oxford University Press, Oxford, GB, 2004. [REVIEW]Paul Reviewer-Huygen - 2006 - Artificial Intelligence and Law 14 (1):143-150.
B. Jack Copeland, Carl J. Posy, Oron Shagrir eds. Computability: Turing, Gödel, Church, and Beyond: Books of Essays.[author unknown] - 2014 - Philosophia Mathematica 22 (1):141-141.
Wide computationalism revisited: distributed mechanisms, parsimony and testability.Luke Kersten - 2024 - Philosophical Explorations 27 (3):280-297.
Analytics
Added to PP
2009-01-28
Downloads
62 (#345,540)
6 months
5 (#1,062,008)
2009-01-28
Downloads
62 (#345,540)
6 months
5 (#1,062,008)
Historical graph of downloads
Author's Profile
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-ls7fw uwo