Implementation and indeterminacy

Abstract
David Chalmers has defended an account of what it is for a physical system to implement a computation. The account appeals to the idea of a “combinatorial-state automaton” or CSA. It is unclear whether Chalmers intends the CSA to be a computational model in the usual sense, or merely a convenient formalism into which instances of other models can be translated. I argue that the CSA is not a computational model in the usual sense because CSAs do not perspicuously represent algorithms, are too powerful both in that they can perform any computation in a single step and in that without so far unspecified restrictions they can “compute” the uncomputable, and are too loosely related to physical implementations
Keywords No keywords specified (fix it)
Categories (categorize this paper)
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 29,820
External links

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.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles
Computational Vs. Causal Complexity.Matthias Scheutz - 2001 - Minds and Machines 11 (4):543-566.
Concrete Digital Computation: What Does It Take for a Physical System to Compute? [REVIEW]Nir Fresco - 2011 - Journal of Logic, Language and Information 20 (4):513-537.
A Computational Foundation for the Study of Cognition.David J. Chalmers - 2011 - Journal of Cognitive Science 12 (4):323-357.
When Physical Systems Realize Functions.Matthias Scheutz - 1999 - Minds and Machines 9 (2):161-196.
Against Structuralist Theories of Computational Implementation.Michael Rescorla - 2013 - British Journal for the Philosophy of Science 64 (4):681-707.
On Implementing a Computation.David J. Chalmers - 1994 - Minds and Machines 4 (4):391-402.
Added to PP index
2009-01-28

Total downloads
39 ( #144,310 of 2,210,223 )

Recent downloads (6 months)
2 ( #223,929 of 2,210,223 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature