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)

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)

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)

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)

The assumption that psychological states and processes are computational in character pervades much of cognitive science, what many call the computational theory of mind. In addition to occupying a central place in cognitive science, the computational theory of mind has also had a second life supporting “individualism”, the view that psychological states should be taxonomized so as to supervene only on the intrinsic, physical properties of individuals. One response to individualism has been to raise the prospect of “wide computational (...) systems”, in which some computational units are instantiated outside the individual. “Wide computationalism” attempts to sever the link between individualism and computational psychology by enlarging the concept of computation. However, in spite of its potential interest to cognitive science, wide computationalism has received little attention in philosophy of mind and cognitive science. This paper aims to revisit the prospect of wide computationalism. It is argued that by appropriating a mechanistic conception of computation wide computationalism can overcome several issues that plague initial formulations. The aim is to show that cognitive science has overlooked an important and viable option in computational psychology. The paper marshals empirical support and responds to possible objections. (shrink)

The mechanistic view of computation contends that computational explanations are mechanistic explanations. Mechanists, however, disagree about the precise role that the environment – or the so-called “contextual level” – plays for computational explanations. We advance here two claims: Contextual factors essentially determine the computational identity of a computing system ; this means that specifying the “intrinsic” mechanism is not sufficient to fix the computational identity of the system. It is not necessary to specify the causal-mechanistic (...) interaction between the system and its context in order to offer a complete and adequate computational explanation. While the first claim has been discussed before, the second has been practically ignored. After supporting these claims, we discuss the implications of our contextualist view for the mechanistic view of computational explanation. Our aim is to show that some versions of the mechanistic view are consistent with the contextualist view, whilst others are not. (shrink)

The mechanistic view of computation contends that computational explanations are mechanistic explanations. Mechanists, however, disagree about the precise role that the environment – or the so-called “contextual level” – plays for computational explanations. We advance here two claims: Contextual factors essentially determine the computational identity of a computing system ; this means that specifying the “intrinsic” mechanism is not sufficient to fix the computational identity of the system. It is not necessary to specify the causal-mechanistic (...) interaction between the system and its context in order to offer a complete and adequate computational explanation. While the first claim has been discussed before, the second has been practically ignored. After supporting these claims, we discuss the implications of our contextualist view for the mechanistic view of computational explanation. Our aim is to show that some versions of the mechanistic view are consistent with the contextualist view, whilst others are not. (shrink)

The mechanistic view of computation contends that computational explanations are mechanistic explanations. Mechanists, however, disagree about the precise role that the environment – or the so-called “contextual level” – plays for computational explanations. We advance here two claims: Contextual factors essentially determine the computational identity of a computing system ; this means that specifying the “intrinsic” mechanism is not sufficient to fix the computational identity of the system. It is not necessary to specify the causal-mechanistic (...) interaction between the system and its context in order to offer a complete and adequate computational explanation. While the first claim has been discussed before, the second has been practically ignored. After supporting these claims, we discuss the implications of our contextualist view for the mechanistic view of computational explanation. Our aim is to show that some versions of the mechanistic view are consistent with the contextualist view, whilst others are not. (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 (...) class='Hi'>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)

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)

In this paper, the role of the environment and physical embodiment of computational systems for explanatory purposes will be analyzed. In particular, the focus will be on cognitive computational systems, understood in terms of mechanisms that manipulate semantic information. It will be argued that the role of the environment has long been appreciated, in particular in the work of Herbert A. Simon, which has inspired the mechanistic view on explanation. From Simon’s perspective, the embodied view on cognition (...) seems natural but it is nowhere near as critical as its proponents suggest. The only point of difference between Simon and embodied cognition is the significance of body-based off-line cognition; however, it will be argued that it is notoriously over-appreciated in the current debate. The new mechanistic view on explanation suggests that even if it is critical to situate a mechanism in its environment and study its physical composition, or realization, it is also stressed that not all detail counts, and that some bodily features of cognitive systems should be left out from explanations. (shrink)

