Minds and Machines

, Volume 11, Issue 4, pp 543–566

Computational versus Causal Complexity

  • Matthias Scheutz
Article

DOI: 10.1023/A:1011855915651

Cite this article as:
Scheutz, M. Minds and Machines (2001) 11: 543. doi:10.1023/A:1011855915651

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.

causal complexitycognitive sciencecomputationcomputational complexitycomputationalismfunctional architecturefunctionalismimplementationrealization

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Matthias Scheutz
    • 1
  1. 1.Department of Computer Science and EngineeringUniversity of Notre DameNotre DameUSA