The Swapping Constraint
- 56 Downloads
Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states. In this paper, I propose a novel constraint on the kinds of physical states that can implement computational states, which helps to specify what it is for two physical states to non-trivially implement the same computational state.
KeywordsComputational triviality Computational theory of mind Finite state automata Computational implementation
- Chalmers, D. (2011). A computational foundation for the study of cognition. Journal of Cognitive Science, 12(4), 323–357.Google Scholar
- Glisky, E. (2007). Changes in cognitive function in human aging. In D. Riddle (Ed.), Brain aging: Models, methods, and mechanisms. Boca Ratonn, FL: CRC Press.Google Scholar
- Glisky, E., & Kong, L. (2008). Do young and older adults rely on different processes in source memory tasks? A neuropsychological study. Journal of Experimental Psychology: Learning, Memory, and Cognition, 34(4), 809–822.Google Scholar
- Kaplan, D. M. (2017). Neural computation, multiple realizability, and the prospects for mechanistic explanation. In D. M. Kaplan (Ed.), Explanation and integration in mind and brain science. Oxford: Oxford University Press.Google Scholar
- Olson, E. T. (2002). What does functionalism tell us about personal identity? Noûs, 36(4), 682–698. http://www.jstor.org/stable/3506231.
- Putnam, H. (1987). Representation and reality. Cambridge, MA: MIT Press.Google Scholar
- Shoemaker, S. (2004). Functionalism and personal identity: A reply. Noûs, 38(3), 525–533. http://www.jstor.org/stable/3506251.