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)

(Penultimate draft) Embodied Cognition holds that bodily (e.g. sensorimotor) states and processes are directly involved in some higher-level cognitive functions (e.g. reasoning). This challenges traditional views of cognition according to which bodily states and processes are, at most, indirectly involved in higher-level cognition. Although some elements of Embodied Cognition have been integrated into mainstream cognitive science, others still face adamant resistance. In this paper, rather than straightforwardly defend Embodied Cognition against specific objections I will do the following. First, I will (...) present a concise account of embodied conceptual processing and highlight some of its advantages over non-embodied accounts, specifically focusing on the role of metaphors. Second, I will detail the influence of computational metaphors on theories of cognition and evaluation of these theories. Third, I will argue that embodied cognitive mechanisms, specifically those operating through computational metaphors, may drive some of the resistance to Embodied Cognition - and that Embodied Cognition is able to offer a uniquely compelling account of this. Ultimately, this will contribute to an improved understanding of Embodied Cognition, its explanatory power, and how it ought to be evaluated. Additionally, it will shed light on the role of metaphors in shaping philosophical thought and highlight the importance of these influences. (shrink)

The problem of multiple-computations discovered by Hilary Putnam presents a deep difficulty for functionalism (of all sorts, computational and causal). We describe in out- line why Putnam’s result, and likewise the more restricted result we call the Multiple- Computations Theorem, are in fact theorems of statistical mechanics. We show why the mere interaction of a computing system with its environment cannot single out a computation as the preferred one amongst the many computations implemented by the system. We explain why nonreductive (...) approaches to solving the multiple- computations problem, and in particular why computational externalism, are dualistic in the sense that they imply that nonphysical facts in the environment of a computing system single out the computation. We discuss certain attempts to dissolve Putnam’s unrestricted result by appealing to systems with certain kinds of input and output states as a special case of computational externalism, and show why this approach is not workable without collapsing to behaviorism. We conclude with some remarks about the nonphysical nature of mainstream approaches to both statistical mechanics and the quantum theory of measurement with respect to the singling out of partitions and observables. (shrink)

I show that the indeterminacy problem for computational structuralists is in fact far more problematic than even the harshest critic of structuralism has realised; it is not a bullet which can be bitten by structuralists as previously thought. Roughly, this is because the structural indeterminacy of logic-gates such as AND/OR is caused by the structural identity of the binary computational digits 0/1 themselves. I provide a proof that pure computational structuralism is untenable because structural indeterminacy entails absurd consequences - namely, (...) that there is only one binary computational digit. I conclude that accounting for individuation is a more important desiderata for a theory of computation than even that of triviality. -/- . (shrink)

Philosophers interested in the theoretical consequences of predictive processing often assume that predictive processing is an inferentialist and representationalist theory of cognition. More specifically, they assume that predictive processing revolves around approximated Bayesian inferences drawn by inverting a generative model. Generative models, in turn, are said to be structural representations: representational vehicles that represent their targets by being structurally similar to them. Here, I challenge this assumption, claiming that, at present, it lacks an adequate justification. I examine the only argument (...) offered to establish that generative models are structural representations, and argue that it does not substantiate the desired conclusion. Having so done, I consider a number of alternative arguments aimed at showing that the relevant structural similarity obtains, and argue that all these arguments are unconvincing for a variety of reasons. I then conclude the paper by briefly highlighting three themes that might be relevant for further investigation on the matter. (shrink)

The notion of representation in neuroscience has largely been predicated on localizing the components of computational processes that explain cognitive function. On this view, which I call “algorithmic homuncularism,” individual, spatially and temporally distinct parts of the brain serve as vehicles for distinct contents, and the causal relationships between them implement the transformations specified by an algorithm. This view has a widespread influence in philosophy and cognitive neuroscience, and has recently been ably articulated and defended by Shea. Still, I am (...) skeptical about algorithmic homuncularism, and I argue against it by focusing on recent methods for complex data analysis in systems neuroscience. I claim that analyses such as principle components analysis and linear discriminant analysis prevent individuating vehicles as algorithmic homuncularism recommends. Rather, each individual part contributes to a global state space, trajectories of which vary with important task parameters. I argue that, while homuncularism is false, this view still supports a kind of “vehicle realism,” and I apply this view to debates about the explanatory role of representation. (shrink)

