First published in 1949 expressly to introduce logical positivism to English speakers. Reichenbach, with Rudolph Carnap, founded logical positivism, a form of epistemofogy that privileged scientific over metaphysical truths.

Computational approaches dominate contemporary cognitive science, promising a unified, scientific explanation of how the mind works. However, computational approaches raise major philosophical and scientific questions. In what sense is the mind computational? How do computational approaches explain perception, learning, and decision making? What kinds of challenges should computational approaches overcome to advance our understanding of mind, brain, and behaviour? The Routledge Handbook of the Computational Mind is an outstanding overview and exploration of these issues and the first philosophical collection of (...) its kind. Comprising thirty-five chapters by an international team of contributors from different disciplines, the Handbook is organised into four parts: History and future prospects of computational approaches Types of computational approach Foundations and challenges of computational approaches Applications to specific parts of psychology. Essential reading for students and researchers in philosophy of mind, philosophy of psychology, and philosophy of science, The Routledge Handbook of the Computational Mind will also be of interest to those studying computational models in related subjects such as psychology, neuroscience, and computer science. (shrink)

This essay is intended to be a systematic exposition and critique of Daniel Dennett's general views. It is divided into three main sections. In section 1 we raise the question of the nature of a plausible scientific psychology, and suggest that the question of whether folk psychology will serve as an adequate scientific psychology is of special relevance in a discussion of Dennett. We then characterize folk psychology briefly. We suggest that Dennett's views have undergone at least one major change, (...) and proceed to discuss both his earlier and his later views. In section 2 we suggest that Dennett is correctly perceived as an instrumentalist in his earlier works. We think that Dennett later abandons this position because of general worries about instrumentalism and, more importantly, because Dennett became convinced that an instrumentalist conception of folk psychology will not enable us to vindicate the notions of personhood, moral agency, and responsibility. This left Dennett with a dilemma. On the one hand, he does not think that beliefs, etc., will turn out to be genuine scientific posits. On the other hand, he thinks that moral agency would be impossible if we could not treat beliefs, etc. as causally efficacious in some suitable sense. In section 3 we discuss Dennett's resolution of this dilemma. The key to his current view, we suggest, is the illata-abstracta distinction. Dennett holds that both illata and abstracta are real and have causal powers, even though only illata are genuine scientific posits. He suggests that beliefs etc. are abstracta, and are the subject matter of what he calls 'intentional system theory'. The subject matter of another theory, what Dennett calls 'subpersonal cognitive psychology', are illata, which are subpersonal intentional states. The important point is that this distinction lets Dennett have it both ways: (i) Since beliefs are mere abstracta, we need not commit ourselves to the thesis that beliefs will turn out to be posits of an adequate scientific psychology. (ii) Since beliefs have causal power, we are assured of moral and rational agency. We shall argue that Dennett's current view is untenable. If we are right in our arguments, then Dennett's program to produce a scientifically plausible psychology, one that will turn out to vindicate folk psychology (in some suitable sense), is a failure. It fails in the following important ways: (i) What Dennett sketches -- intentional system theory cum subpersonal cognitive psychology -- is not a plausible scientific psychology. (ii) As a consequence, Dennett also fails to provide a satisfactory foundation for moral and rational agency. (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)

The main claim of this paper is that notions of implementation based on an isomorphic correspondence between physical and computational states are not tenable. Rather, ``implementation'' has to be based on the notion of ``bisimulation'' in order to be able to block unwanted implementation results and incorporate intuitions from computational practice. A formal definition of implementation is suggested, which satisfies theoretical and practical requirements and may also be used to make the functionalist notion of ``physical realization'' precise. The upshot of (...) this new definition of implementation is that implementation cannot distinguish isomorphic bisimilar from non-isomporphic bisimilar systems anymore, thus driving a wedge between the notions of causal and computational complexity. While computationalism does not seem to be affected by this result, the consequences for functionalism are not clear and need further investigations. (shrink)

The main claim of this paper is that notions of implementation based on an isomorphic correspondence between physical and computational states are not tenable. Rather, ``implementation'' has to be based on the notion of ``bisimulation'' in order to be able to block unwanted implementation results and incorporate intuitions from computational practice. A formal definition of implementation is suggested, which satisfies theoretical and practical requirements and may also be used to make the functionalist notion of ``physical realization'' precise. The upshot of (...) this new definition of implementation is that implementation cannot distinguish isomorphic bisimilar from non-isomporphic bisimilar systems anymore, thus driving a wedge between the notions of causal and computational complexity. While computationalism does not seem to be affected by this result, the consequences for functionalism are not clear and need further investigations. (shrink)

