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)

Model organism databases are used extensively for knowledge retrieval and knowledge sharing among biologists. With the invention of genome sequencing and protein profiling technologies, large amount of molecular data provides practical insights into the molecular study of model organisms. The knowledge-intensive characteristic of model organism databases provides a reference point for the comparative study of other species. In this paper, I argue that algorithms could be used to facilitate cross-species research. I emphasize the epistemic significance of algorithms in the integration (...) of data for cross-species research. I examine (1) how algorithms guide data integration in model organism databases; and (2) the importance of algorithms for the use of model organism database in the cross-species research. I argue that an extrapolation from the stored data to other species is possible in virtue of the fact that algorithms can facilitate two modes of data integration—viz., inter-level and cross-species integration. Lastly, I examine the implication of the data integration role of an algorithm in light of mechanistic explanation. (shrink)

Gualtiero Piccinini articulates and defends a mechanistic account of concrete, or physical, computation. A physical system is a computing system just in case it is a mechanism one of whose functions is to manipulate vehicles based solely on differences between different portions of the vehicles according to a rule defined over the vehicles. Physical Computation discusses previous accounts of computation and argues that the mechanistic account is better. Many kinds of computation are explicated, such as digital vs. analog, (...) serial vs. parallel, neural network computation, program-controlled computation, and more. Piccinini argues that computation does not entail representation or information processing although information processing entails computation. Pancomputationalism, according to which every physical system is computational, is rejected. A modest version of the physical Church-Turing thesis, according to which any function that is physically computable is computable by Turing machines, is defended. (shrink)

The mechanistic account of computation offers one promising and influential theory of computational implementation. The aim of this paper is to shore up its conceptual foundations by responding to several recent challenges. After outlining and responding to a recent proposal from Kuokkanen (2022a), I suggest that computational description should be conceptualised as a form of idealisation (selectively attending to modified subsets of model features) rather than abstraction (selectively attending to subsets of features within a target system). I argue that this (...) conceptualisation not only offers the best way of making sense of computational implementation, but also a way of resolving each of the outstanding challenges facing the mechanistic account. The idealisation view allows the mechanistic account to make sense of the omission process found in computational descriptions without leaving the relationship between physical and computational properties mysterious. (shrink)

We propose a framework for including information‐processing bounds in rational analyses. It is an application of bounded optimality (Russell & Subramanian, 1995) to the challenges of developing theories of mechanism and behavior. The framework is based on the idea that behaviors are generated by cognitive mechanisms that are adapted to the structure of not only the environment but also the mind and brain itself. We call the framework computational rationality to emphasize the incorporation of computational mechanism into the (...) definition of rational action. Theories are specified as optimal program problems, defined by an adaptation environment, a bounded machine, and a utility function. Such theories yield different classes of explanation, depending on the extent to which they emphasize adaptation to bounds, and adaptation to some ecology that differs from the immediate local environment. We illustrate this variation with examples from three domains: visual attention in a linguistic task, manual response ordering, and reasoning. We explore the relation of this framework to existing “levels” approaches to explanation, and to other optimality‐based modeling approaches. (shrink)

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 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, we further demonstrate it through a concrete example, of reinforcement learning, in the cognitive and neural sciences. We then examine two possible solutions. 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. (shrink)

Upshot: The computational theory of mind has been elaborated in many different ways throughout the last decades. In Explaining the Computational Mind, Milkowski defends his view that the mind can be explained as computational through his defense of mechanistic explanation. At no point in this book is there explicit mention of constructivist approaches to this topic. We will, nevertheless, argue that it is interesting for constructivist readers.

Explanations in cognitive science and computational neuroscience rely predominantly on computational modeling. Although the scientific practice is systematic, and there is little doubt about the empirical value of numerous models, the methodological account of computational explanation is not up-to-date. The current chapter offers a systematic account of computational explanation in cognitive science and computational neuroscience within a mechanistic framework. The account is illustrated with a short case study of modeling of the mirror neuron system in terms of predictive coding.

