El concepto de trastorno mental permite justificar intervenciones médicas, psicológicas y judiciales. Además, facilita a la/el consultante acceder a tratamientos mediante reembolsos o programas de salud pública, y por otro lado, podría conllevar estereotipos sociales. No obstante, el significado de dicho concepto no ha dejado de suscitar debate. En el presente artículo argumentaré que los trastornos de personalidad, tal como son definidos en el DSM-5, no cumplen con los criterios de patología de las propuestas principales (i.e. teoría bio-estadística de la (...) salud, disfunción dañina, o entidad patológica) debido a tres razones independientes: (i) no se han propuesto dis/funciones a la base de cada trastorno y, dado el estado del arte de la psicología evolucionista, es poco probable que se pueda llevar a cabo ese programa en el futuro; (ii) el concepto de daño (distrés, perjuicio) aplicable a los trastornos de personalidad es constitutivamente social (aunque no exclusivamente social), por lo que resulta más adecuado hablar de grados de discapacidad que de trastornos del individuo; y (iii) que la ausencia de condiciones patognomónicas para cada trastorno, junto a la elevada comorbilidad y multimorbilidad entre trastornos de personalidad, horada la validez de la nosología actual y de los diagnósticos diferenciales. Propondré como solución la eliminación de los trastornos de personalidad de la nosología psiquiátrica. Eliminar los trastornos de personalidad no equivale a desconocer el sufrimiento de las personas diagnosticadas, ni a ignorar que dicho sufrimiento precede a, –y no acaba con la disolución de– la etiqueta diagnóstica. Por ello, se propondrá una reconceptualización de dicho sufrimiento en términos de discapacidad, entendida desde el modelo social, y que no presupone patología. (shrink)

Multiple realizability says that the same kind of mental states may be manifested by systems with very different physical constitutions. Putnam ( 1967 ) supposed it to be “overwhelmingly probable” that there exist psychological properties with different physical realizations in different creatures. But because function constrains possible physical realizers, this empirical bet is far less favorable than it might initially have seemed, especially when we take on board the richer picture of neural and brain function that neuroscience has been uncovering (...) over the past forty years, in which all sorts of brain activities play crucial roles beyond all-or-nothing electrical signaling. Because of its evolutionary history, the brain’s metabolic and informational processes are inextricably intertwined. The resulting complex integrated functions impose more constraints on possible realizers than the clean, single-purpose functions usually cited as examples in discussions of multiple realizability—with ramifications for the functionalist and computationalist foundations of cognitive science, artificial intelligence, and the philosophy of mind. (shrink)

To account for the explanatory role representations play in cognitive science, Egan’s deflationary account introduces a distinction between cognitive and mathematical contents. According to that account, only the latter are genuine explanatory posits of cognitive-scientific theories, as they represent the arguments and values cognitive devices need to represent to compute. Here, I argue that the deflationary account suffers from two important problems, whose roots trace back to the introduction of mathematical contents. First, I will argue that mathematical contents do not (...) satisfy important and widely accepted desiderata all theories of content are called to satisfy, such as content determinacy and naturalism. Secondly, I will claim that there are cases in which mathematical contents cannot play the explanatory role the deflationary account claims they play, proposing an empirical counterexample. Lastly, I will conclude the paper highlighting two important implications of my arguments, concerning recent theoretical proposals to naturalize representations via physical computation, and the popular predictive processing theory of cognition. (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)

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

The counterfactual account of physical computation is simple and, for the most part, very attractive. However, it is usually thought to trivialize the notion of physical computation insofar as it implies ‘limited pancomputationalism’, this being the doctrine that every deterministic physical system computes some function. Should we bite the bullet and accept limited pancomputationalism, or reject the counterfactual account as untenable? Jack Copeland would have us do neither of the above. He attempts to thread a path between the two horns (...) of the dilemma by buttressing the counterfactual account with extra conditions intended to block certain classes of deterministic physical systems from qualifying as physical computers. His theory is called the ‘algorithm execution account’. Here we show that the algorithm execution account entails limited pancomputationalism, despite Copeland’s argument to the contrary. We suggest, partly on this basis, that the counterfactual account should be accepted as it stands, pancomputationalist warts and all. (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 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)

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)

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)

