Minds and Machines 4 (4):403-20 (1994)
|Abstract||Some have suggested that there is no fact to the matter as to whether or not a particular physical system relaizes a particular computational description. This suggestion has been taken to imply that computational states are not real, and cannot, for example, provide a foundation for the cognitive sciences. In particular, Putnam has argued that every ordinary open physical system realizes every abstract finite automaton, implying that the fact that a particular computational characterization applies to a physical system does not tell oneanything about the nature of that system. Putnam''s argument is scrutinized, and found inadequate because, among other things, it employs a notion of causation that is too weak. I argue that if one''s view of computation involves embeddedness (inputs and outputs) and full causality, one can avoid the universal realizability results. Therefore, the fact that a particular system realizes a particular automaton is not a vacuous one, and is often explanatory. Furthermore, I claim that computation would not necessarily be an explanatorily vacuous notion even if it were universally realizable|
|Keywords||Cognition Computation Machine Science Turing, A|
|Through your library||Configure|
Similar books and articles
Itamar Pitowsky (2002). Quantum Speed-Up of Computations. Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
Selmer Bringsjord (1994). Computation, Among Other Things, is Beneath Us. Minds and Machines 4 (4):469-88.
David J. Chalmers (2011). A Computational Foundation for the Study of Cognition. Journal of Cognitive Science 12 (4):323-357.
Selmer Bringsjord (2001). In Computation, Parallel is Nothing, Physical Everything. Minds and Machines 11 (1):95-99.
Paolo Cotogno (2003). Hypercomputation and the Physical Church-Turing Thesis. British Journal for the Philosophy of Science 54 (2):181-223.
Nir Fresco (2011). Concrete Digital Computation: What Does It Take for a Physical System to Compute? Journal of Logic, Language and Information 20 (4):513-537.
David J. Chalmers (1996). Does a Rock Implement Every Finite-State Automaton? Synthese 108 (3):309-33.
David J. Chalmers (1994). On Implementing a Computation. Minds and Machines 4 (4):391-402.
Valerie Gray Hardcastle (1995). Computationalism. Synthese 105 (3):303-17.
Added to index2009-01-28
Total downloads22 ( #57,056 of 556,837 )
Recent downloads (6 months)1 ( #64,847 of 556,837 )
How can I increase my downloads?