Recently, many philosophers have been inclined to ascribe mentality to animals on the main grounds that they possess certain complex computational abilities. In this paper I contend that this view is misleading, since it wrongly assumes that those computational abilities demand a psychological explanation. On the contrary, they can be just characterised from a computational level of explanation, which picks up a domain of computation and information processing that is common to many computing systems but is autonomous from the domain (...) of psychology. Thus, I propose that it is possible to conceive insects and other animals as mere computing agents, without having any commitment to ascribe mentality to them. I conclude by sketching a proposal about how to draw the line between mere computing and genuine mentality. (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)

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

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)

The application of artificial intelligence (AI) to judicial decision-making has already begun in many jurisdictions around the world. While AI seems to promise greater fairness, access to justice, and legal certainty, issues of discrimination and transparency have emerged and put liberal democratic principles under pressure, most notably in the context of bail decisions. Despite this, there has been no systematic analysis of the risks to liberal democratic values from implementing AI into judicial decision-making. This article sets out to fill this (...) void by identifying and engaging with challenges arising from artificial judicial decision-making, focusing on three pillars of liberal democracy, namely equal treatment of citizens, transparency, and judicial independence. Methodologically, the work takes a comparative perspective between human and artificial decision-making, using the former as a normative benchmark to evaluate the latter. -/- The chapter first argues that AI that would improve on equal treatment of citizens has already been developed, but not yet adopted. Second, while the lack of transparency in AI decision-making poses severe risks which ought to be addressed, AI can also increase the transparency of options and trade-offs that policy makers face when considering the consequences of artificial judicial decision-making. Such transparency of options offers tremendous benefits from a democratic perspective. Third, the overall shift of power from human intuition to advanced AI may threaten judicial independence, and with it the separation of powers. While improvements regarding discrimination and transparency are available or on the horizon, it remains unclear how judicial independence can be protected, especially with the potential development of advanced artificial judicial intelligence (AAJI). Working out the political and legal infrastructure to reap the fruits of artificial judicial intelligence in a safe and stable manner should become a priority of future research in this area. (shrink)

Could a sufficiently detailed computer simulation of consciousness replicate consciousness? In other words, is performing the right computations sufficient for artificial consciousness? Or will there remain a difference between simulating and being a conscious system, because the right computations must be implemented in the right way? From the perspective of Karl Friston's free energy principle, self-organising systems (such as living organisms) share a set of properties that could be realised in artificial systems, but are not instantiated by computers with a (...) classical (von Neumann) architecture. I argue that at least one of these properties, viz. a certain kind of causal flow, can be used to draw a distinction between systems that merely simulate, and those that actually replicate consciousness. Since this property is instantiated by all systems that conform to the free energy principle (not just conscious beings), the account on offer here can be extended to draw a distinction between simulating and being a certain type of system, more generally. In particular, this may inform meta-ethical accounts of artificial moral status and artificial moral agency. (shrink)

Recent years have seen a surge of interest in applying mechanistic thinking to computational accounts of implementation and individuation. One recent extension of this work involves so-called ‘wide’ approaches to computation, the view that computational processes spread out beyond the boundaries of the individual. These ‘mechanistic accounts of wide computation’ maintain that computational processes are wide in virtue of being part of mechanisms that extend beyond the boundary of the individual. This paper aims to further develop the mechanistic account of (...) wide computationalism by responding to two outstanding worries, what are called the parsimony and testability challenges. The first is based on considerations about wide computation’s ontological cost; the second the view’s experimental testability. The argument is that wide mechanistic computationalism can gain the necessary conceptual resources to address the challenges by embracing two further aspects of the mechanistic approach: i) the structural aspect of mechanistic explanation and ii) the notion of constitutive relevance. (shrink)

