Skip to main content
Log in

Computation, Implementation, Cognition

  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

Putnam (Representations and reality. MIT Press, Cambridge, 1988) and Searle (The rediscovery of the mind. MIT Press, Cambridge, 1992) famously argue that almost every physical system implements every finite computation. This universal implementation claim, if correct, puts at the risk of triviality certain functional and computational views of the mind. Several authors have offered theories of implementation that allegedly avoid the pitfalls of universal implementation. My aim in this paper is to suggest that these theories are still consistent with a weaker result, which is the nomological possibility of systems that simultaneously implement different complex automata. Elsewhere I (Shagrir in J Cogn Sci, 2012) argue that this simultaneous implementation result challenges a computational sufficiency thesis (articulated by Chalmers in J Cogn Sci, 2012). My focus here is on theories of implementation. After presenting the basic simultaneous implementation construction, I argue that these theories do not avoid the simultaneous implementation result. The conclusion is that the idea that the implementation of the right kind of automaton suffices for a possession of a mind is dubious.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Notes

  1. An early version (from the 1970s) of this argument is attributed to Ian Hinckfuss (see in Cleland 2002). Hinckfuss points out that under a suitable categorization of states, a bucket of water sitting in the sun (The "Hinckfuss' pail") can be taken to implement the functional organization of a human agent.

  2. See, for example, Block (1995), Chrisley (1994), Copeland (1996), and Melnyk (1996).

  3. Minsky (1967) demonstrates the equivalence between these descriptions (the proof is on pp. 55-58; the gate-description is presented in terms of McCulloch and Pitts "cells").

  4. Sprevak (2010) presents this result more elegantly without invoking tri-stable flip-detectors.

  5. See also Scheutz (1999); for a related discussion see Melnyk (1996) and Godfrey-Smith (2009). Godfrey-Smith mainly addresses triviality arguments that group different types of physical states into one "implementing" type via disjunction. He thus suggests that the "substate variables map to independent parts of the realizing system", and that "the parts' microstates grouped into coarse-grained categories be physically similar" (2009: 292). I concur with these modifications, but they do not undermine my construction, which does not proceed through disjunctive grouping.

  6. One could stipulate that minds are to be associated with characteristic automata but this condition is obviously ad hoc. This will entail that one loses her mind if some of her neurons turns out to be tri-stable rather than bi-stable.

  7. Thus Chalmers (2012) writes: "It will be noted that nothing in my account of computation and implementation invokes any semantic considerations, such as the representational content of internal states. This is precisely as it should be: computations are specified syntactically, not semantically".

  8. Godfrey-Smith (2009) distinguishes between a broad and a narrow construal of inputs and outputs.

  9. This was suggested by Putnam (see the discussion in the “Putnam’s Argument” section). Godfrey-Smith (2009) advances an argument that aims to show that merely appealing to physical I/O does not block (other) triviality results.

  10. There might be other physical properties that the robot metal arm and the biological human arm share; see Block(1978) for general discussion.

  11. Something along these lines has been proposed by Scheutz (private communication).

  12. It should be noted, however, that Piccinini does not aim to support CST. His proposal targets claims about individuation.

References

  • Block, N. (1978). Troubles with functionalism. In: W. Savage (ed.) Perception and Cognition: Issues in the foundations of psychology, Minnesota Studies in the Philosophy of Science (Vol. 9, pp. 261–325). Minneapolis: University of Minnesota Press.

  • Block, N. (1995). The mind as the software of the brain. In D. Osherson, L. Gleitman, S. Kosslyn, E. Smith, & S. Sternberg (Eds.), An invitation to cognitive science, volume 3: Thinking (2nd ed., pp. 377–425). Cambridge, MA: MIT Press.

    Google Scholar 

  • Chalmers, J. D. (1995). Absent qualia, fading qualia, dancing qualia. In T. Metzinger (Ed.), Conscious experience. Paderborn: Ferdinand-Schoningh.

    Google Scholar 

  • Chalmers, J. D. (1996). Does a rock implement every finite-state automaton? Synthese, 108, 309–333.

    Article  MathSciNet  MATH  Google Scholar 

  • Chalmers, J. D. (2012). A computational foundation for the study of cognition. The Journal of Cognitive Science, forthcoming.

  • Chrisley, L. R. (1994). Why everything doesn’t realize every computation. Minds and Machines, 4, 403–420.

    Article  Google Scholar 

  • Cleland, E. C. (2002). On effective procedures. Minds and Machines, 12, 159–179.

    Article  MATH  Google Scholar 

  • Copeland, B. J. (1996). What is computation? Synthese, 108, 335–359.

    Article  MathSciNet  MATH  Google Scholar 

  • Godfrey-Smith, P. (2009). Triviality arguments against functionalism. Philosophical Studies, 145, 273–295.

    Article  Google Scholar 

  • Melnyk, A. (1996). Searle’s abstract argument against strong AI. Synthese, 108, 391–419.

    Article  MathSciNet  MATH  Google Scholar 

  • Minsky, M. (1967). Computation: Finite and infinite machines. Englewood Cliffs, NJ: Prentice-Hall.

    MATH  Google Scholar 

  • Moore, C. (1990). Unpredictability and undecidability in dynamical systems. Physical Review Letters, 64, 2354–2357.

    Article  MathSciNet  MATH  Google Scholar 

  • Piccinini, G. (2008). Computation without representation. Philosophical Studies, 137, 205–241.

    Article  MathSciNet  Google Scholar 

  • Putnam, H. (1988). Representations and reality. Cambridge, MA: MIT Press.

    Google Scholar 

  • Scheutz, M. (1999). When physical systems realize functions. Minds and Machines, 9, 161–196.

    Article  Google Scholar 

  • Scheutz, M. (2001). Causal vs. computational complexity? Minds and Machines, 11, 534–566.

    Article  Google Scholar 

  • Searle, J. (1992). The rediscovery of the mind. Cambridge, MA: MIT Press.

    Google Scholar 

  • Shagrir, O. (2001). Content, computation and externalism. Mind, 110, 369–400.

    Article  Google Scholar 

  • Shagrir, O. (2012) Can a brain possess two minds? Journal of Cognitive Science, forthcoming.

  • Sprevak, M. (2010). Computation, individuation, and the received view on representation. Studies in History and Philosophy of Science, 41, 260–270.

    Article  Google Scholar 

Download references

Acknowledgments

I am grateful to Darren Abramson, Matthias Scheutz, Eli Dresner, Ilan Finkelstein, and three anonymous referees, for their comments, suggestions and corrections. The paper was presented in the Philosophy and Theory of Artificial Intelligence (PT-AI 2011) conference in Thessaloniki (October 2011). I am thankful to the participants for the lively and thorough discussion. This research was supported by The Israel Science Foundation, grant 1509/11.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oron Shagrir.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shagrir, O. Computation, Implementation, Cognition. Minds & Machines 22, 137–148 (2012). https://doi.org/10.1007/s11023-012-9280-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11023-012-9280-4

Keywords

Navigation