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)

To compute is to execute an algorithm. More precisely, to say that a device or organ computes is to say that there exists a modelling relationship of a certain kind between it and a formal specification of an algorithm and supporting architecture. The key issue is to delimit the phrase of a certain kind. I call this the problem of distinguishing between standard and nonstandard models of computation. The successful drawing of this distinction guards Turing's 1936 analysis of computation against (...) a difficulty that has persistently been raised against it, and undercuts various objections that have been made to the computational theory of mind. (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 computation can specify general patterns of causal organization, and 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)

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)

It is argued that a number of important, and seemingly disparate, types of representation are species of a single relation, here called structural representation, that can be described in detail and studied in a way that is of considerable philosophical interest. A structural representation depends on the existence of a common structure between a representation and that which it represents, and it is important because it allows us to reason directly about the representation in order to draw conclusions about the (...) phenomenon that it depicts. The present goal is to give a general and precise account of structural representation, then to use that account to illuminate several problems of current philosophical interest — including some that do not initially seem to involve representation at all. In particular, it is argued that ontological reductions (like that of the natural numbers to sets), compositional accounts of semantics, several important sorts of mental representation, and (perhaps) possible worlds semantics for intensional logics are all species of structural representation and are fruitfully studied in the framework developed here. (shrink)

A formal theory of quantity T Q is presented which is realist, Platonist, and syntactically second-order (while logically elementary), in contrast with the existing formal theories of quantity developed within the theory of measurement, which are empiricist, nominalist, and syntactically first-order (while logically non-elementary). T Q is shown to be formally and empirically adequate as a theory of quantity, and is argued to be scientifically superior to the existing first-order theories of quantity in that it does not depend upon empirically (...) unsupported assumptions concerning existence of physical objects (e.g. that any two actual objects have an actual sum). The theory T Q supports and illustrates a form of naturalistic Platonism, for which claims concerning the existence and properties of universals form part of natural science, and the distinction between accidental generalizations and laws of nature has a basis in the second-order structure of the world. (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)

Hilary Putnam has argued that computational functionalism cannot serve as a foundation for the study of the mind, as every ordinary open physical system implements every finite-state automaton. I argue that Putnam's argument fails, but that it points out the need for a better understanding of the bridge between the theory of computation and the theory of physical systems: the relation of implementation. It also raises questions about the class of automata that can serve as a basis for understanding the (...) mind. I develop an account of implementation, linked to an appropriate class of automata, such that the requirement that a system implement a given automaton places a very strong constraint on the system. This clears the way for computation to play a central role in the analysis of mind. (shrink)

In addition to his famous Chinese Room argument, John Searle has posed a more radical problem for views on which minds can be understood as programs. Even his wall, he claims, implements the WordStar program according to the standard definition of implementation because there is some ‘‘pattern of molecule movements’’ that is isomorphic to the formal structure of WordStar. Program implementation, Searle charges, is merely observer-relative and thus not an intrinsic feature of the world. I argue, first, that analogous charges (...) involving other concepts (motion and meaning) lead to consequences no one accepts. Second, I show that Searle’s treatment of computation is incoherent, yielding the consequence that nothing computes anything: even our standard personal computers fail to run any programs on this account. I propose an alternative account, one that accords with the way engineers, programmers, and cognitive scientists use the concept of computation in their empirical work. This alternative interpretation provides the basis of a philosophical analysis of program implementation, one that may yet be suitable for a computational theory of the mind. (shrink)

Part II: Suppes and the mature theory. Representation and uniqueness.

This paper concerns the ways in which one can/cannot combine extensive quantities. Given a particular theory of extensive measurement, there can be no alternative ways of combining extensive quantities, where 'alternative' means that one combining operation can be used instead of another causing only a change in the number assigned to the quantity. As a consequence, rectangular concatenation cannot be an alternative combining operation for length as was suggested by Ellis and agreed by Krantz, Luce, Suppes, and Tversky. I argue (...) as well that a theory which imposes such restrictions on the combining operation is more desirable than less stringent rival theories. (shrink)

There are different ways to present a Presidential Address to the APA; the one I have chosen is simply to report on work that I am doing right now, on work in progress. I am going to present some of my further explorations into the computational model of the mind.\**.

“Triviality arguments” against functionalism in the philosophy of mind hold that the claim that some complex physical system exhibits a given functional organization is either trivial or has much less content than is usually supposed. I survey several earlier arguments of this kind, and present a new one that overcomes some limitations in the earlier arguments. Resisting triviality arguments is possible, but requires functionalists to revise popular views about the “autonomy” of functional description.

Wittgenstein and Kripke disagree about the status of the proposition: the Standard Metre is one metre long. Wittgenstein believes it is necessary. Kripke argues that it is contingent. Kripke's argument depends crucially on a certain sort of thought‐experiment with which we are invited to test our intuitions about what is and isn’t necessary. In this paper I argue that, while Kripke's conclusion is strictly correct, nevertheless similar Kripke‐style thought experiments indicate that the metric system of measurement is after all relative (...) in something like the way Wittgenstein seems to think. Central to this paper is a thought‐experiment I call The Smedlium Case. (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)

The aim of this paper is to reconstruct the historical evolution of the so-called Measurement Theory. MT has two clearly different periods, the formation period and the mature theory, whose borderline coincides with the publication in 1951 of Suppes' foundational work, ‘A set of independent axioms for extensive quantities’. In this paper two previous research traditions on the foundations of measurement, developed during the formation period, come together in the appropriate way. These traditions correspond, on the one hand, to Helmholtz's, (...) Campbell's and Hölder's studies on axiomatics and real morphisms and, on the other, to the work undertaken by Stevens and his school on scale types and transformations. These two lines of research are complementary in the sense that neither of them is enough taken alone, but together they contain all that is necessary to develop the theory, and it is in Suppes that these complementary approaches converge and all the elements of the theory are appropriately integrated for the first time. With Suppes' work, then, begins what may be called the ‘mature’ theory, which was to develop rapidly later on, especially during the 1960s. Our historical reconstruction is divided into two parts, each part devoted to one of the periods mentioned. Part I also contains a conceptual introduction which aims to establish the use of some notions, specifically those of measurement and metrization. Although the reconstruction is not exhaustive, it intends to be quite complete and up to date compared to what is available in measurement literature; in this sense the aim of this paper is mainly historical but, although secondarily, it also attempts to make some conceptual and metascientific clarifications on the subject of the theory. (shrink)