The so-called integration problem concerning mechanistic and computational explanation asks how they are related to each other. One approach is that a computational explanation is a species of mechanistic explanation. According to this view, computational or mathematical descriptions are mechanism sketches or macroscopic descriptions that include computationally relevant and exclude computationally irrelevant physical properties. Some suggest that this results in a so-called single hierarchy view of physical computation, where computational or mathematical properties sit together in the same mechanistic hierarchy with (...) the implementational properties. This view can be contrasted with a separate hierarchy view, according to which computational and physical descriptions have their own hierarchies which are related to each other via a bridging implementation relation. The single hierarchy view has been criticized for downplaying the explanatory value of computational explanations and not being hospitable to multiple realization of cognitive processes. In this paper, I argue that the aforementioned criticisms fail, and there might be a deeper problem with the single hierarchy view, which is that the single hierarchy view might collapse into a separate hierarchy view. The kind of abstraction used by the single hierarchy view does not seem to grant mathematical or computational descriptions but only more stripped physical or implementational descriptions. (shrink)

This paper takes up a recent challenge to mechanistic approaches to computational implementation, the view that computational implementation is best explicated within a mechanistic framework. The challenge, what has been labelled “the abstraction problem”, claims that one of MAC’s central pillars – medium independence – is deeply confused when applied to the question of computational implementation. The concern is that while it makes sense to say that computational processes are abstract (i.e. medium-independent), it makes considerably less sense to say that (...) they are also concrete processes of a mechanism. After outlining the problem and its effect on MAC, I examine a recent response from Kuokkanen and Rusanen [2018. “Making Too Many Enemies: Hutto and Myin’s Attack on Computationalism.” Philosophical Explorations 21 (2): 282–294. doi:10.1080/13869795.2018.1477980]. I argue that Kuokkanen and Rusanen’s response comes up short insofar as it makes problematic trade-offs among various desiderata we have for a theory of implementation. This leads to a general dilemma for MAC: either give up being an objective theory of implementation or concede the abstraction problem and so reintroduce triviality concerns. In response, I argue that conceiving of computations as abstracta rather than illata provides a way to avoid the proposed dilemma and articulate a notion of medium independence that addresses the abstraction problem. (shrink)