Discussions of extended cognition have increasingly engaged with the empirical and methodological practices of cognitive science and psychology. One topic that has received increased attention from those interested in the extended mind is music cognition. A number of authors have argued that music not only shapes emotional and cognitive processes, but also that it extends those processes beyond the bodily envelope. The aim of this paper is to evaluate the case for extended music cognition. Two accounts are examined in detail: (...) Joel Krueger’s “musically extended emotional mind” and Tom Cochrane’s “expression and extended cognition.” Each account is evaluated using three “anti-extension” arguments. I argue that Krueger and Cochrane’s accounts offer important steps toward extended music cognition, but that each account remains underdeveloped in various ways. To supplement existing approaches, I propose a complementary extended computational approach to music cognition. The claim is that music cognition forms part of an extended system in virtue of involving computational processes that range across environmental and in-the-head elements. The paper concludes by showing how the ECMC deals with each of the three anti-extension challenges and responds to objections. (shrink)

The theory that all processes in the universe are computational is attractive in its promise to provide an understandable theory of everything. I want to suggest here that this pancomputationalism is not sufficiently clear on which problem it is trying to solve, and how. I propose two interpretations of pancomputationalism as a theory: I) the world is a computer and II) the world can be described as a computer. The first implies a thesis of supervenience of the physical over computation (...) and is thus reduced ad absurdum. The second is underdetermined by the world, and thus equally unsuccessful as theory. Finally, I suggest that pancomputationalism as metaphor can be useful. – At the Paderborn workshop in 2008, this paper was presented as a commentary to the relevant paper by Gordana Dodig-Crnkovic " Info-Computationalism and Philosophical Aspects of Research in Information Sciences". (shrink)

In this chapter I offer two novel arguments for what I call strong primitivism about cognitive phenomenology, the thesis that there exists a phenomenology of cognition that is neither reducible to, nor dependent upon, sensory phenomenology. I then contend that strong primitivism implies that phenomenal consciousness does not require sensory processing. This latter contention has implications for the philosophy of artificial intelligence. For if sensory processing is not a necessary condition for phenomenal consciousness, then it plausibly follows that AI consciousness (...) (assuming that it is possible) does not require embodiment. The overarching goal of this paper is to show how different topics in the analytic philosophy of mind can be brought to bear on an important issue in the philosophy of artificial intelligence. (shrink)

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)

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)

El transhumanismo como filosofía e ideología tecnologicista tiene cada vez más adeptos y se coloca en los ámbitos académicos como una posición positiva, posible y deseable. Su implementación aparece solapada en una vida cotidiana que depende, como nunca antes, de los avances tecnológicos. La posición que manejaremos es que esta ideología, que sobredimensiona el papel de la tecnología en la sociedad, tiene una visión limitada respecto con los conflictos éticos, económicos y sociales que dimanan de sus presupuestos. El problema no (...) es negar la tecnología sino qué rol juega en la construcción de la sociedad. El transhumanismo puede estar vendiendo un falso sueño de libertad, donde la uniformidad, la ausencia de crítica, la discriminación y la separación radical entre pobres y ricos definan ese mundo paradisíaco que propone. (shrink)

The recognition that human minds/brains are finite systems with limited resources for computation has led some researchers to advance theTractable Cognition thesis: Human cognitive capacities are constrained by computational tractability. This thesis, if true, serves cognitive psychology by constraining the space of computational‐level theories of cognition. To utilize this constraint, a precise and workable definition of “computational tractability” is needed. Following computer science tradition, many cognitive scientists and psychologists define computational tractability as polynomial‐time computability, leading to theP‐Cognition thesis. This article (...) explains how and why the P‐Cognition thesis may be overly restrictive, risking the exclusion of veridical computational‐level theories from scientific investigation. An argument is made to replace the P‐Cognition thesis by theFPT‐Cognition thesisas an alternative formalization of the Tractable Cognition thesis (here, FPT stands for fixed‐parameter tractable). Possible objections to the Tractable Cognition thesis, and its proposed formalization, are discussed, and existing misconceptions are clarified. (shrink)