Volume 33, Issue 8, November 2020, Page 1096-1120.

Technological artefacts have, in recent years, invited increasingly intimate ways of interaction. But surprisingly little attention has been devoted to how such interactions, like with wearable devices or household robots, shape our minds, cognitive capacities, and moral character. In this thesis, I develop an embodied, enactive account of mind--technology interaction that takes the reciprocal influence of artefacts on minds seriously. First, I examine how recent developments in philosophy of technology can inform the phenomenology of mind--technology interaction as seen through an (...) enactivist lens. Second, I show how an enactive account of remembering can improve operationalizations of the memory palace mnemonic through virtual reality devices. Third, I draw on virtue ethics to argue that an enactivist approach allows us to better grasp the morally shaping aspects of artefacts by looking at social robots. Fourth, I fend off an underlying metaphysical concern about enactivism by arguing that an embodied, enactive account is compatible with the multiple realization of cognitive processes. This principle is often seen as a crucial test favouring accounts such as extended functionalism over enactivism and I argue that some forms of enactivism pass this test as well. Finally, I conclude by considering what the future relationship between enactivism and functionalism may have in store for the study of mind--technology interaction. (shrink)

This paper makes a novel linkage between the multiple-computations theorem in philosophy of mind and Landauer’s principle in physics. The multiple-computations theorem implies that certain physical systems implement simultaneously more than one computation. Landauer’s principle implies that the physical implementation of “logically irreversible” functions is accompanied by minimal entropy increase. We show that the multiple-computations theorem is incompatible with, or at least challenges, the universal validity of Landauer’s principle. To this end we provide accounts of both ideas in terms of (...) low-level fundamental concepts in statistical mechanics, thus providing a deeper understanding of these ideas than their standard formulations given in the high-level terms of thermodynamics and cognitive science. Since Landauer’s principle is pivotal in the attempts to derive the universal validity of the second law of thermodynamics in statistical mechanics, our result entails that the multiple-computations theorem has crucial implications with respect to the second law. Finally, our analysis contributes to the understanding of notions, such as “logical irreversibility,” “entropy increase,” “implementing a computation,” in terms of fundamental physics, and to resolving open questions in the literature of both fields, such as: what could it possibly mean that a certain physical process implements a certain computation. (shrink)

Turner argues that computer programs must have purposes, that implementation is not a kind of semantics, and that computers might need to understand what they do. I respectfully disagree: Computer programs need not have purposes, implementation is a kind of semantic interpretation, and neither human computers nor computing machines need to understand what they do.

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)

In this paper, the Author reviewed the typical objections against the claim that brains are computers, or, to be more precise, information-processing mechanisms. By showing that practically all the popular objections are based on uncharitable interpretations of the claim, he argues that the claim is likely to be true, relevant to contemporary cognitive science, and non-trivial.

The mainstream view in cognitive science is that computation lies at the basis of and explains cognition. Our analysis reveals that there is no compelling evidence or argument for thinking that brains compute. It makes the case for inverting the explanatory order proposed by the computational basis of cognition thesis. We give reasons to reverse the polarity of standard thinking on this topic, and ask how it is possible that computation, natural and artificial, might be based on cognition and not (...) the other way around. (shrink)

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

"Rationality: Contexts and Constraints" is an interdisciplinary reappraisal of the nature of rationality. In method, it is pluralistic, drawing upon the analytic approaches of philosophy, linguistics, neuroscience, and more. These methods guide exploration of the intersection between traditional scholarship and cutting-edge philosophical or scientific research. In this way, the book contributes to development of a suitably revised, comprehensive understanding of rationality, one that befits the 21st century, one that is adequately informed by recent investigations of science, pathology, non-human thought, emotion, (...) and even enigmatic Chinese texts that might previously have seemed to be expressions of irrationalism. Addresses recent challenges and Identifies a direction for future research on rationalityInvestigates the relationship between rationality and mental disorders, such as delusion and depressionAssesses reasoning in artificial intelligence and nonhuman animalsReflects on ancient Chinese Philosophy and possible cultural differences in human psychology Employs philosophical reflection, along with linguistic, probabilistic, and logical techniques. (shrink)