Although it has been argued that mechanistic explanation is compatible with abstraction, there are still doubts about whether mechanism can account for the explanatory power of significant abstract models in computational neuroscience. Chirimuuta has recently claimed that models describing canonical neural computations must be evaluated using a non-mechanistic framework. I defend two claims regarding these models. First, I argue that their prevailing neurocognitive interpretation is mechanistic. Additionally, a criterion recently proposed by Levy and Bechtel to legitimize mechanistic abstract models, (...) and also a criterion proposed by Chirimuuta herself aimed to distinguish between causal and non-causal explanation, can be employed to show why these models are explanatory only under this interpretation. Second, I argue that mechanism is able to account for the special epistemic achievement implied by CNC models. Canonical neural components contribute to an integrated understanding of different cognitive functions. They make it possible for us to explain these functions by describing different mechanisms constituted by common basic components arranged in different ways. (shrink)

The mechanistic approach in philosophy of science contributes to our understanding of experimental design. Applying the mechanistic approach to experimentation in computing is beneficial for two reasons. It connects the methodology of experimentation in computing with the methodology of experimentation in established sciences, thereby strengthening the scientific reputability of computing and the quality of experimental design therein. Furthermore, it pinpoints the idiosyncrasies of experimentation in computing: computing deals closely with both natural and engineered mechanisms. Better (...) understanding of the idiosyncrasies, which manifest in terms of a nonstandard role for experimentation, are interesting both for computer scientists and for philosophers of science. Computer scientists can think more clearly about their experimental choices. The role of experimentation elucidated by computer science merits further study from philosophers of science generally, as it highlights a role for experimentation hitherto unrecognized by philosophers: demonstration that activities exist. (shrink)

This Ph.D. thesis explores a novel way of thinking about computation in cognitive science. It argues for what I call ‘the mechanistic account of wide computationalism’, or simply wide mechanistic computation. The key claim is that some cognitive and perceptual abilities are produced by or are the result of computational mechanisms that are, in part, located outside the individual; that computational systems, the ones that form the proper units of analysis in cognitive science, are particular types of functional mechanisms that, (...) on occasion, spread out across brain, body, and world. Wide mechanistic computation is the result of bringing together two distinct strands of thinking about computation: ‘wide’ views, which hold that computational systems can, on occasion, include parts of the surrounding environment; and ‘mechanistic’ views, which hold that computational explanation is a species of mechanistic explanation, and that computational mechanisms are a special type of functional mechanism. I argue that wide mechanistic computation draws support from several sources. First, I examine research on animal and human psychology and show that several organisms’ behaviours are properly treated as being the output of wide computational mechanisms. Second, I defend the view from several philosophical charges, including worries about its explanatory parsimony and empirical testability. Finally, I argue for the view’s theoretical credentials by showing that it can help resolve specific problems that have recently troubled 4E cognition. The result is an argument for not only the coherence but also empirical plausibility of wide mechanistic computation. On route to its main objective, the thesis also accomplishes a number of related tasks, including: providing a framework for organising and conceptualising different views of computation, securing the conceptual foundations of mechanistic computation by addressing an outstanding challenge called the ‘abstraction problem’, sounding a cautionary note about recent predictive processing accounts of extended cognition and arguing against a particular conception of levels often used within cognitive science, what is labelled the ‘hierarchical correspondence view of levels’. (shrink)

Is the mathematical function being computed by a given physical system determined by the system’s dynamics? This question is at the heart of the indeterminacy of computation phenomenon (Fresco et al. [unpublished]). A paradigmatic example is a conventional electrical AND-gate that is often said to compute conjunction, but it can just as well be used to compute disjunction. Despite the pervasiveness of this phenomenon in physical computational systems, it has been discussed in the philosophical literature only indirectly, mostly with reference (...) to the debate over realism about physical computation and computationalism. A welcome exception is Dewhurst’s ([2018]) recent analysis of computational individuation under the mechanistic framework. He rejects the idea of appealing to semantic properties for determining the computational identity of a physical system. But Dewhurst seems to be too quick to pay the price of giving up the notion of computational equivalence. We aim to show that the mechanist need not pay this price. The mechanistic framework can, in principle, preserve the idea of computational equivalence even between two different enough kinds of physical systems, say, electrical and hydraulic ones. (shrink)