David Chalmers' dancing qualia argument is intended to show that phenomenal experiences, or qualia, are organizational invariants. The dancing qualia argument is a reductio ad absurdum, attempting to demonstrate that holding an alternative position, such as the famous inverted spectrum argument, leads one to an implausible position about the relation between consciousness and cognition. In this paper, we argue that Chalmers' dancing qualia argument fails to establish the plausibility of qualia being organizational invariants. Even stronger, we will argue that the (...) gap in the argument cannot be closed. (shrink)

Searle's Chinese room argument is analyzed from a cognitive point of view. The analysis is based on a newly developed model of conceptual integration, the many space model proposed by Fauconnier and Turner. The main point of the analysis is that the central inference constructed in the Chinese room scenario is a result of a dynamic, cognitive activity of conceptual blending, with metaphor defining the basic features of the blending. Two important consequences follow: (1) Searle's recent contention that syntax is (...) not intrinsic to physics turns out to be a slightly modified version of the old Chinese room argument; and (2) the argument itself is still open to debate. It is persuasive but not conclusive, and at bottom it is a topological mismatch in the metaphoric conceptual integration that is responsible for the non-conclusive character of the Chinese room argument. (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)

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)

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)

After briefly discussing the relevance of the notions computation and implementation for cognitive science, I summarize some of the problems that have been found in their most common interpretations. In particular, I argue that standard notions of computation together with a state-to-state correspondence view of implementation cannot overcome difficulties posed by Putnam's Realization Theorem and that, therefore, a different approach to implementation is required. The notion realization of a function, developed out of physical theories, is then introduced as a replacement (...) for the notional pair computation-implementation. After gradual refinement, taking practical constraints into account, this notion gives rise to the notion digital system which singles out physical systems that could be actually used, and possibly even built. (shrink)

Triviality arguments against the computational theory of mind claim that computational implementation is trivial and thus does not serve as an adequate metaphysical basis for mental states. It is common to take computational implementation to consist in a mapping from physical states to abstract computational states. In this paper, I propose a novel constraint on the kinds of physical states that can implement computational states, which helps to specify what it is for two physical states to non-trivially implement the same (...) computational state. (shrink)

Opponents of the computational theory of mind have held that the theory is devoid of explanatory content, since whatever computational procedures are said to account for our cognitive attributes will also be realized by a host of other ‘deviant’ physical systems, such as buckets of water and possibly even stones. Such ‘triviality’ claims rely on a simple mapping account of physical implementation. Hence defenders of CTM traditionally attempt to block the trivialization critique by advocating additional constraints on the implementation relation. (...) However, instead of attempting to ‘save’ CTM by constraining the account of physical implementation, I argue that the general form of the triviality argument is invalid. I provide a counterexample scenario, and show that SMA is in fact consistent with empirically rich and theoretically plausible versions of CTM. This move requires rejection of the computational sufficiency thesis, which I argue is scientifically unjustified in any case. By shifting the ‘burden of explanatory force’ away from the concept of physical implementation, and instead placing it on salient aspects of the target phenomenon to be explained, it’s possible to retain a maximally liberal and unfettered view of physical implementation, and at the same time defuse the triviality arguments that have motivated defenders of CTM to impose various theory-laden constraints on SMA. (shrink)

The medium‐independence of computational descriptions has shaped common conceptions of computational explanation. So long as our goal is to explain how a system successfully carries out its computations, then we only need to describe the abstract series of operations that achieve the desired input–output mapping, however they may be implemented. It is argued that this abstract conception of computational explanation cannot be applied to so‐called real‐time computing systems, in which meeting temporal deadlines imposed by the systems with which a device (...) interfaces are constitutive of the computing tasks that a device performs. Instead, real‐time computing reveals the need for alternative conceptions of computational explanation, as well as computational implementation, that eschew medium‐independence. (shrink)

