In this paper, I argue that computationalism is a progressive research tradition. Its metaphysical assumptions are that nervous systems are computational, and that information processing is necessary for cognition to occur. First, the primary reasons why information processing should explain cognition are reviewed. Then I argue that early formulations of these reasons are outdated. However, by relying on the mechanistic account of physical computation, they can be recast in a compelling way. Next, I contrast two computational models of working memory (...) to show how modeling has progressed over the years. The methodological assumptions of new modeling work are best understood in the mechanistic framework, which is evidenced by the way in which models are empirically validated. Moreover, the methodological and theoretical progress in computational neuroscience vindicates the new mechanistic approach to explanation, which, at the same time, justifies the best practices of computational modeling. Overall, computational modeling is deservedly successful in cognitive science. Its successes are related to deep conceptual connections between cognition and computation. Computationalism is not only here to stay, it becomes stronger every year. (shrink)

In this paper, I review the objections against the claim that brains are computers, or, to be precise, information-processing mechanisms. By showing that practically all the popular objections are either based on uncharitable interpretation of the claim, or simply wrong, I argue that the claim is likely to be true, relevant to contemporary cognitive (neuro)science, and non-trivial.

Multiple realizability (MR) is traditionally conceived of as the feature of computational systems, and has been used to argue for irreducibility of higher-level theories. I will show that there are several ways a computational system may be seen to display MR. These ways correspond to (at least) five ways one can conceive of the function of the physical computational system. However, they do not match common intuitions about MR. I show that MR is deeply interest-related, and for this reason, difficult (...) to pin down exactly. I claim that MR is of little importance for defending computationalism, and argue that it should rather appeal to organizational invariance or substrate neutrality of computation, which are much more intuitive but cannot support strong antireductionist arguments. (shrink)

In most accounts of realization of computational processes by physical mechanisms, it is presupposed that there is one-to-one correspondence between the causally active states of the physical process and the states of the computation. Yet such proposals either stipulate that only one model of computation is implemented, or they do not reflect upon the variety of models that could be implemented physically. In this paper, I claim that mechanistic accounts of computation should allow for a broad variation of models of (...) computation. In particular, some non-standard models should not be excluded a priori. The relationship between mathematical models of computation and mechanistically adequate models is studied in more detail. (shrink)

The claim defended in the paper is that the mechanistic account of explanation can easily embrace idealization in big-scale brain simulations, and that only causally relevant detail should be present in explanatory models. The claim is illustrated with two methodologically different models: Blue Brain, used for particular simulations of the cortical column in hybrid models, and Eliasmith’s SPAUN model that is both biologically realistic and able to explain eight different tasks. By drawing on the mechanistic theory of computational explanation, I (...) argue that large-scale simulations require that the explanandum phenomenon is identified; otherwise, the explanatory value of such explanations is difficult to establish, and testing the model empirically by comparing its behavior with the explanandum remains practically impossible. The completeness of the explanation, and hence of the explanatory value of the explanatory model, is to be assessed vis-à-vis the explanandum phenomenon, which is not to be conflated with raw observational data and may be idealized. I argue that idealizations, which include building models of a single phenomenon displayed by multi-functional mechanisms, lumping together multiple factors in a single causal variable, simplifying the causal structure of the mechanisms, and multi-model integration, are indispensable for complex systems such as brains; otherwise, the model may be as complex as the explanandum phenomenon, which would make it prone to so-called Bonini paradox. I conclude by enumerating dimensions of empirical validation of explanatory models according to new mechanism, which are given in a form of a “checklist” for a modeler. (shrink)

There have been recent disagreements in the philosophy of neuroscience regarding which sorts of scientific models provide mechanistic explanations, and which do not. These disagreements often hinge on two commonly adopted, but conflicting, ways of understanding mechanistic explanations: what I call the “representation-as” account, and the “representation-of” account. In this paper, I argue that neither account does justice to neuroscientific practice. In their place, I offer a new alternative that can defuse some of these disagreements. I argue that individual models (...) do not provide mechanistic explanations by themselves. Instead, individual models are always used to complement a huge body of background information and pre-existing models about the target system. With this in mind, I argue that mechanistic explanations are distributed across sets of different, and sometimes contradictory, scientific models. Each of these models contributes limited, but essential, information to the same mechanistic explanation, but none can be considered a mechanistic explanation in isolation of the others. (shrink)

An increasing number of philosophers have promoted the idea that mechanism provides a fruitful framework for thinking about the explanatory contributions of computational approaches in cognitive neuroscience. For instance, Piccinini and Bahar :453–488, 2013) have recently argued that neural computation constitutes a sui generis category of physical computation which can play a genuine explanatory role in the context of investigating neural and cognitive processes. The core of their proposal is to conceive of computational explanations in cognitive neuroscience as a subspecies (...) of mechanistic explanations. This paper identifies several challenges facing their mechanistic account and sketches an alternative way of thinking about the epistemic roles of computational approaches used in the study of brain and cognition. Drawing on examples from both low-level and systems-level computational neuroscience, I argue that at least some computational explanations of neural and cognitive processes are partially independent from mechanistic constraints. (shrink)

Varela, Thompson, and Rosch illustrated their original presentation of the enactive theory of cognition with the example of a simple cellular automaton. Their theory was paradigmatically anti-computational, and yet automata similar to the one that they describe have typically been used to illustrate theories of computation, and are usually treated as abstract computational systems. Their use of this example is therefore puzzling, especially as they do not seem to acknowledge the discrepancy. The solution to this tension lies in recognizing a (...) hidden background assumption, shared by both Varela, Thompson, and Rosch and the computational theories of mind which they were responding to. This assumption is that computation requires representation, and that computational states must bear representational content. For Varela, Thompson, and Rosch, representational content is incompatible with cognition, and so from their perspective the automaton that they describe cannot, despite appearances, be computational. However, there now exist several accounts of computation that do not make this assumption, and do not characterize computation in terms of representational content. In light of these recent developments, we will argue that it is quite straightforward to characterize the enactive automaton as a non-representational computing mechanism, one that we do not think they should have any objections to. (shrink)