A single physical process may often be described equally well as computing several different mathematical functions—none of which is explanatorily privileged. How, then, should the computational identity of a physical system be determined? Some computational mechanists hold that computation is individuated only by either narrow physical or functional properties. Even if some individuative role is attributed to environmental factors, it is rather limited. The computational semanticist holds that computation is individuated, at least in part, by semantic properties. She (...) claims that the mechanistic account lacks the resources to individuate the computations performed by some systems, thereby leaving interesting cases of computational indeterminacy unaddressed. This article examines some of these views, and claims that more cases of computational indeterminacy can be addressed, if the system-environment interaction plays a greater role in individuating computations. A new, long-arm functional strategy for individuating computation is advanced. (shrink)

To be successful, the research agenda for a novel control view of cognition should foresee more detailed, computationally specified process models of cognitive operations including higher cognition. These models should cover all domains of cognition, including those cognitive abilities that can be characterized as online interactive loops and detached forms of cognition that depend on internally generated neuronal processing.

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)

The received view is that computational states are individuated at least in part by their semantic properties. I offer an alternative, according to which computational states are individuated by their functional properties. Functional properties are specified by a mechanistic explanation without appealing to any semantic properties. The primary purpose of this paper is to formulate the alternative view of computational individuation, point out that it supports a robust notion of computational explanation, and defend it on the grounds (...) of how computational states are individuated within computability theory and computer science. A secondary purpose is to show that existing arguments for the semantic view are defective. (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)

What does it mean to say that an object or system computes? What is it about laptops, smartphones, and nervous systems that they are considered to compute, and why does it seldom occur to us to describe stomachs, hurricanes, rocks, or chairs that way? Though computing systems are everywhere today, it is very difficult to answer these questions. The book aims to shed light on the subject by arguing for the semantic view of computation, which states that computingsystems (...) are always accompanied by representations. This view is presented as an alternative to non-semantic views such as the mechanistic account of computation. (shrink)

Information is a basic structure of the world, while computation is a process of the dynamic change of information. This book provides a cutting-edge view of world's leading authorities in fields where information and computation play a central role. It sketches the contours of the future landscape for the development of our understanding of information and computation, their mutual relationship and the role in cognition, informatics, biology, artificial intelligence, and information technology. -/- This book is an (...) utterly enjoyable and engaging read which gives readers an opportunity to understand and relate phenomena seemingly unrelated in a completely new light — especially the connections between information, computation, cognition and life. -/- Contents: Cybersemiotics and the Question of Knowledge (Søren Brier) Information Dynamics in a Categorical Setting (Mark Burgin) Mathematics as a Biological Process (G J Chaitin) Information, Causation and Computation (John Collier) From Descartes to Turing: The Computational Content of Supervenience (S Barry Cooper) A Dialogue Concerning Two World Systems: Info-Computational vs Mechanistic (Gordana Dodig-Crnkovic & Vincent C Müller) Does Computing Embrace Self-Organization? (Wolfgang Hofkirchner) Analysis of Information and Computation in Physics Explains Cognitive Paradigms: From Full Cognition to Laplace Determinism to Statistical Determinism to Modern Approach (Vladik Kreinovich, Roberto Araiza & Juan Ferret) Bodies — Both Informed and Transformed Embodied Computation and Information Processing (Bruce J MacLennan) Computation on Information, Meaning and Representations: An Evolutionary Approach (Christophe Menant) Interior Grounding, Reflection, and Self-Consciousness (Marvin Minsky) A Molecular Dynamic Network: Minimal Properties and Evolutionary Implications (Walter Riofrio) Super-recursive Features of Evolutionary Processes and the Models for Computational Evolution (Darko Roglic) Towards a Modeling View of Computing (Oron Shagrir) What's Information, for an Organism or Intelligent Machine? How can a Machine or Organism Mean? (Aaron Sloman) Inconsistent Knowledge as a Natural Phenomenon: The Ranking of Reasonable Inferences as a Computational Approach to Naturally Inconsistent (Legal) Theories (Kees (CNJ) de Vey Mestdagh & Jaap Henk (JH) Hoepman) On the Algorithmic Nature of the World (Hector Zenil & Jean-Paul Delahaye) . (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)

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.