In this paper I defend a pluralistic approach in understanding function, both in biological and other contexts. Talks about function are ubiquitous and crucial in biology, and it might be the key to bridge the “manifest image” and the “scientific image” identified by Sellars (1962). However, analysis of function has proven to be extremely difficult. The major puzzle is to make sense of “time-reversed causality”: how can property P be the cause of its realizer R? For example, “pumping blood” is (...) a property of hearts, but a property of hearts cannot be the cause of the presence of hearts, since properties cannot predate their realizers and be causes of them. In section 2 I discuss Wright’s etiological analysis, Cummins’ causal-role analysis, and their critics. In section 3 I defend a version of the “consensus without unity” strategy proposed by Godfrey-Smith from Christopher Boorse’s recent critique (2002). In Section 4 I conclude by reflecting on the relation between functional discourses and physicalism. (shrink)

In discussing the famous case of Otto, a patient with Alzheimer’s disease who carries around a notebook to keep important information, Clark and Chalmers argue that some of Otto’s beliefs are physically realized in the notebook. In other words, some of Otto’s beliefs are extended into the environment. Their main argument is a functionalist one. Some of Otto’s beliefs are physically realized in the notebook because, first, some of the beliefs of Inga, a healthy person who remembers important information in (...) her head, are physically realized in her internal memory storage, and, second, there is no relevant functional difference between the role of the notebook for Otto and the role of the internal memory storage for Inga. The paper presents a new objection to this argument. I call it “the systems reply” to the functionalist argument since it is structurally analogous to the “the systems reply” to Searle’s Chinese room argument. According to the systems reply to the functionalist argument, what actually follows from their argument is not that beliefs of Otto are physically realized in the notebook but rather that the beliefs of the hybrid system consisting of Otto and his notebook are physically realized in the notebook. This paper also discusses Sprevak’s claim that the functionalist argument entails radical versions of extended mental states and shows that his argument is also vulnerable to the systems reply. (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 main message of the paper is that there is a disconnect between what many philosophers of mind think of as the scientific practice of reductive or reductionist explanation, and what the most relevant scientific work is actually like. I will sketch what I see as a better view, drawing on various ideas in recent philosophy of science. I then import these ideas into the philosophy of mind, to see what difference they make.1 At the end of the paper I (...) address a possible objection: the familiar package of ideas I reject in the philosophy of science should not be lightly discarded, because other popular views on fundamental issues depend on positions that I want to reject. I reply that those apparently attractive further ideas are not worth holding onto. (shrink)

Implementationalism maintains that conventional, silicon-based artificial systems are not conscious because they fail to satisfy certain substantive constraints on computational implementation. In this article, we argue that several recently proposed substantive constraints are implausible, or at least are not well-supported, insofar as they conflate intuitions about computational implementation generally and consciousness specifically. We argue instead that the mechanistic account of computation can explain several of the intuitions driving implementationalism and noncomputationalism in a manner which is consistent with artificial consciousness. Our (...) argument provides indirect support for computationalism about consciousness and the view that conventional artificial systems can be conscious. (shrink)

In this article, I argue that if tacit knowledge of grammar is analyzable in functional‐computational terms, then it cannot ground linguistic meaning, structure, or sound. If to know or cognize a grammar is to be in a certain computational state playing a certain functional role, there can be no unique grammar cognized. Satisfying the functional conditions for cognizing a grammar G entails satisfying those for cognizing many grammars disagreeing with G about expressions' semantic, phonetic, and syntactic values. This threatens the (...) Chomskyan view that expressions have such values for speakers because they cognize grammars assigning them those values. For if this is true, semantics, syntax, and phonology must be indeterminate, thanks to the indeterminacy of grammar‐cognizing (qua functional‐computational state). So, the fact that a speaker cognizes a grammar cannot explain the determinate character of their language. (shrink)

We present a novel reductive theory of type-identity physicalism, which is inspired by the foundations of statistical mechanics as a general theory of natural kinds. We show that all the claims mounted against type-identity physicalism in the literature don’t apply to Flat Physicalism, and moreover that this reductive theory solves many of the problems faced by the various non-reductive approaches including functionalism. In particular, we show that Flat Physicalism can account for the appearance of multiple realizability in the special sciences, (...) and that it gives a novel account of the genuine autonomy of the kinds and laws in the special sciences. We further show that the thesis of genuine multiple realization, which is compatible with all forms of non-reductive approaches including functionalism, implies what we call token-dualism; namely the idea that in every token there are non-physical facts, which may either be non-physical properties or some non-physical substance. In other words, we prove that non-reductive kinds necessarily assume non-reductive tokens, i.e., token dualism. Finally, we show that all forms of non-reductive approaches including functionalism imply a literally multi-leveled structure of reality. (shrink)

I examine the abstraction/representation theory of computation put forward by Horsman et al., connecting it to the broader notion of modeling, and in particular, model-based explanation, as considered by Rosen. I argue that the ‘representational entities’ it depends on cannot themselves be computational, and that, in particular, their representational capacities cannot be realized by computational means, and must remain explanatorily opaque to them. I then propose that representation might be realized by subjective experience (qualia), through being the bearer of the (...) structure of abstract objects that are represented. (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)

Cognitive science has been beset for thirty years by foundational disputes about the nature and extension of cognition—e.g. whether cognition is necessarily representational, whether cognitive processes extend outside the brain or body, and whether plants or microbes have them. Whereas previous philosophical work aimed to settle these disputes, I aim to understand what conception of cognition scientists could share given that they disagree so fundamentally. To this end, I develop a number of variations on traditional conceptual explication, and defend a (...) novel explication of cognition called the sensitive management hypothesis. -/- Since expert judgments about the extension of “cognition” vary so much, I argue that there is value in explication that accurately models the variance in judgments rather than taking sides or treating that variance as noise. I say of explications that accomplish this that they are ecumenically extensionally adequate. Thus, rather than adjudicating whether, say, plants can have cognitive processes like humans, an ecumenically adequate explication should classify these cases differently: human cognitive processes as paradigmatically cognitive, and plant processes as controversially cognitive. -/- I achieve ecumenical adequacy by articulating conceptual explications with parameters, or terms that can be assigned a number of distinct interpretations based on the background commitments of participants in a discourse. For example, an explication might require that cognition cause “behavior,” and imply that plant processes are cognitive or not depending on whether anything plants do can be considered “behavior.” Parameterization provides a unified treatment of embattled concepts by isolating topics of disagreement in a small number of parameters. -/- I incorporate these innovations into an account on which cognition is the “sensitive management of organismal behavior.” The sensitive management hypothesis is ecumenically extensionally adequate, accurately classifying a broad variety of cases as paradigmatically or controversially cognitive phenomena. I also describe an extremely permissive version of the sensitive management hypothesis, arguing that it has the potential to explain several features of cognitive scientific discourse, including various facts about the way cognitive scientists ascribe representations to cognitive systems. (shrink)

Philosophy and Literature is an internationally renowned refereed journal founded by Denis Dutton at the University of Canterbury, Christchurch. It is now published by the Johns Hopkins University Press. Since its inception in 1976, Philosophy and Literature has been concerned with the relation between literary and philosophical studies, publishing articles on the philosophical interpretation of literature as well as the literary treatment of philosophy. Philosophy and Literature has sometimes been regarded as iconoclastic, in the sense that it repudiates academic pretensions, (...) insidious jargon and institutional vogue. Dutton, who remains the editor, still writes a regular column. A distinctive feature of Philosophy and Literature was the annual Bad Writing Contest, held from 1995–98, which sought to identify (and publish) the ‘most stylistically lamentable passages’ of academic prose, often to great amusement. (shrink)

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

This paper guides the reader through the use of functions in contemporary legal philosophy: in developing those philosophies and through methodological debates over their proper role. This paper is broken into two sections. In the first I canvass the role of functions in the legal philosophies of several mid to late twentieth century Anglo-American general jurisprudents whose theories are still common topics of discussion: Ronald Dworkin, H.L.A. Hart, Lon L. Fuller, John Finnis, and Joseph Raz. In the second, I examine (...) contemporary arguments over the role of functions in the methodology of legal philosophy. (shrink)

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

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

Functionalism has become one of the predominant theories in the philosophy of mind, with its many merits supposedly including its capacity for precise formulation. The most common method to express this precise formulation is by means of the modified Ramsey sentence. In this article, I will apply work from the field of the philosophy of science to functionalism for the first time, examining how Newman’s objection undermines the Ramsey sentence as a means of formalising functionalism. I will also present a (...) formal variation on Newman’s objection through mathematical induction. Together, these proofs suggest that functionalism formalised by the Ramsey sentence trivially reduces to a kind of behaviourism plus a cardinality constraint on the number of relations holding between mental-relevant behaviours. As most functionalists see functionalism as a distinct theory of mind from behaviourism, this suggests that the modified Ramsey sentence cannot form a satisfactory formalism for functionalism. (shrink)

I propose a physicalist theory of consciousness that is an extension of the theory of noémona species. The proposed theory covers the full consciousness spectrum from animal to machine and its huma...

Representationalist accounts of mental content face the threat of the homunculus fallacy. In collapsing the distinction between the conscious state and the conscious subject, self-representational accounts of consciousness possess the means to deal with this objection. We analyze a particular sort of self-representational theory, built on the work of John von Neumann on self-reproduction, using tools from mathematical logic. We provide an explicit theory of the emergence of referential beliefs by means of modal fixed points, grounded in intrinsic properties yielding (...) the subjective aspects of experience. Furthermore, we study complications introduced by allowing for the modification of such symbolic content by environmental influences. (shrink)

What does it take to implement a computer? Answers to this question have often focused on what it takes for a physical system to implement an abstract machine. As Joslin observes, this approach neglects cases of software implementation—cases where one machine implements another by running a program. These cases, Joslin argues, highlight serious problems for mapping accounts of computer implementation—accounts that require a mapping between elements of a physical system and elements of an abstract machine. The source of these problems (...) is the complexity introduced by common design features of ordinary computers, features that would be relevant to any real-world software implementation. While Joslin is focused on contemporary views, his discussion also suggests a counterexample to recent mapping accounts which hold that genuine implementation requires simple mappings. In this paper, I begin by clarifying the nature of software implementation and disentangling it from closely related phenomena like emulation and simulation. Next, I argue that Joslin overstates the degree of complexity involved in his target cases and that these cases may actually give us reasons to favor simplicity-based criteria over relevant alternatives. Finally, I propose a novel problem for simplicity-based criteria and suggest a tentative solution. (shrink)

According to contemporary computational neuroscience the mental is associated with computations implemented in the brain. We analyze in physical terms based on recent results in the foundations of statistical mechanics two well-known (independent) problems that arise for this approach: the problem of multiple-computations and the problem of multiple-realization. We show that within the computational theory of the mind the two problems are insoluble by the physics of the brain. We further show that attempts to solve the problems by the interactions (...) of the systems implementing the computations with an environment (in or outside the brain) must introduce non- physical factors, and therefore fail on physical grounds. We also show that the problems are endemic and pertain to other forms of functional theories of the mind, most notably, causal functionalism. Finally, we propose a physicalist reductive identity theory, which is a generalization of statistical mechanics for all the special sciences, and show that only a theory of this kind can provide physical solutions to the above two problems in computational neuroscience. We conclude that functionalism in the theory of mind must be replaced with a reductive identity theory. This result has far-reaching implications with respect to the research programs in brain science. (shrink)

We show that the so-called Multiple-Computations Theorem in cognitive science and philosophy of mind challenges Landauer’s Principle in physics. Since the orthodox wisdom in statistical physics is that Landauer’s Principle is implied by, or is the mechanical equivalent of, the Second Law of thermodynamics, our argument shows that the Multiple-Computations Theorem challenges the universal validity of the Second Law of thermodynamics itself. We construct two examples of computations carried out by one and the same dynamical process with respect to which (...) Landauer’s principle implies contradictory predictions concerning the entropy increase. Our two examples are based on a weak version of the Multiple-Computations Theorem, which is quite uncontroversial, and therefore they amount to a clear refutation of the universal validity of Landauer’s Principle. We consider some responses to this argument that do not attempt to single out one computation over the others, and we show that they do not work. We further consider ways out of the argument by externalist approaches supporting the computational theory of the mind who propose that the interaction of a computing system with the environment is enough to select a single computation over the others. We show on physical grounds that this approach fails too. We then reverse the direction of our challenge and formulate a dilemma for supporters of the computational theory of the mind: they must reject the causal closure of physic; or else they must accept on a priori grounds that Landauer’s Principle and the Second Law of thermodynamics are not universally valid. Finally, we present our version of a type–type mind-brain identity theory called Flat Physicalism, which is based on the paradigm case of statistical mechanics, and we show that it circumvents the challenge from Landauer’s Principle and the Multiple-Computations Theorem and does not fall prey to our dilemma. (shrink)

Many philosophical accounts of scientific models fail to distinguish between a simulation model and other forms of models. This failure is unfortunate because there are important differences pertaining to their methodology and epistemology that favor their philosophical understanding. The core claim presented here is that simulation models are rich and complex units of analysis in their own right, that they depart from known forms of scientific models in significant ways, and that a proper understanding of the type of model simulations (...) are fundamental for their philosophical assessment. I argue that simulation models can be distinguished from other forms of models by the many algorithmic structures, representation relations, and new semantic connections involved in their architecture. In this article, I reconstruct a general architecture for a simulation model, one that faithfully captures the complexities involved in most scientific research with computer simulations. Furthermore, I submit that a new methodology capable of conforming such architecture into a fully functional, computationally tractable computer simulation must be in place. I discuss this methodology—what I call recasting—and argue for its philosophical novelty. If these efforts are heading towards the right interpretation of simulation models, then one can show that computer simulations shed new light on the philosophy of science. To illustrate the potential of my interpretation of simulation models, I briefly discuss simulation-based explanations as a novel approach to questions about scientific explanation. (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)

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)