Skip to main content
Log in

Computational versus Causal Complexity

  • Published:
Minds and Machines Aims and scope Submit manuscript

Abstract

The main claim of this paper is that notions of implementation based on an isomorphic correspondence between physical and computational states are not tenable. Rather, ``implementation'' has to be based on the notion of ``bisimulation'' in order to be able to block unwanted implementation results and incorporate intuitions from computational practice. A formal definition of implementation is suggested, which satisfies theoretical and practical requirements and may also be used to make the functionalist notion of ``physical realization'' precise. The upshot of this new definition of implementation is that implementation cannot distinguish isomorphic bisimilar from non-isomporphic bisimilar systems anymore, thus driving a wedge between the notions of causal and computational complexity. While computationalism does not seem to be affected by this result, the consequences for functionalism are not clear and need further investigations.

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.

Similar content being viewed by others

References

  • Agre, P. (1997), Computation and Human Experience, Cambridge: Cambridge University Press.

    Google Scholar 

  • Barwise, J. and Moss, L. (1996), Vicious Circles, CSLI Lecture Notes, Cambridge University Press.

  • Block, N. (1996), 'What is Functionalism?' in The Encyclopedia of Philosophy Supplement, Macmillan.

  • Chalmers, D.J. (1994), 'On Implementing a Computation', Minds and Machines 4, 391–402.

    Google Scholar 

  • Chalmers, D.J. (1996), 'Does a Rock Implement Every Finite-State Automaton?', Synthese 108, 310–333.

    Google Scholar 

  • Chrisley, R.L. (1994), 'Why Everything Doesn't Realize Every Computations', Minds and Machines 4, 391–402.

    Google Scholar 

  • Copeland, B.J. (1996), 'What is Computation?', Synthese 108, 403–420.

    Google Scholar 

  • Cummins, R. (1989), Meaning and Mental Representation, Cambridge, MA, MIT Press.

    Google Scholar 

  • David, M. (1997), 'Kim's Functionalism', in Philosophical Perspectives, 11, Mind, Causation, and World.

  • Hopcroft, J.E. and Ullman, J.D. (1979), Introduction to Automata Theory, Languages, and Computation, Massachusetts, Addison-Wesley Publishing Company.

    Google Scholar 

  • Kim, J. (1998), Mind in a Physical World, Cambridge, MA: MIT Press.

    Google Scholar 

  • MacLennan, B.J. (1994), 'Words Lie in Our Way', Minds and Machines 4, 421–437.

    Google Scholar 

  • Melnyk, A. (1996), 'Searle's Abstract Argument Against Strong AI', Synthese 108, 391–419.

    Google Scholar 

  • Papineau, D. (1995), 'Arguments for Supervenience and Physical Realization'. in Savellos, E. and Yalçin, Ñ, eds., Supervenience, Cambridge University Press.

  • Putnam, H. (1988), Representation and Reality, Cambridge: MIT Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Scheutz, M. Computational versus Causal Complexity. Minds and Machines 11, 543–566 (2001). https://doi.org/10.1023/A:1011855915651

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1011855915651

Navigation