Computational explanations focus on information processing required in specific cognitive capacities, such as perception, reasoning or decision-making. These explanations specify the nature of the information processing task, what information needs to be represented, and why it should be operated on in a particular manner. In this article, the focus is on three questions concerning the nature of computational explanations: What type of explanations they are, in what sense computational explanations are explanatory and to what extent they involve a special, “independent” (...) or “autonomous” level of explanation. In this paper, we defend the view computational explanations are genuine explanations, which track non-causal/formal dependencies. Specifically, we argue that they do not provide mere sketches for explanation, in contrast to what for example Piccinini and Craver :283–311, 2011) suggest. This view of computational explanations implies some degree of “autonomy” for the computational level. However, as we will demonstrate that does not make this view “computationally chauvinistic” in a way that Piccinini or Kaplan :339–373, 2011) have charged it to be. (shrink)

Understanding humans requires viewing them as mechanisms of some sort, since understanding anything requires seeing it as a mechanism. It is science’s job to reveal mechanisms. But science reveals much more than that: it also reveals enduring mystery—strangeness in the proportion. Concentrating just on the scientific side of Selinger’s and Engström’s call for a moratorium on cyborg discourse, I argue that this strangeness prevents cyborg discourse from diminishing us.

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)

“Morphological computation” is an increasingly important concept in robotics, artificial intelligence, and philosophy of the mind. It is used to understand how the body contributes to cognition and control of behavior. Its understanding in terms of "offloading" computation from the brain to the body has been criticized as misleading, and it has been suggested that the use of the concept conflates three classes of distinct processes. In fact, these criticisms implicitly hang on accepting a semantic definition of what (...) constitutes computation. Here, I argue that an alternative, mechanistic view on computation offers a significantly different understanding of what morphological computation is. These theoretical considerations are then used to analyze the existing research program in developmental biology, which understands morphogenesis, the process of development of shape in biological systems, as a computational process. This important line of research shows that cognition and intelligence can be found across all scales of life, as the proponents of the basal cognition research program propose. Hence, clarifying the connection between morphological computation and morphogenesis allows for strengthening the role of the former concept in this emerging research field. (shrink)

The philosophical conception of mechanistic explanation is grounded on a limited number of canonical examples. These examples provide an overly narrow view of contemporary scientific practice, because they do not reflect the extent to which the heuristic strategies and descriptive practices that contribute to mechanistic explanation have evolved beyond the well-known methods of decomposition, localization, and pictorial representation. Recent examples from evolutionary robotics and network approaches to biology and neuroscience demonstrate the increasingly important role played by computer (...) simulations and mathematical representations in the epistemic practices of mechanism discovery and mechanism description. These examples also indicate that the scope of mechanistic explanation must be re-examined: With new and increasingly powerful methods of discovery and description comes the possibility of describing mechanisms far more complex than traditionally assumed. (shrink)

The Computational Theory of Mind (CTM) holds that cognitive processes are essentially computational, and hence computation provides the scientific key to explaining mentality. The Representational Theory of Mind (RTM) holds that representational content is the key feature in distinguishing mental from non-mental systems. I argue that there is a deep incompatibility between these two theoretical frameworks, and that the acceptance of CTM provides strong grounds for rejecting RTM. The focal point of the incompatibility is the fact that representational content (...) is extrinsic to formal procedures as such, and the intended interpretation of syntax makes no difference to the execution of an algorithm. So the unique 'content' postulated by RTM is superfluous to the formal procedures of CTM. And once these procedures are implemented in a physical mechanism, it is exclusively the causal properties of the physical mechanism that are responsible for all aspects of the system's behaviour. So once again, postulated content is rendered superfluous. To the extent that semantic content may appear to play a role in behaviour, it must be syntactically encoded within the system, and just as in a standard computational artefact, so too with the human mind/brain - it's pure syntax all the way down to the level of physical implementation. Hence 'content' is at most a convenient meta-level gloss, projected from the outside by human theorists, which itself can play no role in cognitive processing. (shrink)