The relationship between abstract formal procedures and the activities of actual physical systems has proved to be surprisingly subtle and controversial, and there are a number of competing accounts of when a physical system can be properly said to implement a mathematical formalism and hence perform a computation. I defend an account wherein computational descriptions of physical systems are high-level normative interpretations motivated by our pragmatic concerns. Furthermore, the criteria of utility and success vary according to our diverse purposes and (...) pragmatic goals. Hence there is no independent or uniform fact to the matter, and I advance the ‘anti-realist’ conclusion that computational descriptions of physical systems are not founded upon deep ontological distinctions, but rather upon interest-relative human conventions. Hence physical computation is a ‘conventional’ rather than a ‘natural’ kind. (shrink)

We begin by distinguishing computationalism from a number of other theses that are sometimes conflated with it. We also distinguish between several important kinds of computation: computation in a generic sense, digital computation, and analog computation. Then, we defend a weak version of computationalism—neural processes are computations in the generic sense. After that, we reject on empirical grounds the common assimilation of neural computation to either analog or digital computation, concluding that neural computation is sui generis. Analog computation requires continuous (...) signals; digital computation requires strings of digits. But current neuroscientific evidence indicates that typical neural signals, such as spike trains, are graded like continuous signals but are constituted by discrete functional elements (spikes); thus, typical neural signals are neither continuous signals nor strings of digits. It follows that neural computation is sui generis. Finally, we highlight three important consequences of a proper understanding of neural computation for the theory of cognition. First, understanding neural computation requires a specially designed mathematical theory (or theories) rather than the mathematical theories of analog or digital computation. Second, several popular views about neural computation turn out to be incorrect. Third, computational theories of cognition that rely on non-neural notions of computation ought to be replaced or reinterpreted in terms of neural computation. (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)

The aim of this paper is to offer a formal criterion for physical computation that allows us to objectively distinguish between competing computational interpretations of a physical system. The criterion construes a computational interpretation as an ordered pair of functions mapping (1) states of a physical system to states of an abstract machine, and (2) inputs to this machine to interventions in this physical system. This interpretation must ensure that counterfactuals true of the abstract machine have appropriate counterparts which are (...) true of the physical system. The criterion proposes that rival interpretations be assessed on the basis of simplicity. Simplicity is construed as the Kolmogorov complexity of the interpretation. This approach is closely related to the notion of algorithmic information distance and draws on earlier work on real patterns. (shrink)

We analyse Hutto & Myin's three arguments against computationalism [Hutto, D., E. Myin, A. Peeters, and F. Zahnoun. Forthcoming. “The Cognitive Basis of Computation: Putting Computation In Its Place.” In The Routledge Handbook of the Computational Mind, edited by M. Sprevak, and M. Colombo. London: Routledge.; Hutto, D., and E. Myin. 2012. Radicalizing Enactivism: Basic Minds Without Content. Cambridge, MA: MIT Press; Hutto, D., and E. Myin. 2017. Evolving Enactivism: Basic Minds Meet Content. Cambridge, MA: MIT Press]. The Hard Problem (...) of Content targets computationalism that relies on semantic notion of computation, claiming that it cannot account for the natural origins of content. The Intentionality Problem is targeted against computationalism using non-semantic accounts of computation, arguing that it fails in explaining intentionality. Theion Problem claims that causal interaction between concrete physical processes and abstract computational properties is problematic. We argue that these a... (shrink)

The first use of the term "information" to describe the content of nervous impulse occurs 20 years prior to Shannon`s (1948) work, in Edgar Adrian`s The Basis of Sensation (1928). Although, at least throughout the 1920s and early 30s, the term "information" does not appear in Adrian`s scientific writings to describe the content of nervous impulse, the notion that the structure of nervous impulse constitutes a type of message subject to certain constraints plays an important role in all of his (...) writings throughout the period. The appearance of the concept of information in Adrian`s work raises at least two important questions: (i) what were the relevant factors that motivated Adrian`s use of the concept of information? (ii) What concept of information does Adrian appeal to, and how can it be situated in relation to contemporary philosophical accounts of the notion of information in biology? The first question involves an account of the application of communications technology in neurobiology as well as the historical and scientific background of Adrian`s major scientific achievement, which was the recording of the action potential of a single sensory neuron. The response to the second question involves an explication of Adrian`s concept of information and an evaluation of how it may be situated in relation to more contemporary philosophical explications of a semantic concept of information. I suggest that Adrian`s concept of information places limitations on the sorts of systems that are referred to as information carriers by causal and functional accounts of information. (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)