Is the mathematical function being computed by a given physical system determined by the system’s dynamics? This question is at the heart of the indeterminacy of computation phenomenon (Fresco et al. [unpublished]). A paradigmatic example is a conventional electrical AND-gate that is often said to compute conjunction, but it can just as well be used to compute disjunction. Despite the pervasiveness of this phenomenon in physical computational systems, it has been discussed in the philosophical literature only indirectly, mostly with reference (...) to the debate over realism about physical computation and computationalism. A welcome exception is Dewhurst’s ([2018]) recent analysis of computational individuation under the mechanistic framework. He rejects the idea of appealing to semantic properties for determining the computational identity of a physical system. But Dewhurst seems to be too quick to pay the price of giving up the notion of computational equivalence. We aim to show that the mechanist need not pay this price. The mechanistic framework can, in principle, preserve the idea of computational equivalence even between two different enough kinds of physical systems, say, electrical and hydraulic ones. (shrink)

The article presents preliminary results of the conceptual analysis of the mechanistic profile of the computer metaphor. Mechanic reductionism is a special direction of computer metaphor rooted in various historical forms of word usage. Here we trace the stages of formation of the principles of transferring the properties of a mechanical computer to the properties of the human body and mind. We are also trying to identify the basic principles of semantic transfer, which have survived to this day in the (...) discourse of modern computationalism. The reasons are analyzed due to which the metaphor «Human (body) is machine», traditional for the Modern Age, was transformed into a more complex version of «Mind is machine». What happened to the concepts of «mind» and «machine»? How have ideas about the properties of computational procedures changed? What keeps the counterintuitive computer metaphor viable today? The answers to this series of questions and theoretical ways of solving these problems are contained in this paper. (shrink)

Two widely accepted assumptions within cognitive science are that (1) the goal is to understand the mechanisms responsible for cognitive performances and (2) computational modeling is a major tool for understanding these mechanisms. The particular approaches to computational modeling adopted in cognitive science, moreover, have significantly affected the way in which cognitive mechanisms are understood. Unable to employ some of the more common methods for conducting research on mechanisms, cognitive scientists’ guiding ideas about mechanism have developed in conjunction with (...) their styles of modeling. In particular, mental operations often are conceptualized as comparable to the processes employed in classical symbolic AI or neural network models. These models, in turn, have been interpreted by some as themselves intelligent systems since they employ the same type of operations as does the mind. For this paper, what is significant about these approaches to modeling is that they are constructed specifically to account for behavior and are evaluated by how well they do so—not by independent evidence that they describe actual operations in mental mechanisms. (shrink)

Physical Computation is the summation of Piccinini’s work on computation and mechanistic explanation over the past decade. It draws together material from papers published during that time, but also provides additional clarifications and restructuring that make this the definitive presentation of his mechanistic account of physical computation. This review will first give a brief summary of the account that Piccinini defends, followed by a chapter-by-chapter overview of the book, before finally discussing one aspect of the account in more critical detail.

I examine a major objection to the mechanistic view of concrete computation, stemming from an apparent tension between the abstract nature of computational explanation and the tenets of the mechanistic framework: while computational explanation is medium-independent, the mechanistic framework insists on the importance of providing some degree of structural detail about the systems target of the explanation. I show that a common reply to the objection, i.e. that mechanistic explanation of computational systems involves only weak structural constraints, is not enough (...) to save the standard mechanistic view of computation—it trivialises the appeal to mechanism, and thus makes the account collapse into a purely functional view. I claim, however, that the objection can be put to rest once the account is appropriately amended: computational individuation is indeed functional, while mechanistic explanation plays a role in accounting for computational implementation. Since individuation and implementation are crucial elements in a satisfying account of computation in physical systems, mechanism keeps its central importance in the theory of concrete computation. Finally, I argue that my version of the mechanistic view helps to provide a convincing reply to a powerful objection against non-semantic theories of concrete computation: the argument from the multiplicity of computations. (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)