This work is divided into two parts. Part I contains sixteen critical es says by prominent philosophers and computer scientists. Their papers offer insightful, well-argued contemporary views of a broad range of topics that lie at the heart of philosophy in the second half of the twen tieth century: semantics and ontology, induction, the nature of prob ability, the foundations of science, scientific objectivity, the theory of naming, the logic of conditionals, simulation modeling, the relatiOn be tween minds and machines, (...) and the nature of rules that guide be havior. In this volume honoring Arthur W. Burks, the philosophical breadth of his work is thus manifested in the diverse aspects of that work chosen for discussion and development by the contributors to his Festschrift. Part II consists of a book-length essay by Burks in which he lays out his philosophy of logical mechanism while responding to the papers in Part I. In doing so, he provides a unified and coherent context for the range of problems raised in Part I, and he highlights interesting relationships among the topics that might otherwise have gone un noticed. Part II is followed by a bibliography of Burks's published works. (shrink)

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)

We propose that the sudden emergence of metazoans during the Cambrian was due to the appearance of a complex genome architecture that was capable of computing. In turn, this made defining recursive functions possible. The underlying molecular changes that occurred in tandem were driven by the increased probability of maintaining duplicated DNA fragments in the metazoan genome. In our model, an increase in telomeric units, in conjunction with a telomerase-negative state and consequent telomere shortening, generated a reference point equivalent to (...) a non-reversible counting mechanism. (shrink)

This paper deals with the question: how is computation best individuated? -/- 1. The semantic view of computation: computation is best individuated by its semantic properties. 2. The causal view of computation: computation is best individuated by its causal properties. 3. The functional view of computation: computation is best individuated by its functional properties. -/- Some scientific theories explain the capacities of brains by appealing to computations that they supposedly perform. (...) The reason for that is usually that computation is individuated semantically. I criticize the reasons in support of this view and its presupposition of representation and semantics. Furthermore, I argue that the only justified appeal to a representational individuation of computation might be that it is partly individuated by implicit intrinsic representations. (shrink)

This paper aims to explore mechanistic and teleological explanations of consciousness. In terms of mechanistic explanations, it critiques various existing views, especially those embodied by existing computational cognitive models. In this regard, the paper argues in favor of the explanation based on the distinction between localist (symbolic) representation and distributed representation (as formulated in the connectionist literature), which reduces the phenomenological difference to a mechanistic difference. Furthermore, to establish a teleological explanation of consciousness, the paper discusses the (...) issue of the functional role of consciousness on the basis of the aforementioned mechanistic explanation. A proposal based on synergistic interaction between the conscious and the unconscious is advanced that encompasses various existing views concerning the functional role of consciousness. This two-step deepening explanation has some empirical support, in the form of a cognitive model and various cognitive data that it captures. © 2001 Elsevier Science B.V. All rights reserved. (shrink)

I defend Piccinini’s mechanistic account of computation against three related criticisms adapted from Sprevak’s critique of non-representational computation. I then argue that this defence highlights a major problem with what Sprevak calls the received view; namely, that representation introduces observer-relativity into our account of computation. I conclude that if we want to retain an objective account of computation, we should reject the received view.

The received view of dynamical explanation is that dynamical cognitive science seeks to provide covering law explanations of cognitive phenomena. By analyzing three prominent examples of dynamicist research, I show that the received view is misleading: some dynamical explanations are mechanistic explanations, and in this way resemble computational and connectionist explanations. Interestingly, these dynamical explanations invoke the mathematical framework of dynamical systems theory to describe mechanisms far more complex and distributed than the ones typically considered by philosophers. (...) Therefore, contemporary dynamicist research reveals the need for a more sophisticated account of mechanistic explanation. (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)