Sensorimotor psychology studies the mental processes that control goal-directed bodily motion. Recently, sensorimotor psychologists have provided empirically successful Bayesian models of motor control. These models describe how the motor system uses sensory input to select motor commands that promote goals set by high-level cognition. I highlight the impressive explanatory benefits offered by Bayesian models of motor control. I argue that our current best models assign explanatory centrality to a robust notion of mental representation. I deploy my analysis to defend intentional (...) realism, to rebut eliminativism and instrumentalism regarding mental representation, and to explore the relation between intentionality and normativity. (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)

The study outlines the existing and potential philosophical issues of the idea of conscious machines originated from the development of artificial consciousness within the framework of contemporary research of artificial intelligence and cognitive robotics. The outline shows that the idea of conscious machines is concerned with two big philosophical issues. The first philosophical issue is a definition of consciousness, taking into account the selection of a set of objects that can have consciousness, the typology of consciousness, the clarifying of the (...) nature of consciousness' carriers and the relationship between consciousness and its environment and the relationship between consciousness and language, in order to create an artificial consciousness within a machine, making that machine conscious. The second philosophical issue is a clarification whether only artificially created machines can be conscious machines, or cyborgizated human beings also can be considered of conscious machines. These philosophical issues show that there can be two ways to create conscious machines: 1) the creating of artificial consciousness within artificially created machine; and 2) the cyborgization of human being, transforming it into artificially created machine possessed natural consciousness. (shrink)

A critical survey of some attempts to define ‘computer’, beginning with some informal ones, then critically evaluating those of three philosophers, and concluding with an examination of whether the brain and the universe are computers.

In the 70 years since Alan Turing’s ‘Computing Machinery and Intelligence’ appeared in Mind, there have been two widely-accepted interpretations of the Turing test: the canonical behaviourist interpretation and the rival inductive or epistemic interpretation. These readings are based on Turing’s Mind paper; few seem aware that Turing described two other versions of the imitation game. I have argued that both readings are inconsistent with Turing’s 1948 and 1952 statements about intelligence, and fail to explain the design of his game. (...) I argue instead for a response-dependence interpretation. This interpretation has implications for Turing’s view of free will: I argue that Turing’s writings suggest a new form of free will compatibilism, which I call response-dependence compatibilism. The philosophical implications of rethinking Turing’s test go yet further. It is assumed by numerous theorists that Turing anticipated the computational theory of mind. On the contrary, I argue, his remarks on intelligence and free will lead to a new objection to computationalism. (shrink)

The thesis of the paper is that semiotic processes are intrinsic to computation and computational systems. An explanation of computation that does not take this semiotic dimension into account is incomplete. Semiosis is essential to computation and therefore requires a rigorous definition. To prove this thesis, the author analyzes two concepts of computation: the Turing machine and the mechanistic conception of physical computation. The paper is organized in two parts. The first part (Sects. 2 and 3) develops a re-interpretation of (...) the Turing machine starting from Peirce’s semiotics. The author shows how this reinterpretation allows overcoming the dualism between a purist and a realist version of the Turing machine. The second part of the paper (Sect. 4) shows how a mechanistic explanation of physical computation such as the one developed by Piccinini is incomplete without considering semiotic relations. The paper intends to be a contribution to the philosophical debate on computation. (shrink)