In this article, after presenting the basic idea of causal accounts of implementation and the problems they are supposed to solve, I sketch the model of computation preferred by Chalmers and argue that it is too limited to do full justice to computational theories in cognitive science. I also argue that it does not suffice to replace Chalmers’ favorite model with a better abstract model of computation; it is necessary to acknowledge the causal structure of physical computers that is not (...) accommodated by the models used in computability theory. Additionally, an alternative mechanistic proposal is outlined. (shrink)

Fresco and Primiero’s recent article, ‘Miscomputation’ , provides a useful framework with which to think about miscomputation, as well as an admirably broad taxonomy of different kinds of miscomputation. However, it also misconstrues the mechanistic approach to miscomputation, which I will argue should not recognise design errors as miscomputations per se. I argue that a computing mechanism, if it is functioning correctly in the physical sense, cannot miscompute on the basis of an error made by an external agent, (...) such as a programmer. This is partially acknowledged in the distinction that Fresco and Primiero make between errors of functioning and errors of design, but they go on to describe both as cases of miscomputation, which I will argue is a mistake, at least with regard to the analysis made by the mechanistic account. (shrink)

This paper discusses the relevance of models for cognitive science that integrate mechanistic and computational aspects. Its main hypothesis is that a model of a cognitive system is satisfactory and explanatory to the extent that it bridges phenomena at multiple mechanistic levels, such that at least several of these mechanistic levels are shown to implement computational processes. The relevant parts of the computation must be mapped onto distinguishable entities and activities of the mechanism. The ideal is contrasted with two (...) other accounts of modeling in cognitive science. The first has been presented by David Marr in combination with a distinction of “levels of computation”. The second builds on a hierarchy of “mechanistic levels” in the sense of Carl Craver. It is argued that neither of the two accounts secures satisfactory explanations of cognitive systems. The mechanistic-computational ideal can be thought of as resulting from a fusion of Marr’s and Craver’s ideals. It is defended as adequate and plausible in light of scientific practice, and certain metaphysical background assumptions are discussed. (shrink)

Context: The advent of a general artificial intelligence mechanism that learns like humans do would represent the realization of an old and major dream of science. It could be achieved by an artifact able to develop its own cognitive structures following constructivist principles. However, there is a large distance between the descriptions of the intelligence made by constructivist theories and the mechanisms that currently exist. Problem: The constructivist conception of intelligence is very powerful for explaining how cognitive development takes (...) place. However, until now, no computational model has successfully demonstrated the underlying mechanisms necessary to realize it. In other words, the artificial intelligence (AI) community has not been able to give rise to a system that convincingly implements the principles of intelligence as postulated by constructivism, and that is also capable of dealing with complex environments. Results: This paper presents the constructivist anticipatory learning mechanism (CALM), an agent learning mechanism based on the constructivist approach of AI. It is designed to deal dynamically and interactively with environments that are at the same time partially deterministic and partially observable. CALM can model the regularities experienced in the interaction with the environment, on the sensorimotor level as well, as by constructing abstract or high-level representational concepts. The created model provides the knowledge necessary to generate the agent behavior. The paper also presents the coupled agent environment system (CAES) meta-architecture, which defines a conception of an autonomous agent, situated in the environment, embodied and intrinsically motivated. Implications: The paper can be seen as a step towards a computational implementation of constructivist principles, on the one hand suggesting a further perspective of this refreshing movement on the AI field (which is still too steeped in a behaviorist influence and dominated by probabilistic models and narrow applied approaches), and on the other hand bringing some abstract descriptions of the cognitive process into a more concrete dimension, in the form of algorithms. Constructivist content: The connection of this paper with constructivism is the proposal of a computational and formally described mechanism that implements important aspects of the subjective process of knowledge construction based on key ideas proposed by constructivist theories. (shrink)

