Skip to main content

Advertisement

Log in

Integrating computation into the mechanistic hierarchy in the cognitive and neural sciences

  • S.I.: Explanations in Cognitive Science: Unification vs Pluralism
  • Published:
Synthese Aims and scope Submit manuscript

Abstract

It is generally accepted that, in the cognitive and neural sciences, there are both computational and mechanistic explanations. We ask how computational explanations can integrate into the mechanistic hierarchy. The problem stems from the fact that implementation and mechanistic relations have different forms. The implementation relation, from the states of an abstract computational system (e.g., an automaton) to the physical, implementing states is a homomorphism mapping relation. The mechanistic relation, however, is that of part/whole; the explaining features in a mechanistic explanation are the components of the explanandum phenomenon and their causal organization. Moreover, each component in one level of mechanism is constituted and explained by components of an underlying level of mechanism. Hence, it seems, computational variables and functions cannot be mechanistically explained by the medium-dependent states and properties that implement them. How then, do the computational and the implementational integrate to create the mechanistic hierarchy? After explicating the general problem (Sect. 2), we further demonstrate it through a concrete example, of reinforcement learning, in the cognitive and neural sciences (Sects. 3 and 4). We then examine two possible solutions (Sect. 5). On one solution, the mechanistic hierarchy embeds at the same levels computational and implementational properties. This picture fits with the view that computational explanations are mechanistic sketches. On the other solution, there are two separate hierarchies, one computational and another implementational, which are related by the implementation relation. This picture fits with the view that computational explanations are functional and autonomous explanations. It is less clear how these solutions fit with the view that computational explanations are full-fledged mechanistic explanations. Finally, we argue that both pictures are consistent with the reinforcement learning example, but that scientific practice does not align with the view that computational models are merely mechanistic sketches (Sect. 6).

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

Fig. 1
Fig. 2
Fig. 3

This figure is inspired by a poster figure designed by Hanan Shteingart

Fig. 4

Reprinted by permission from Springer Nature Costumer Service Centre GmbH: Doya (2008, Fig 2). Legend is taken from the original paper

Fig. 5

Adapted from Botvinick et al. (2009, Fig 2). Reprinted with permission from Elsevier

Fig. 6
Fig. 7

Similar content being viewed by others

Notes

  1. Throughout this paper, when discussing mechanistic explanations, we refer only to constitutive explanations, of part-whole relations, and not to explanations that appeal to causal relations in general.

  2. Computational, medium-independent, entities can include phenomena, capacities, states, properties, functions, operations, variables and so on. Medium-dependent entities can include the same types (though our account is also consistent with the view that the abstract/medium-dependent characterization does not pertain to the phenomena themselves but rather to their descriptions). We will usually refer to only one of these entities, but the account applies to the others as well. The term component will be used in the context of part/whole relation: A component is an essential part (but not necessarily a spatial one) of a phenomenon.

  3. There are, however, different ways to account for the nature of these “medium-independent” properties. Fodor (1975) and Stich (1983) describe them as “syntactic” properties, and Fodor (1994) accounts for the latter in terms of high-level physical properties. Haugeland (1981) describes them as “formal” (see also Fodor 1980). Piccinini (2015) describes computational properties as “mathematical” or “formal”, and others have suggested that, regarding computations, the relevant physical properties of the implementing physical systems are only their degrees of freedom (Coelho Mollo 2018; Piccinini and Bahar 2013).

  4. While it seems straightforward to associate the computational explanations discussed here with Marr’s computational level (1982), algorithmic descriptions of a system can also be abstract and computational in the meaning we discuss here, as long as they are “medium-independent”. These algorithmic descriptions are more similar to mechanistic explanations in that they usually decompose the explanandum into its parts, while computational level explanations describe ‘what’ function the system performs and ‘why’ (Shagrir and Bechtel 2017).

  5. One can also ask how the implementational hierarchy is decomposed. Depending on one’s view of a level of explanation, the implementational hierarchy will include different details. It can include merely a reference to the physical structures that underlie the computational function. Alternatively, this hierarchy can also describe functions executed by these structures, albeit, medium-dependent functions. To illustrate, diodes, which are used on occasion to build logic gates in computers, have the function of passing electric current in exactly one direction. Description of such functions can be a part of the implementational hierarchy, because such functions are not abstract, but instead describe medium-dependent processes. In both cases, the decomposition of the implementational hierarchy will depend on some function. In the first case it is the computational function, and in the second it is the medium-dependent function (which may or may not coincide with the computational function).

  6. As one of the reviewers has kindly pointed out, the levels in this hierarchical model of reinforcement learning are chosen somewhat arbitrarily. For example, the computation describing the RPE may also be included directly in the module for the calculation of the action-values. However, we believe that this does not undermine the possibility that this model is hierarchical, because this issue exists in many mechanistic hierarchies. It is frequently possible to consider including a decomposition of some component directly at the higher level (e.g., the description of neurotransmitter release can be included in the explanation of the vestibulo-ocular reflex directly instead of figuring in a lower level).

  7. Although, if the reader disagrees about the specific hierarchy, the decomposition of reinforcement learning into modules that perform sub-computations should be enough to show that there is a computational model here, and we can ask how it is integrated with implementational details.

  8. Some may argue that relations between computational components can already be considered causal relations. We discuss the possible outcomes of this position in Sect. 5.

  9. If this is the case, some issues regarding this view should be resolved. Most importantly, how functions can remain medium-independent when it is necessary to state the brain structure in which they occur (Haimovici 2013).

  10. The first view, according to which the computational properties are eliminated when the implementational details are in place, might be more fitting with the standard ("flat”) view of realization. The second view might be more fitting with the dimensioned view of realization (Gillett 2002).

References

Download references

Acknowledgements

We thank Matteo Colombo, Nir Fresco, Arnon Levy, Corey J. Maley, Marcin Miłkowski, Gualtiero Piccinini, Mark Sprevak, the referees from Synthese journal, and the project members of the GIF project “Causation and computation in cognitive neuroscience” (Ori Hacohen, Jens Harbecke, Shahar Hechtlinger, Vera Hoffmann-Kolss, Jan Philipp Köster, and Carlos Zednik) as well as the participants in the IACAP2017 conference, EPSA17 symposium on ‘The Computational Mind’, and the participants of The Third Jerusalem-MCMP Workshop in the Philosophy of Science for helpful comments, which greatly helped to improve this manuscript. This paper was presented also in the colloquia seminars in Tel Chai college and Ben Gurion University. We also thank Zehava Cohen for creating the original figures in this paper. This research was supported by a grant from the GIF, the German- Israeli Foundation for Scientific Research and Development. Lotem Elber-Dorozko is grateful to the Azrieli Foundation for the award of an Azrieli Fellowship.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lotem Elber-Dorozko.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Elber-Dorozko, L., Shagrir, O. Integrating computation into the mechanistic hierarchy in the cognitive and neural sciences. Synthese 199 (Suppl 1), 43–66 (2021). https://doi.org/10.1007/s11229-019-02230-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11229-019-02230-9

Keywords

Navigation