ABSTRACT Shagrir and Sprevak explore the apparent necessity of representation for the individuation of digits in computational systems.1 1 I will first offer a response to Sprevak’s argument that does not mention Shagrir’s original formulation, which was more complex. I then extend my initial response to cover Shagrir’s argument, thus demonstrating that it is possible to individuate digits in non-representational computing mechanisms. I also consider the implications that the non-representational individuation of digits would have for the broader theory of computing (...) mechanisms. 1 The Received View: No Computation without Representation 2 Computing Mechanisms and Functional Individuation 3 Against Computational Externalism 4 Implications for the Mechanistic Account. (shrink)

The neural vehicles of mental representation play an explanatory role in cognitive psychology that their realizers do not. In this paper, I argue that the individuation of realizers as vehicles of representation restricts the sorts of explanations in which they can participate. I illustrate this with reference to Rupert’s (2011) claim that representational vehicles can play an explanatory role in psychology in virtue of their quantity or proportion. I propose that such quantity-based explanatory claims can apply only to realizers and (...) not to vehicles, in virtue of the particular causal role that vehicles play in psychological explanations. (shrink)

In this paper, I show how semantic factors constrain the understanding of the computational phenomena to be explained so that they help build better mechanistic models. In particular, understanding what cognitive systems may refer to is important in building better models of cognitive processes. For that purpose, a recent study of some phenomena in rats that are capable of ‘entertaining’ future paths (Pfeiffer and Foster 2013) is analyzed. The case shows that the mechanistic account of physical computation may be complemented (...) with semantic considerations, and in many cases, it actually should. (shrink)

In this essay we discuss recent attempts to analyse the notion of representation, as it is employed in cognitive science, in purely informational terms. In particular, we argue that recent informational theories cannot accommodate the existence of metarepresentations. Since metarepresentations play a central role in the explanation of many cognitive abilities, this is a serious shortcoming of these proposals.

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 essay is divided into two parts. In the first part (§2), I introduce the idea of practical meaning by looking at a certain kind of procedural systems — the motor system — that play a central role in computational explanations of motor behavior. I argue that in order to give a satisfactory account of the content of the representations computed by motor systems (motor commands), we need to appeal to a distinctively practical kind of meaning. Defending the explanatory relevance (...) of semantic properties in a computationalist explanation of motor behavior, my argument concludes that practical meanings play a central role in an adequate psychological theory of motor skill. In the second part of this essay (§3), I generalize and clarify the notion of practical meaning, and I defend the intelligibility of practical meanings against an important objection. (shrink)

Traditionally, computational theory (CT) and dynamical systems theory (DST) have presented themselves as opposed and incompatible paradigms in cognitive science. There have been some efforts to reconcile these paradigms, mainly, by assimilating DST to CT at the expenses of its anti-representationalist commitments. In this paper, building on Piccinini’s mechanistic account of computation and the notion of functional closure, we explore an alternative conciliatory strategy. We try to assimilate CT to DST by dropping its representationalist commitments, and by inviting CT to (...) recognize the functionally closed nature of some computational systems. (shrink)

Radical enactive and embodied approaches to cognitive science oppose the received view in the sciences of the mind in denying that cognition fundamentally involves contentful mental representation. This paper argues that the fate of representationalism in cognitive science matters significantly to how best to understand the extent of cognition. It seeks to establish that any move away from representationalism toward pure, empirical functionalism fails to provide a substantive “mark of the cognitive” and is bereft of other adequate means for individuating (...) cognitive activity. It also argues that giving proper attention to the way the folk use their psychological concepts requires questioning the legitimacy of commonsense functionalism. In place of extended functionalism—empirical or commonsensical—we promote the fortunes of extensive enactivism, clarifying in which ways it is distinct from notions of extended mind and distributed cognition. (shrink)

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 computing mechanisms as non-representational, (...) and might also facilitate reconciliation between computational and autopoietic/enactive approaches to the study of cognition. (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)