According to the computational theory of mind (CTM), mental capacities are explained by inner computations, which in biological organisms are realized in the brain. Computational explanation is so popular and entrenched that it’s common for scientists and philosophers to assume CTM without argument.

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)

This paper presents a human-computer interaction model with a three layers learning mechanism in a pervasive environment. We begin with a discussion around a number of important issues related to human-computer interaction followed by a description of the architecture for a multi-agent cooperative design system for pervasive computing environment. We present our proposed three- layer HCI model and introduce the group formation algorithm, which is predicated on a dynamic sharing niche technology. Finally, we explore the cooperative reinforcement learning (...) and fusion algorithms; the paper closes with concluding observations and a summary of the principal work and contributions of this paper. (shrink)

The evolutionary circuit design is an approach allowing engineers to realize computational devices. The evolved computational devices represent a distinctive class of devices that exhibits a specific combination of properties, not visible and studied in the scope of all computational devices up till now. Devices that belong to this class show the required behavior; however, in general, we do not understand how and why they perform the required computation. The reason is that the evolution can utilize, in addition to the (...) “understandable composition of elementary components”, material-dependent constructions and properties of environment (such as temperature, electromagnetic field etc.) and, furthermore, unknown physical behaviors to establish the required functionality. Therefore, nothing is known about the mapping between an abstract computational model and its physical implementation. The standard notion of computation and implementation developed in computer science as well as in cognitive science has become very problematic with the existence of evolved computational devices. According to the common understanding, the evolved devices cannot be classified as computing mechanisms. (shrink)

A recent issue of Time magazine (March 29, 1999) was devoted to the twenty greatest "thinkers" of the twentieth century -- scientists, inventors, and engineers. There is one interesting omission: there are no cognitive psychologists or cognitive scientists. (Cognitive science is an amalgam of cognitive, neuro, and developmental psychology, artificial intelligence, philosophy, linguistics, biology, and anthropology.) Freud is there, to be sure. But, while he was very influential, it is not even clear that he was a scientist, let alone a (...) cognitive scientist. There are those who regard Freud as somewhere between incompetent and a charlatan (see Glymour, 1988). In any case, though Freud's positive proposal for the mind's architecture -- namely, that it contains the unconscious -- seems correct as far as it goes, it does appear that all the details are wrong. For example: (1) there is a lot more to the mind than the mere unconscious; (2) it is doubtful that there is an id, ego, and superego; (3) most dreams may very likely be meaningless; and (4) human motivation, even unconscious motivation, is about a lot more than sex. In the end, because he was most interested in certain kinds of human mental malfunctioning, Freud is probably best thought of as a physician, a proponent and early explorer of human mental health; he was not an experimental cognitive psychologist. (shrink)

The breadth-first search adopted by Bayesian researchers to map out the conceptual space and identify what the framework can do is beneficial for science and reflective of its collaborative and incremental nature. Theoretical pluralism among researchers facilitates refinement of models within various levels of analysis, which ultimately enables effective cross-talk between different levels of analysis.

The dialogue develops arguments for and against a broad new world system - info-computationalist naturalism - that is supposed to overcome the traditional mechanistic view. It would make the older mechanistic view into a special case of the new general info-computationalist framework (rather like Euclidian geometry remains valid inside a broader notion of geometry). We primarily discuss what the info-computational paradigm would mean, especially its pancomputationalist component. This includes the requirements for a the new generalized notion of computing that (...) would include sub-symbolic information processing. We investigate whether pancomputationalism can provide the basic causal structure to the world and whether the overall research program of info-computationalist naturalism appears productive, especially when it comes to new approaches to the living world, including computationalism in the philosophy of mind. (shrink)

