Computation and Multiple Realizability

In Vincent Müller (ed.), Fundamental Issues of Artificial Intelligence. Springer. pp. 29-41 (2016)
Download Edit this record How to cite View on PhilPapers
Abstract
Multiple realizability (MR) is traditionally conceived of as the feature of computational systems, and has been used to argue for irreducibility of higher-level theories. I will show that there are several ways a computational system may be seen to display MR. These ways correspond to (at least) five ways one can conceive of the function of the physical computational system. However, they do not match common intuitions about MR. I show that MR is deeply interest-related, and for this reason, difficult to pin down exactly. I claim that MR is of little importance for defending computationalism, and argue that it should rather appeal to organizational invariance or substrate neutrality of computation, which are much more intuitive but cannot support strong antireductionist arguments.
PhilPapers/Archive ID
MIKCAM
Revision history
Archival date: 2016-10-21
View upload history
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Added to PP index
2016-06-10

Total views
118 ( #19,766 of 38,034 )

Recent downloads (6 months)
12 ( #25,251 of 38,034 )

How can I increase my downloads?

Monthly downloads since first upload
This graph includes both downloads from PhilArchive and clicks to external links.