In this paper we defend structural representations, more specifically neural structural representation. We are not alone in this, many are currently engaged in this endeavor. The direction we take, however, diverges from the main road, a road paved by the mathematical theory of measure that, in the 1970s, established homomorphism as the way to map empirical domains of things in the world to the codomain of numbers. By adopting the mind as codomain, this mapping became a boon for all those (...) convinced that a representation system should bear similarities with what was being represented, but struggled to find a precise account of what such similarities mean. The euforia was brief, however, and soon homomorphism revealed itself to be affected by serious weaknesses, the primary one being that it included systems embarrassingly alien to representations. We find that the defense attempts that have followed, adopt strategies that share a common format: valid structural representations come as “homomorphism plus X”, with various “X”, provided in descriptive format only. Our alternative direction stems from the observation of the overlooked departure from homomorphism as used in the theory of measure and its later use in mental representations. In the former case, the codomain or the realm of numbers, is the most suited for developing theorems detailing the existence and uniqueness of homomorphism for a wide range of empirical domains. In the latter case, the codomain is the realm of the mind, possibly more vague and more ill-defined than the empirical domain itself. The time is ripe for articulating the mapping between represented domains and the mind in formal terms, by exploiting what is currently known about coding mechanisms in the brain. We provide a sketch of a possible development in this direction, one that adopts the theory of neural population coding as codomain. We will show that our framework is not only not in disagreement with the “plus X” proposals, but can lead to natural derivation of several of the “X”. (shrink)

The term ‘information’ is used extensively in biology, cognitive science and the philosophy of consciousness in relation to the concepts of ‘meaning’ and ‘causation’. While ‘information’ is a term that serves a useful purpose in specific disciplines, there is much to the concept that is problematic. Part 1 is a critique of the stance that information is an independently existing entity. On this view, and in biological contexts, systems transmit, acquire, assimilate, decode and manipulate it, and in so doing, generate (...) meaning. I provide a detailed proposal in Part 2 that supports the claim that it is the dynamic form of a system that qualifies the informational nature of meaningful interactive engagement, that is, that information is dependent on dynamic form rather than that it exists independently. In Part 3, I reflect on the importance of the distinction between the independent and dependent stances by looking specifically at the implications for how we might better interpret causation and emergence. (shrink)

The “Slicing Problem” is a thought experiment that raises questions for substrate-neutral computational theories of consciousness, including those that specify a certain causal structure for the computation like Integrated Information Theory. The thought experiment uses water-based logic gates to construct a computer in a way that permits cleanly slicing each gate and connection in half, creating two identical computers each instantiating the same computation. The slicing can be reversed and repeated via an on/off switch, without changing the amount of matter (...) in the system. The question is what do different computational theories of consciousness believe is happening to the number and nature of individual conscious units as this switch is toggled. Under a token interpretation, there are now two discrete conscious entities; under a type interpretation, there may remain only one. Both interpretations lead to different implications depending on the adopted theoretical stance. Any route taken either allows mechanisms for “consciousness-multiplying exploits” or requires ambiguous boundaries between conscious entities, raising philosophical and ethical questions for theorists to consider. We discuss resolutions under different theories of consciousness for those unwilling to accept consciousness-multiplying exploits. In particular, we specify three features that may help promising physicalist theories to navigate such thought experiments. (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)

It is often indeterminate what function a given computational system computes. This phenomenon has been referred to as “computational indeterminacy” or “multiplicity of computations.” In this paper, we argue that what has typically been considered and referred to as the challenge of computational indeterminacy in fact subsumes two distinct phenomena, which are typically bundled together and should be teased apart. One kind of indeterminacy concerns a functional characterization of the system’s relevant behavior. Another kind concerns the manner in which the (...) abstract states are interpreted. We discuss the similarities and differences between the two kinds of computational indeterminacy, their implications for certain accounts of “computational individuation” in the literature, and their relevance to different levels of description within the computational system. We also examine the inter-relationships between our proposed accounts of the two kinds of indeterminacy and the main accounts of “computational implementation.”. (shrink)

In this article, I describe a novel position on the semantics of artificial intelligence. I present a problem for the current artificial neural networks used in machine learning, specifically with relation to natural language tasks. I then propose that from a metasemantic level, meaning in machines can best be interpreted as radically contextualist. Finally, I consider what this might mean for human‐level semantic competence from a comparative perspective.