An argument recently proposed by Chirimuuta seems to motivate the rejection of the claims that every neurocognitive phenomenon can have a mechanistic explanation and that every neurocognitive explanation is mechanistic. In this paper, I focus on efficient coding models involving the so-called “canonical neural computations” and argue that although they imply some form of pluralism, they are compatible with two mechanistic generalizations: all neurocognitive explanations are mechanistic; and all neurocognitive phenomena that have an explanation have a purely mechanistic explanation.

This chapter draws an analogy between computing mechanisms and autopoietic systems, focusing on the non-representational status of both kinds of system (computational and autopoietic). It will be argued that the role played by input and output components in a computing mechanism closely resembles the relationship between an autopoietic system and its environment, and in this sense differs from the classical understanding of inputs and outputs. The analogy helps to make sense of why we should think of (...) class='Hi'>computing mechanisms as non-representational, and might also facilitate reconciliation between computational and autopoietic/enactive approaches to the study of cognition. (shrink)

Computational perspectivalism has been recently proposed as an alternative to mainstream accounts of physical computation, and especially to the teleologically-based mechanistic view. It takes physical computation to be partly dependent on explanatory perspectives and eschews appeal to teleology in helping individuate computational systems. I assess several varieties of computational perspectivalism, showing that they either collapse into existing non-perspectival views or end up with unsatisfactory or implausible accounts of physical computation. Computational perspectivalism fails, therefore, to be a compelling alternative to perspective-independent (...) theories of computation in physical systems. I conclude that a teleologically-based, non-perspectival mechanistic account of physical computation is to be preferred. 1Introduction 2The Mechanistic View of Computation 2.1Teleological functions and meeting the desiderata 3Varieties of Perspectivalism 4Computational Perspectivalism 4.1Computational perspectivalism and pancomputationalism 4.2Computational perspectivalism and miscomputation 5The Varieties of Computational Perspectivalism Assessed 5.1Innocuous computational perspectivalism 5.2Non-innocuous computational perspectivalism 5.2.1Computational instrumentalism 5.2.2Ontic perspectivalism 6Concluding Remarks. (shrink)

This volume offers a broad, philosophical discussion on mechanical explanations. Coverage ranges from historical approaches and general questions to physics and higher-level sciences . The contributors also consider the topics of complexity, emergence, and reduction. Mechanistic explanations detail how certain properties of a whole stem from the causal activities of its parts. This kind of explanation is in particular employed in explanatory models of the behavior of complex systems. Often used in biology and neuroscience, mechanistic explanation models have been often (...) overlooked in the philosophy of physics. The authors correct this surprising neglect. They trace these models back to their origins in physics. The papers present a comprehensive historical, methodological, and problem-oriented investigation. The contributors also investigate the conditions for using models of mechanistic explanations in physics. The last papers make the bridge from physics to economics, the theory of complex systems and computer science . This book will appeal to graduate students and researchers with an interest in the philosophy of science, scientific explanation, complex systems, models of explanation in physics higher level sciences, and causal mechanisms in science. (shrink)

Computationalism says that brains are computing mechanisms, that is, mechanisms that perform computations. At present, there is no consensus on how to formulate computationalism precisely or adjudicate the dispute between computationalism and its foes, or between different versions of computationalism. An important reason for the current impasse is the lack of a satisfactory philosophical account of computing mechanisms. The main goal of this dissertation is to offer such an account.
I also believe that the history of computationalism sheds light (...) on the current debate. By tracing different versions of computationalism to their common historical origin, we can see how the current divisions originated and understand their motivation. Reconstructing debates over computationalism in the context of their own intellectual history can contribute to philosophical progress on the relation between brains and computing mechanisms and help determine how brains and computing mechanisms are alike, and how they differ. Accordingly, my dissertation is divided into a historical part, which traces the early history of computationalism up to 1946, and a philosophical part, which offers an account of computing mechanisms.
The two main ideas developed in this dissertation are that (1) computational states are to be identified functionally not semantically, and (2) computing mechanisms are to be studied by functional analysis. The resulting account of computing mechanism, which I call the functional account of computing mechanisms, can be used to identify computing mechanisms and the functions they compute. I use the functional account of computing mechanisms to taxonomize computing mechanisms based on their different computing power, and I use this taxonomy of computing mechanisms to taxonomize different versions of computationalism based on the functional properties that they ascribe to brains. By doing so, I begin to tease out empirically testable statements about the functional organization of the brain that different versions of computationalism are committed to. I submit that when computationalism is reformulated in the more explicit and precise way I propose, the disputes about computationalism can be adjudicated on the grounds of empirical evidence from neuroscience. (shrink)