How can we explain the intentional nature of an expert’s actions, performed without immediate and conscious control, relying instead on automatic cognitive processes? How can we account for the differences and similarities with a novice’s performance of the same actions? Can a naturalist explanation of intentional expert action be in line with a philosophical concept of intentional action? Answering these and related questions in a positive sense, this dissertation develops a three-step argument. Part I considers different methods of explanations in (...) cognitive neuroscience (Bennett & Hacker’s philosophical, conceptual analysis; Marr’s three levels of explanation; Neural Correlates of Consciousness research; mechanistic explanation), defending ‘mechanistic explanation’ as a method that provides the necessary tools for integrating interdisciplinary insights into human action. Furthermore, a dynamic, explanatory mechanism allows the assessment of the impact of learning and development on expert action in a valuable way that other methods don’t. Part II continues by scrutinizing several cognitive neuroscientific theories of learning and development (neuroconstructivism; dual-processing theories; simulation theory; extended mind/cognition hypothesis), arguing for the complex interactions between different types of processing and different action representations involved in expert action performances. Moreover, according to our discussion of a particular ‘simulation theory’ these interactions can be influenced in several ways with the use of language, allowing an agent to configure a specific action representation for performance at a later stage. The results of Parts I and II are then applied in Part III to a parallel discussion of philosophical analyses of intentional action (discussing i.a. Frankfurt, Bratman, Pacherie and Ricoeur) and cognitive neuroscientific insights in it. Both approaches are found to converge in emphasizing the importance for an expert to develop stable patterns of actions that comply maximally not only with his intentions, but also with his motor expertise and with situational conditions. Consequently, his actions – automatic, or not – rely on this ‘sculpted space of actions’. (shrink)

According to Marr, a computational-level theory consists of two elements, the what and the why. This article highlights the distinct role of the Why element in the computational analysis of vision. Three theses are advanced: that the Why element plays an explanatory role in computational-level theories, that its goal is to explain why the computed function is appropriate for a given visual task, and that the explanation consists in showing that the functional relations between the representing cells are similar to (...) the “external” mathematical relations between the entities that these cells represent. (shrink)

I articulate and defend a new theory of what it is for a physical system to implement an abstract computational model. According to my descriptivist theory, a physical system implements a computational model just in case the model accurately describes the system. Specifically, the system must reliably transit between computational states in accord with mechanical instructions encoded by the model. I contrast my theory with an influential approach to computational implementation espoused by Chalmers, Putnam, and others. I deploy my theory (...) to illuminate the relation between computation and representation. I also rebut arguments, propounded by Putnam and Searle, that computational implementation is trivial. (shrink)

Putnam (Representations and reality. MIT Press, Cambridge, 1988) and Searle (The rediscovery of the mind. MIT Press, Cambridge, 1992) famously argue that almost every physical system implements every finite computation. This universal implementation claim, if correct, puts at the risk of triviality certain functional and computational views of the mind. Several authors have offered theories of implementation that allegedly avoid the pitfalls of universal implementation. My aim in this paper is to suggest that these theories are still consistent with a (...) weaker result, which is the nomological possibility of systems that simultaneously implement different complex automata. Elsewhere I (Shagrir in J Cogn Sci, 2012) argue that this simultaneous implementation result challenges a computational sufficiency thesis (articulated by Chalmers in J Cogn Sci, 2012). My focus here is on theories of implementation. After presenting the basic simultaneous implementation construction, I argue that these theories do not avoid the simultaneous implementation result. The conclusion is that the idea that the implementation of the right kind of automaton suffices for a possession of a mind is dubious. (shrink)

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...) semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

Under what conditions does a physical system implement or realize a computation? Structuralism about computational implementation, espoused by Chalmers and others, holds that a physical system realizes a computation just in case the system instantiates a pattern of causal organization isomorphic to the computation’s formal structure. I argue against structuralism through counter-examples drawn from computer science. On my opposing view, computational implementation sometimes requires instantiating semantic properties that outstrip any relevant pattern of causal organization. In developing my argument, I defend (...) anti-individualism about computational implementation: relations to the social environment sometimes help determine whether a physical system realizes a computation. 1 The Physical Realization Relation2 Semantics and Computational Implementation3 Conforming to Instructions4 Implementing a Computer Program4.1 The denotational semantics of Scheme4.2 Worries about intentionality4.3 Worries about the natural numbers5 Implementing a Machine Model6 Bounded Structuralism7 Triviality Arguments8 Anti-individualism about Computational Implementation. (shrink)