This paper seeks to understand machine cognition. The nature of machine cognition has been shrouded in incomprehensibility. We have often encountered familiar arguments in cognitive science that human cognition is still faintly understood. This paper will argue that machine cognition is far less understood than even human cognition despite the fact that a lot about computer architecture and computational operations is known. Even if there have been putative claims about the transparency of the notion of machine computations, these claims do (...) not hold out in unraveling machine cognition, let alone machine consciousness (if there is any such thing). The nature and form of machine cognition remains further confused also because of attempts to explain human cognition in terms of computation and to model/simulate (aspects of) human cognitive processing in machines. Given that these problems in characterizing machine cognition persist, a view of machine cognition that aims to avoid these problems is outlined. The argument that is advanced is that something becomes a computation in machines only when a human interprets it, which is a kind of semiotic causation. From this it follows that a computing machine is not engaged in a computation unless a human interprets what it is doing; instead, it is engaged in machine cognition, which is defined as a member or subset of the set of all possible mappings of inputs to outputs. The human interpretation, which is a semiotic process, gives meaning to what a machine does, and then what it does becomes a computation. (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)

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)

ABSTRACTWhile over the last few decades AI research has largely focused on building tools and applications, recent technological developments have prompted a resurgence of interest in building a genuinely intelligent artificial agent – one that has a mind in the same sense that humans and animals do. In this paper, I offer a theoretical and methodological framework for this project of investigating “artificial minded intelligence” that can help to unify existing approaches and provide new avenues for research. I first outline (...) three desiderata that a framework for AMI research should satisfy. In Section 1, I further motivate the desiderata as well as the need for a new framework. Section 2 develops a general methodological approach, the “generative methodology,” and Section 3 develops a version of this methodology, the “Competence Framework for AI research”. (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.

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

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

Putnam and Searle famously argue against computational theories of mind on the skeptical ground that there is no fact of the matter as to what mathematical function a physical system is computing: both conclude (albeit for somewhat different reasons) that virtually any physical object computes every computable function, implements every program or automaton. There has been considerable discussion of Putnam's and Searle's arguments, though as yet there is little consensus as to what, if anything, is wrong with these arguments. In (...) the present paper we show that an analogous line of reasoning can be raised against the numerical measurement (i.e., numerical representation) of physical magnitudes, and we argue that this result is a reductio ad absurdum of the challenge to computational skepticism. We then use this reductio to get clearer about both (i) what's wrong with Putnam's and Searle's arguments against computationalism, and (ii) what can be learned about both computational implementation and numerical measurement from the shortcomings of both sorts of skeptical argument. (shrink)

The philosophy of information (PI) is a new area of research with its own field of investigation and methodology. This article, based on the Herbert A. Simon Lecture of Computing and Philosophy I gave at Carnegie Mellon University in 2001, analyses the eighteen principal open problems in PI. Section 1 introduces the analysis by outlining Herbert Simon's approach to PI. Section 2 discusses some methodological considerations about what counts as a good philosophical problem. The discussion centers on Hilbert's famous analysis (...) of the central problems in mathematics. The rest of the article is devoted to the eighteen problems. These are organized into five sections: problems in the analysis of the concept of information, in semantics, in the study of intelligence, in the relation between information and nature, and in the investigation of values. (shrink)

Against Maudlin, I argue that machines which merely reproduce a pre-programmed series of changes ought to be classed with Turing’s O-Machines even if they would counterfactually show Turing Machine-like activity. This can be seen on an interventionist picture of computational architectures, on which basic operations are the primitive loci for interventions. While constructions like Maudlin’s Olympia still compute, then, claims about them do not threaten philosophical arguments that depend on Turing Machine architectures and their computational equivalents.

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)

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)

For an artificial agent to be morally praiseworthy, its rules for behaviour and the mechanisms for supplying those rules must not be supplied entirely by external humans. Such systems are a substantial departure from current technologies and theory, and are a low prospect. With foreseeable technologies, an artificial agent will carry zero responsibility for its behavior and humans will retain full responsibility.