The central aim of this paper is to shed light on the nature of explanation in computational neuroscience. I argue that computational models in this domain possess explanatory force to the extent that they describe the mechanisms responsible for producing a given phenomenon—paralleling how other mechanistic models explain. Conceiving computational explanation as a species of mechanistic explanation affords an important distinction between computational models that play genuine explanatory roles and those that merely provide accurate descriptions or predictions of phenomena. It (...) also serves to clarify the pattern of model refinement and elaboration undertaken by computational neuroscientists. (shrink)

The aim of this paper is to begin developing a version of Gualtiero Piccinini’s mechanistic account of computation that does not need to appeal to any notion of proper (or teleological) functions. The motivation for doing so is a general concern about the role played by proper functions in Piccinini’s account, which will be evaluated in the first part of the paper. I will then propose a potential alternative approach, where computing mechanisms are understood in terms of Carl Craver’s (...) perspectival account of mechanistic functions. According to this approach, the mechanistic function of ‘performing a computation’ can only be attributed relative to an explanatory perspective, but such attributions are nonetheless constrained by the underlying physical structure of the system in question, thus avoiding unlimited pancomputationalism. If successful, this approach would carry with it fewer controversial assumptions than Piccinini’s original account, which requires a robust understanding of proper functions. Insofar as there are outstanding concerns about the status of proper functions, this approach would therefore be more generally acceptable. (shrink)

Descriptive abstraction means omission of information from descriptions of phenomena. In this paper, I introduce a distinction between vertical and horizontal descriptive abstraction. Vertical abstracts away levels of mechanism or organization, while horizontal abstracts away details within one level of organization. The distinction is implicit in parts of the literature, but it has received insufficient attention and gone mainly unnoticed. I suggest that the distinction can be used to clarify how computational descriptions are formed in some variants of the (...) mechanistic account of physical computation. Furthermore, I suggest that, if this suggestion is adopted, it can be used to resolve what I call abstraction, hierarchy, and generality problems raised against mechanistic account of physical computation. According to the abstraction problem, the mechanistic account of physical computation is conceptually confused in claiming that physical systems process computational, abstract properties. An existing solution distinguishes between descriptive and metaphysical abstraction, suggesting that the abstraction problem unnecessarily postulates metaphysically abstract entities. The solution has been criticized for leading to what I call hierarchy and generality problems: it results in two separate hierarchies, one physical and one computational, making it problematic both to account for the generality of computational descriptions and to specify how the two hierarchies are related to each other. Adopting the vertical-horizontal distinction and the view that computational descriptions are achieved by horizontal abstraction allows one to account for the generality of computational descriptions, and to form a single hierarchy in which there are no separate hierarchies in need of integration. (shrink)

I analyze a tension at the core of the mechanistic view of computation generated by its joint commitment to the medium independence of computational vehicles and to computational systems possessing teleological functions to compute. While computation is individuated in medium-independent terms, teleology is sensitive to the constitutive physical properties of vehicles. This tension spells trouble for the mechanistic view, suggesting that there can be no teleological functions to compute. I argue that, once considerations about the relevant function-bestowing factors for computational (...) systems are brought to bear, the tension dissolves: physical systems can have the teleological function to compute. (shrink)