The rise of computers and robots, heralded in science fiction and pervading ever more daily experience, has fostered a rampant temptation to model mind as a mechanism and expect machines one day to simulate all mental reality. This temptation reflects more than technological developments, however. It arises from the perennial dilemma of two complementary approaches to mind that proceed from the assumption of a mind/body duality: one conceiving mind to be wholly immaterial and the other reducing mind to inanimate matter. (...) Exploring the difficulties of these views puts us in a position to evaluate the relation of mind and machine, helped along the way by key insights from Hegel.The notion that mind cannot be material seems confirmed in every moment of self-consciousness, whose purely temporal flow of mental content testifies to the apparent nonspatial existence of mind. Yet so long as mind is construed as immaterial, it lacks the resources to have any temporal ordering, possess any unity, or retain any specifically mental character. Deprived of materiality, mental life is hardly distinguishable from a succession of logical categories that exhibit determinacy in general rather than anything particular to mind. The possibilities of any non-logical content are excluded. Lacking any embodiment, mind has nothing with which passively to receive content in the manner of sensibility, or to retrieve and refashion any such sensible content in images. Mind could perhaps generate conceptual content, but this would be indistinguishable from the thoughts that logic produces in its thinking of thinking. (shrink)

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.

Mechanism realists assert the existence of mechanisms as objective structures in the world, but their exact metaphysical commitments are unclear. We introduce Local Hierarchy Realism (LHR) as a substantive and plausible form of mechanism realism. The limits of LHR reveal a deep tension between two aspects of mechanists’ explanatory strategy. Functional decomposition identifies locally relevant entities and activities, while these same entities and activities are also embedded in a nested hierarchy of levels. In principle, a functional decomposition may identify entities (...) engaging in causal interactions that crosscut the hierarchical structure of composition relations, violating the mechanist’s injunction against interlevel causation. We argue that this possibility is realized in the example of ephaptic coupling, a subsidiary process of neural computation that crosscuts the hierarchy derived from synaptic transmission. These considerations undermine the plausibility of LHR as a general view, yet LHR has the advantages that (i) its metaphysical implications are precisely stateable; (ii) the structure it identifies is not reducible to mere aggregate causation; and (iii) it clearly satisfies intuitive and informal definitions of mechanism. We conclude by assessing the prospects for a form of mechanism realism weaker than LHR that nevertheless satisfies all three of these requirements. (shrink)

The paper describes a system for dealing with nestings of belief in terms of the mechanism of computational environment. A method is offered for computing the beliefs of A about B (and so on) in terms of the systems existing knowledge structures about A and B separately. A proposal for belief percolation is put forward: percolation being a side effect of the process of the computation of nested beliefs, but one which could explain the acquisition of unsupported beliefs. It (...) is argued that the mechanism proposed is compatible with a general least effort hypothesis concerning human mental functioning. (shrink)

This paper offers a novel view of unity in neuroscience. I set out by discussing problems with the classical account of unity-by-reduction, due to Oppenheim and Putnam. That view relies on a strong notion of levels, which has substantial problems. A more recent alternative, the mechanistic “mosaic” view due to Craver, does not have such problems. But I argue that the mosaic ideal of unity is too minimal, and we should, if possible, aspire for more. Relying (...) on a number of recent works in theoretical neuroscience—network motifs, canonical neural computations and design-principles—I then present my alternative: a “flat” view of unity, i.e. one that is not based on levels. Instead, it treats unity as attained via the identification of recurrent explanatory patterns, under which a range of neuroscientific phenomena are subsumed. I develop this view by recourse to a causal conception of explanation, and distinguish it from Kitcher’s view of explanatory unification and related ideas. Such a view of unity is suitably ambitious, I suggest, and has empirical plausibility. It is fit to serve as an appropriate working hypothesis for 21st century neuroscience. (shrink)