Through the use of such "folk" concepts as belief, desire, intention, and expectation, Daniel Dennett asserts in this first full scale presentation of...

In what sense are the activities and properties of components in a mechanism explanatorily relevant to the behavior of a mechanism as a whole? I articulate this problem, the problem of constitutive relevance, and I show that it must be solved if we are to understand mechanisms and mechanistic explanation. I argue against some putative solutions to the problem of constitutive relevance, and I sketch a positive account according to which relevance is analyzed in terms ofrelationships of mutual manipulability between (...) the behavior of a mechanism as a whole and the properties and activities of its components. My account is a causal-mechanical account in the sense that it is a particular expression of the idea that constitutive explanation is a matter of showing how an explanandum phenomenon is situated within the causal structure of the world. It is thus offered as a rival to epistemic (argument-centered) and psychological accounts of interlevel explanation. (shrink)

In what sense are the activities and properties of components in a mechanism explanatorily relevant to the behavior of a mechanism as a whole? I articulate this problem, the problem of constitutive relevance, and I show that it must be solved if we are to understand mechanisms and mechanistic explanation. I argue against some putative solutions to the problem of constitutive relevance, and I sketch a positive account according to which relevance is analyzed in terms ofrelationships of mutual manipulability between (...) the behavior of a mechanism as a whole and the properties and activities of its components. My account is a causal-mechanical account in the sense that it is a particular expression of the idea that constitutive explanation is a matter of showing how an explanandum phenomenon is situated within the causal structure of the world. It is thus offered as a rival to epistemic (argument-centered) and psychological accounts of interlevel explanation. (shrink)

Some have suggested that there is no fact to the matter as to whether or not a particular physical system relaizes a particular computational description. This suggestion has been taken to imply that computational states are not real, and cannot, for example, provide a foundation for the cognitive sciences. In particular, Putnam has argued that every ordinary open physical system realizes every abstract finite automaton, implying that the fact that a particular computational characterization applies to a physical system does not (...) tell oneanything about the nature of that system. Putnam''s argument is scrutinized, and found inadequate because, among other things, it employs a notion of causation that is too weak. I argue that if one''s view of computation involves embeddedness (inputs and outputs) and full causality, one can avoid the universal realizability results. Therefore, the fact that a particular system realizes a particular automaton is not a vacuous one, and is often explanatory. Furthermore, I claim that computation would not necessarily be an explanatorily vacuous notion even if it were universally realizable. (shrink)

Some have suggested that there is no fact to the matter as to whether or not a particular physical system relaizes a particular computational description. This suggestion has been taken to imply that computational states are not real, and cannot, for example, provide a foundation for the cognitive sciences. In particular, Putnam has argued that every ordinary open physical system realizes every abstract finite automaton, implying that the fact that a particular computational characterization applies to a physical system does not (...) tell oneanything about the nature of that system. Putnam''s argument is scrutinized, and found inadequate because, among other things, it employs a notion of causation that is too weak. I argue that if one''s view of computation involves embeddedness (inputs and outputs) and full causality, one can avoid the universal realizability results. Therefore, the fact that a particular system realizes a particular automaton is not a vacuous one, and is often explanatory. Furthermore, I claim that computation would not necessarily be an explanatorily vacuous notion even if it were universally realizable. (shrink)

To clarify the notion of computation and its role in cognitive science, we need an account of implementation, the nexus between abstract computations and physical systems. I provide such an account, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure of the computation. The account is developed for the class of combinatorial-state automata, but is sufficiently general to cover all other discrete computational formalisms. The implementation relation is (...) non-vacuous, so that criticisms by Searle and others fail. This account of computation can be extended to justify the foundational role of computation in artificial intelligence and cognitive science. (shrink)

We provide an explicit taxonomy of legitimate kinds of abstraction within constitutive explanation. We argue that abstraction is an inherent aspect of adequate mechanistic explanation. Mechanistic explanations—even ideally complete ones—typically involve many kinds of abstraction and therefore do not require maximal detail. Some kinds of abstraction play the ontic role of identifying the specific complex components, subsets of causal powers, and organizational relations that produce a suitably general phenomenon. Therefore, abstract constitutive explanations are both legitimate and mechanistic.