The paper presents a paradoxical feature of computational systems that suggests that computationalism cannot explain symbol grounding. If the mind is a digital computer, as computationalism claims, then it can be computing either over meaningful symbols or over meaningless symbols. If it is computing over meaningful symbols its functioning presupposes the existence of meaningful symbols in the system, i.e. it implies semantic nativism. If the mind is computing over meaningless symbols, no intentional cognitive processes are available prior to symbol grounding. (...) In this case, no symbol grounding could take place since any grounding presupposes intentional cognitive processes. So, whether computing in the mind is over meaningless or over meaningful symbols, computationalism implies semantic nativism. (shrink)

According to pancomputationalism, everything is a computing system. In this paper, I distinguish between different varieties of pancomputationalism. I find that although some varieties are more plausible than others, only the strongest variety is relevant to the philosophy of mind, but only the most trivial varieties are true. As a side effect of this exercise, I offer a clarified distinction between computational modelling and computational explanation.<br><br>.

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)

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)

This paper offers an account of what it is for a physical system to be a computing mechanism—a system that performs computations. A computing mechanism is a mechanism whose function is to generate output strings from input strings and (possibly) internal states, in accordance with a general rule that applies to all relevant strings and depends on the input strings and (possibly) internal states for its application. This account is motivated by reasons endogenous to the philosophy of computing, namely, doing (...) justice to the practices of computer scientists and computability theorists. It is also an application of recent literature on mechanisms, because it assimilates computational explanation to mechanistic explanation. The account can be used to individuate computing mechanisms and the functions they compute and to taxonomize computing mechanisms based on their computing power. (shrink)

Over the past thirty years, it is been common to hear the mind likened to a digital computer. This essay is concerned with a particular philosophical view that holds that the mind literally is a digital computer (in a specific sense of “computer” to be developed), and that thought literally is a kind of computation. This view—which will be called the “Computational Theory of Mind” (CTM)—is thus to be distinguished from other and broader attempts to connect the mind with computation, (...) including (a) various enterprises at modeling features of the mind using computational modeling techniques, and (b) employing some feature or features of production-model computers (such as the stored program concept, or the distinction between hardware and software) merely as a guiding metaphor for understanding some feature of the mind. This entry is therefore concerned solely with the Computational Theory of Mind (CTM) proposed by Hilary Putnam [1961] and developed most notably for philosophers by Jerry Fodor [1975, 1980, 1987, 1993]. The senses of ‘computer’ and ‘computation’ employed here are technical; the main tasks of this entry will therefore be to elucidate: (a) the technical sense of ‘computation’ that is at issue, (b) the ways in which it is claimed to be applicable to the mind, (c) the philosophical problems this understanding of the mind is claimed to solve, and (d) the major criticisms that have accrued to this view. (shrink)

A comprehensive introduction to the Language of Though Hypothesis (LOTH) accessible to general audiences. LOTH is an empirical thesis about thought and thinking. For their explication, it postulates a physically realized system of representations that have a combinatorial syntax (and semantics) such that operations on representations are causally sensitive only to the syntactic properties of representations. According to LOTH, thought is, roughly, the tokening of a representation that has a syntactic (constituent) structure with an appropriate semantics. Thinking thus consists in (...) syntactic operations defined over representations. Most of the arguments for LOTH derive their strength from their ability to explain certain empirical phenomena like productivity, systematicity of thought and thinking. (shrink)

Enactivism advances an understanding of cognition rooted in the dynamic interaction between an embodied agent and their environment, whilst new mechanism suggests that cognition is explained by uncovering the organised components underlying cognitive capacities. On the face of it, the mechanistic model’s emphasis on localisable and decomposable mechanisms, often neural in nature, runs contrary to the enactivist ethos. Despite appearances, this paper argues that mechanistic explanations of cognition, being neither narrow nor reductive, and compatible with plausible iterations of ideas like (...) emergence and downward causation, are congruent with enactivism. Attention to enactivist ideas, moreover, may serve as a heuristic for mechanistic investigations of cognition. Nevertheless, I show how enactivism and approaches that prioritise mechanistic modelling may diverge in starting assumptions about the nature of cognitive phenomena, such as where the constitutive boundaries of cognition lie. (shrink)