An influential view in cognitive science is that computation in cognitive systems is semantic, conceptually depending on representation: to compute is to manipulate representations. I argue that accepting the non-semantic teleomechanistic view of computation lays the ground for a promising alternative strategy, in which computation helps to explain and naturalise representation, rather than the other way around. I show that this computation-based approach to representation presents six decisive advantages over the semantic view. I (...) claim that it can improve the two most influential current theories of representation, teleosemantics and structural representation, by providing them with precious tools to tackle some of their main shortcomings. In addition, the computation-based approach opens up interesting new theoretical paths for the project of naturalising representation, in which teleology plays a role in individuating computations, but not representations. (shrink)

In recent years, the ‘mechanistic view’ has developed as a popular alternative to the ‘semantic view’ concerning the identity of physical computation. However, semanticists have provided powerful arguments that suggest the mechanistic view fails to deliver essential distinctions between paradigmatic computational operations. This article reviews responses on behalf of the mechanist and uses this opportunity to propose a type of pluralism about computational identity. This pluralism contends that there are multiple ‘levels’ of properties and (...) relations pertaining to computation that can inform different kinds of individuation. As such, for the pluralist, there are multiple legitimate ways of classifying computation, depending on the nature of the system in question, and one’s own epistemic priorities. (shrink)

Mechanism realists assert the existence of mechanisms as objective structures in the world, but their exact metaphysical commitments are unclear. We introduce Local Hierarchy Realism (LHR) as a substantive and plausible form of mechanism realism. The limits of LHR reveal a deep tension between two aspects of mechanists’ explanatory strategy. Functional decomposition identifies locally relevant entities and activities, while these same entities and activities are also embedded in a nested hierarchy of levels. In principle, a functional decomposition may identify entities (...) engaging in causal interactions that crosscut the hierarchical structure of composition relations, violating the mechanist’s injunction against interlevel causation. We argue that this possibility is realized in the example of ephaptic coupling, a subsidiary process of neural computation that crosscuts the hierarchy derived from synaptic transmission. These considerations undermine the plausibility of LHR as a general view, yet LHR has the advantages that (i) its metaphysical implications are precisely stateable; (ii) the structure it identifies is not reducible to mere aggregate causation; and (iii) it clearly satisfies intuitive and informal definitions of mechanism. We conclude by assessing the prospects for a form of mechanism realism weaker than LHR that nevertheless satisfies all three of these requirements. (shrink)

The semantic view of computation is the claim that semantic properties play an essential role in the individuation of physical computing systems such as laptops and brains. The main argument for the semantic view rests on the fact that some physical systems simultaneously implement different automata at the same time, in the same space, and even in the very same physical properties. Recently, several authors have challenged this argument. They accept the premise of simultaneous implementation but reject (...) the semantic conclusion. In this paper, I aim to explicate the semantic view and to address these objections. I first characterize the semantic view and distinguish it from other, closely related views. Then, I contend that the master argument for the semantic view survives the counter-arguments against it. One counter-argument is that computational individuation is not forced to choose between the implemented automata but rather always picks out a more basic computational structure. My response is that this move might undermine the notion of computational equivalence. Another counter-argument is that while computational individuation is forced to rely on extrinsic features, these features need not be semantic. My reply is that the semantic view better accounts for these extrinsic features than the proposed non-semantic alternatives. (shrink)

Model validation in computational cognitive psychology often relies on methods drawn from the testing of theories in experimental physics. However, applications of these methods to computational models in typical cognitive experiments can hide multiple, plausible sources of variation arising from human participants and from stochastic cognitive theories, encouraging a “model fixed, data variable” paradigm that makes it difficult to interpret model predictions and to account for individual differences. This article proposes a likelihood‐based, “data fixed, model variable” paradigm in which models (...) are treated as stochastic processes in experiments with participant‐to‐participant variation that can be applied to a broad range of mechanistic cognitive architectures. This article discusses the implementation and implications of this view in model validation, with a concrete focus on a simple class of ACT‐R models of cognition. This article is not intended as a recipe for broad application of these preliminary, proof‐of‐concept methods, but as a framework for communication between statisticians searching for interesting problems in the cognitive modeling sphere, and cognitive modelers interested in generalizing from deterministic to stochastic model validation, in the face of random variation in human experimental data. (shrink)