Since Hilary Putnam offered multiple realization as an empirical hypothesis in the 1960s, philosophical consensus has turned against the idea that mental processes are identifiable with brain processes, and multiple realization has become the keystone of the 'antireductive consensus' across philosophy of science. Thomas W. Polger and Lawrence A. Shapiro offer the first book-length investigation of multiple realization, which serves as a starting point to a series of philosophically sophisticated and empirically informed arguments that cast doubt on the generality of (...) multiple realization in the cognitive sciences. They argue that mind-brain identities have played an important role in the growth and achievements of the cognitive sciences, and suggest that there is little prospect for multiple realization in an empirically-based theory of mind. This leads Polger and Shapiro to offer an alternative framework for understanding explanations in the cognitive sciences, as well as in chemistry, biology, and other non-basic sciences. (shrink)

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

In the book, I argue that the mind can be explained computationally because it is itself computational—whether it engages in mental arithmetic, parses natural language, or processes the auditory signals that allow us to experience music. All these capacities arise from complex information-processing operations of the mind. By analyzing the state of the art in cognitive science, I develop an account of computational explanation used to explain the capacities in question.

This systematic investigation of computation and mental phenomena by a noted psychologist and computer scientist argues that cognition is a form of computation, that the semantic contents of mental states are encoded in the same general way as computer representations are encoded. It is a rich and sustained investigation of the assumptions underlying the directions cognitive science research is taking. 1 The Explanatory Vocabulary of Cognition 2 The Explanatory Role of Representations 3 The Relevance of Computation 4 The Psychological Reality (...) of Programs: Strong Equivalence 5 Constraining Functional Architecture 6 The Bridge from Physical to Symbolic: Transduction 7 Functional Architecture and Analogue Processes 8 Mental Imagery and Functional Architecture 9 Epilogue: What is Cognitive Science the Science of? (shrink)

Introduction: Something on the State of the Art 1 I. Functionalism and Realism 1. Operationalism and Ordinary Language 35 2. The Appeal to Tacit Knowledge in Psychological Explanations 63 3. What Psychological States are Not 79 4. Three Cheers for Propositional Attitudes 100 II. Reduction and Unity of Science 5. Special Sciences 127 6. Computation and Reduction 146 III. Intensionality and Mental Representation 7. Propositional Attitudes 177 8. Tom Swift and His Procedural Grandmother 204 9. Methodological Solipsism Considered as a (...) Research Strategy in Cognitive Psychology 225 IV. Nativism 10. The Present Status of the Innateness Controversy 257 Notes 317. (shrink)

Much of computational cognitive science construes human cognitive capacities as representational capacities, or as involving representation in some way. Computational theories of vision, for example, typically posit structures that represent edges in the distal scene. Neurons are often said to represent elements of their receptive fields. Despite the ubiquity of representational talk in computational theorizing there is surprisingly little consensus about how such claims are to be understood. The point of this chapter is to sketch an account of the nature (...) and function of representation in computational cognitive models. (shrink)

Computation is central to the foundations of modern cognitive science, but its role is controversial. Questions about computation abound: What is it for a physical system to implement a computation? Is computation sufficient for thought? What is the role of computation in a theory of cognition? What is the relation between different sorts of computational theory, such as connectionism and symbolic computation? In this paper I develop a systematic framework that addresses all of these questions. Justifying the role of computation (...) requires analysis of implementation, the nexus between abstract computations and concrete physical systems. I give such an analysis, based on the idea that a system implements a computation if the causal structure of the system mirrors the formal structure of the computation. This account can be used to justify the central commitments of artificial intelligence and computational cognitive science: the thesis of computational sufficiency, which holds that the right kind of computational structure suffices for the possession of a mind, and the thesis of computational explanation, which holds that computation provides a general framework for the explanation of cognitive processes. The theses are consequences of the facts that (a) computation can specify general patterns of causal organization, and (b) mentality is an organizational invariant, rooted in such patterns. Along the way I answer various challenges to the computationalist position, such as those put forward by Searle. I close by advocating a kind of minimal computationalism, compatible with a very wide variety of empirical approaches to the mind. This allows computation to serve as a true foundation for cognitive science. (shrink)

The purpose of this paper is to argue against the claim that morphological computation is substantially different from other kinds of physical computation. I show that some (but not all) purported cases of morphological computation do not count as specifically computational, and that those that do are solely physical computational systems. These latter cases are not, however, specific enough: all computational systems, not only morphological ones, may (and sometimes should) be studied in various ways, including their energy efficiency, cost, reliability, (...) and durability. Second, I critically analyze the notion of “offloading” computation to the morphology of an agent or robot, by showing that, literally, computation is sometimes not offloaded but simply avoided. Third, I point out that while the morphology of any agent is indicative of the environment that it is adapted to, or informative about that environment, it does not follow that every agent has access to its morphology as the model of its environment. (shrink)