I offer an explication of the notion of computer, grounded in the practices of computability theorists and computer scientists. I begin by explaining what distinguishes computers from calculators. Then, I offer a systematic taxonomy of kinds of computer, including hard-wired versus programmable, general-purpose versus special-purpose, analog versus digital, and serial versus parallel, giving explicit criteria for each kind. My account is mechanistic: which class a system belongs in, and which functions are computable by which system, depends on the system's mechanistic (...) properties. Finally, I briefly illustrate how my account sheds light on some issues in the history and philosophy of computing as well as the philosophy of mind. (shrink)

Gödel’s first incompleteness theorem is sometimes said to refute mechanism about the mind. §1 contains a discussion of mechanism. We look into its origins, motivations and commitments, both in general and with regard to the human mind, and ask about the place of modern computers and modern cognitive science within the general mechanistic paradigm. In §2 we give a sharp formulation of a mechanistic thesis about the mind in terms of the mathematical notion of computability. We present the (...) argument from Gödel’s theorem against mechanism in terms of this formulation and raise two objections, one of which is known but is here given a more precise formulation, and the other is new and based on the discussion in §1. (shrink)

Current orthodoxy takes representation to be essential to computation. However, a philosophical account of computation that does not appeal to representation would be useful, given the difficulties involved in successfully theorizing representation. Piccinini's recent mechanistic account of computation proposes to do just that: it couches computation in terms of what certain mechanisms do without requiring the manipulation or processing of representations whatsoever (Piccinini 2015). Most crucially, mechanisms must process medium-independent vehicles. There are two ways to understand what "medium-independence" means on (...) this account; however, on either understanding, the account fails. Either too many things end up being counted as computational, or purportedly natural computations (e.g., neural computations) cannot be counted at all. In the end, illustrating this failure sheds some light on the way to revise the orthodoxy in the hope of a better account of computation. (shrink)

Computers are increasingly interactive. They are no more transformational systems producing a final output after a finite execution. Instead, they continuously react in time to external events that modify the course of computing execution. While philosophers have been interested in conceptualizing computers for a long time, they seem to have paid little attention to the specificities of interactive computing. We propose to tackle this issue by surveying the literature in theoretical computer science, where one can find explicit proposals (...) for a model of interactive computing. In that field, the formal modelling of interactive computing systems has been brought down to whether the new interaction models are reducible to Turing Machines. There are three areas where interaction models are framed. The comparison between TMs and interactive system models is at stake in all of them. These areas are namely some works on concurrency by Milner, on Reactive Turing Machines, and on interaction as a new computing paradigm. For each of the three identified models, we present its motivation, sum up its account for interaction and its legacy, and point out issues regarding the understanding of computers. The survey shows difficulties for epistemologists. The reason is that these analyses focus on the formal equivalence between interactive models of computation and classic ones. Such a project is different from addressing how a computing machine can be interactive: in other words, which mechanisms allow it. (shrink)

In this paper, we address the question of what current computers are from the point of view of human-computer interaction. In the early days of computing, the Turing machine (TM) has been the cornerstone of the understanding of computers. The TM defines what can be computed and how computation can be carried out. However, in the last decades, computers have evolved and increasingly become interactive systems, reacting in real-time to external events in an ongoing loop. We argue that the (...) TM does not provide a mechanistic explanation for interactive computing. The reason is that the fundamental phenomena relevant to interactive computing are out of the scope of classical computability theory. Part of the explanatory power of the TM relies on what we propose to call an execution model. An execution model belongs to a level of abstraction where it is possible to describe both the functional architecture and the execution in mechanistic terms. An updated execution model is warranted to provide the minimal mechanistic description for interactive computation as a counterpart of what the TM could explain regarding Church-Turing computation. It would support an explanation of the ubiquitous computing devices we know - those interacting with humans, e.g., through digital interfaces. We show that such a model is not available within interactive models of computation and that relevant abstractions and concerns are available in computer engineering but need to be identified and gathered. To fill this void, we propose to reflect on the level of abstraction required to support the mechanistic description of an interactive execution and propose some preliminary requirements. (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)