Publication Cover
Philosophical Explorations
An International Journal for the Philosophy of Mind and Action
Latest Articles
70
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Wide computationalism revisited: distributed mechanisms, parsimony and testability

Received 24 Oct 2023, Accepted 01 Mar 2024, Published online: 24 Mar 2024
 

ABSTRACT

Recent years have seen a surge of interest in applying mechanistic thinking to computational accounts of implementation and individuation. One recent extension of this work involves so-called ‘wide’ approaches to computation, the view that computational processes spread out beyond the boundaries of the individual. These ‘mechanistic accounts of wide computation’ maintain that computational processes are wide in virtue of being part of mechanisms that extend beyond the boundary of the individual. This paper aims to further develop the mechanistic account of wide computationalism by responding to two outstanding worries, what are called the parsimony and testability challenges. The first is based on considerations about wide computation’s ontological cost; the second the view’s experimental testability. The argument is that wide mechanistic computationalism can gain the necessary conceptual resources to address the challenges by embracing two further aspects of the mechanistic approach: (i) the structural aspect of mechanistic explanation and (ii) the notion of constitutive relevance.

Acknowledgements

I want to thank Mark Sprevak, Marcin Milkowski, and Dave Ward for constructive feedback on earlier drafts of this paper. I also want to thank two anonymous referees from the journal for their helpful comments.

Disclosure statement

No potential conflict of interest was reported by the author(s).

Notes

1 For examples of wide mechanistic computation, see Kersten (Citation2017), Nowakowski (Citation2017), and Smart (Citation2018).

2 In contrast, Harbecke (Citation2014) argues that mechanistic constitution involves local supervenience. If what is said here is on track, though, this view should be rejected, as computational processes can indeed ‘supervene’ on distributed mechanisms. For a detailed argument against the view, see Wilson (Citation1995, ch.6).

Additional information

Funding

This work was generously supported by the Killam Trust under Grant RES0064987.

Notes on contributors

Luke Kersten

Luke Kersten is currently a Killam Postdoctoral Fellow at the University of Alberta. His research focuses mostly on issues in the philosophy of mind and cognitive science, with additional interests in the philosophy of science.

Log in via your institution

Log in to Taylor & Francis Online

PDF download + Online access

  • 48 hours access to article PDF & online version
  • Article PDF can be downloaded
  • Article PDF can be printed
USD 53.00 Add to cart

Issue Purchase

  • 30 days online access to complete issue
  • Article PDFs can be downloaded
  • Article PDFs can be printed
USD 233.00 Add to cart

* Local tax will be added as applicable

Related Research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.