What is computational explanation? Many accounts treat it as a kind of causal explanation. I argue against two more specific versions of this view, corresponding to two popular treatments of causal explanation. The first holds that computational explanation is mechanistic, while the second holds that it is interventionist. However, both overlook an important class of computational explanations, which I call limitative explanations. Limitative explanations explain why certain problems cannot be solved computationally, either in principle or in practice. I (...) argue that limitative explanations are not plausibly understood in either mechanistic or interventionist terms. One upshot of this argument is that there are causal and non-causal kinds of computational explanation. I close the paper by suggesting that both are grounded in the notion of computational implementation. (shrink)

& Carnegie Mellon University Abstract The rationality of human causal judgments has been the focus of a great deal of recent research. We argue against two major trends in this research, and for a quite different way of thinking about causal mechanisms and probabilistic data. Our position rejects a false dichotomy between "mechanistic" and "probabilistic" analyses of causal inference -- a dichotomy that both overlooks the nature of the evidence that supports the induction of mechanisms and misses some important (...) probabilistic implications of mechanisms. This dichotomy has obscured an alternative conception of causal learning: for discrete events, a central adaptive task is to induce causal mechanisms in the environment from probabilistic data and prior knowledge. Viewed from this perspective, it is apparent that the probabilistic norms assumed in the human causal judgment literature often do not map onto the mechanisms generating the probabilities. Our alternative conception of causal judgment is more congruent with both scientific uses of the notion of causation and observed causal judgments of untutored reasoners. We illustrate some of the relevant variables under this conception, using a framework for causal representation now widely adopted in computer science and, increasingly, in statistics. We also review the formulation and evidence for a theory of human causal induction (Cheng, 1997) that adopts this alternative conception. (shrink)

According to the semantic view of computation, computations cannot be individuated without invoking semantic properties. A traditional argument for the semantic view is what we shall refer to as the argument from the cognitive science practice. In its general form, this argument rests on the idea that, since cognitive scientists describe computations (in explanations and theories) in semantic terms, computations are individuated semantically. Although commonly invoked in the computational literature, the argument from the cognitive science practice has (...) never been discussed in detail. In this paper, we shall provide a critical reconstruction of this argument and an extensive analysis of its prospects, taking into account some ways of defending it that have never been explored so far. We shall argue that explanatory considerations support at best a weak version of the argument from the cognitive science practice, according to which semantic properties concur with formal syntactic properties in individuating computations in cognitive science, but not a strong version, according to which computation individuation in cognitive science is semantic as opposed to formal syntactic. (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)

Three special issues of Entropy journal have been dedicated to the topics of “InformationProcessing and Embodied, Embedded, Enactive Cognition”. They addressed morphological computing, cognitive agency, and the evolution of cognition. The contributions show the diversity of views present in the research community on the topic of computation and its relation to cognition. This paper is an attempt to elucidate current debates on computation that are central to cognitive science. It is written in the form of a dialog between (...) two authors representing two opposed positions regarding the issue of what computation is and could be, and how it can be related to cognition. Given the different backgrounds of the two researchers, which span physics, philosophy of computing and information, cognitive science, and philosophy, we found the discussions in the form of Socratic dialogue appropriate for this multidisciplinary/cross-disciplinary conceptual analysis. We proceed as follows. First, the proponent (GDC) introduces the info-computational framework as a naturalistic model of embodied, embedded, and enacted cognition. Next, objections are raised by the critic (MM) from the point of view of the new mechanistic approach to explanation. Subsequently, the proponent and the critic provide their replies. The conclusion is that there is a fundamental role for computation, understood as information processing, in the understanding of embodied cognition. (shrink)