A skeptical worry known as ‘the indeterminacy of computation’ animates much recent philosophical reflection on the computational identity of physical systems. On the one hand, computational explanation seems to require that physical computing systems fall under a single, unique computational description at a time. On the other, if a physical system falls under any computational description, it seems to fall under many simultaneously. Absent some principled reason to take just one of these descriptions in particular as relevant for computational explanation, (...) widespread failure of computational explanation would appear to follow. This paper advances a new solution to the indeterminacy of computation. Very roughly, I argue that the computational identity of a physical system is determinate relative to a contextually specified way of regarding that system computationally—known as a labelling scheme. When a system simultaneously implements multiple computations, it does so relative to different labelling schemes. But relative to a fixed labelling scheme, a physical system has a unique computational identity. I argue that this relativistic conception of computational identity vindicates computational explanation in the face of simultaneous implementation. (shrink)

This article advertises a new account of computational implementation. According to the resemblance account, implementation is a matter of resembling a computational architecture. The resemblance account departs from previous theories by denying that computational architectures are exhausted by their formal, mathematical features. Instead, they are taken to be permeated with causality, spatiotemporality, and other nonmathematical features. I argue that this approach comports well with computer scientific practice and offers a novel response to so-called triviality arguments.

The received view of computation is methodologically bifurcated: it offers different accounts of computation in the mathematical and physical cases. But little in the way of argument has been given for this approach. This article rectifies the situation by arguing that the alternative, a unified account, is untenable. Furthermore, once these issues are brought into sharper relief we can see that work remains to be done to illuminate the relationship between physical and mathematical computation.

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)

According to Enactivism, cognition should be understood in terms of a dynamic interaction between an acting organism and its environment. Further, this view holds that organisms do not passively receive information from this environment, they rather selectively create this environment by engaging in interaction with the world. Radical Enactivism adds that basic cognition does so without entertaining representations and hence that representations are not an essential constituent of cognition. Some proponents think that getting rid of representations amounts to a revolutionary (...) alternative to standard views about cognition. To emphasize the impact, they claim that this ‘radicalization’ should be applied to all enactivist friendly views, including, another current and potentially revolutionary approach to cognition: predictive processing. In this paper, we will show that this is not the case. After introducing the problem, we will argue that ‘radicalizing’ predictive processing does not add any value to this approach. After this, we will analyze whether or not radical Enactivism can count as a revolution within cognitive science at all and conclude that it cannot. Finally, in section 5 we will claim that cognitive science is better off when embracing heterogeneity. (shrink)

Since the cognitive revolution, it has become commonplace that cognition involves both computation and information processing. Is this one claim or two? Is computation the same as information processing? The two terms are often used interchangeably, but this usage masks important differences. In this paper, we distinguish information processing from computation and examine some of their mutual relations, shedding light on the role each can play in a theory of cognition. We recommend that theorists of cognition be explicit and careful (...) in choosing notions of computation and information and connecting them together.Keywords: Computation; Information processing; Computationalism; Computational theory of mind; Cognitivism. (shrink)

The ‘received view’ about computation is that all computations must involve representational content. Egan and Piccinini argue against the received view. In this paper, I focus on Egan’s arguments, claiming that they fall short of establishing that computations do not involve representational content. I provide positive arguments explaining why computation has to involve representational content, and how that representational content may be of any type. I also argue that there is no need for computational psychology to be individualistic. Finally, I (...) draw out a number of consequences for computational individuation, proposing necessary conditions on computational identity and necessary and sufficient conditions on computational I/O equivalence of physical systems.Keywords: Computation; Representation; Computational identity; Explanation; Narrow content; Physical computation. (shrink)

Defending or attacking either functionalism or computationalism requires clarity on what they amount to and what evidence counts for or against them. My goal here is not to evaluate their plausibility. My goal is to formulate them and their relationship clearly enough that we can determine which type of evidence is relevant to them. I aim to dispel some sources of confusion that surround functionalism and computationalism, recruit recent philosophical work on mechanisms and computation to shed light on them, and (...) clarify how functionalism and computationalism may or may not legitimately come together. (shrink)

Turing computation over a non-linguistic domain presupposes a notation for the domain. Accordingly, computability theory studies notations for various non-linguistic domains. It illuminates how different ways of representing a domain support different finite mechanical procedures over that domain. Formal definitions and theorems yield a principled classification of notations based upon their computational properties. To understand computability theory, we must recognize that representation is a key target of mathematical inquiry. We must also recognize that computability theory is an intensional enterprise: it (...) studies entities as represented in certain ways, rather than entities detached from any means of representing them. (shrink)