Humans constantly produce strings of characters in symbolic languages, e.g., sentences in natural languages. We show that for any given moment in human history, the set of character strings that have been produced up to that moment, i.e., the sum total of human symbolic output up to that moment, is finite and so Turing computable. We then prove a much stronger result: a Turing machine can produce any particular set of symbolic output that we could possibly have produced. We then (...) discuss metaphysical and/or theological systems, e.g., Spinoza’s, Leibniz’s, or Aquinas’s. We argue that any particular metaphysical system could be the output of a Turing machine. We then briefly discuss (i) automated theorem proving, the attempt to generate and/or prove theorems using computers, and (ii) computational metaphysics, the attempt to apply methods from computer science such as automated theorem proving to metaphysics. We conclude by arguing that: (i) computational metaphysics can succeed, at least in theory; indeed, all human metaphysical reasoning could be automated; (ii) computational metaphysics – and indeed metaphysical systems in general – will have the same limitations as Turing machines; and (iii) a number of different methods – not currently used in computational metaphysics – could be used to advance metaphysical research. (shrink)

While the essays on this web site, taken together, explain most of the essentials of my metaphysical system, some material is not covered, and the different essays take quite different approaches. The essays were mostly written for undergraduate and graduate courses in philosophy at the University of Toronto and York University. Thus, each essay is slanted to the issues that were addressed in whatever course it was written for. However, I hope soon to pull all this material together into a (...) cohesive, single work that will explain my system more fully and with more focus, which will serve as my Ph.D. dissertation. In the meantime this brief overview gives the broad picture of what my philosophical system is, and how the various essays on these pages are inter-related. For those who do not wish to read through this entire page, the Quantum Phenomenology essay is probably the one you should read if you only have time to read one, as it is the closest to being comprehensive. (shrink)

Introduces 'Turing Worlds' as a device for thinking about Metaphysical Problems and uses them to examine several different theories of counter-factuals.

In this paper, the authors describe their initial investigations in computational metaphysics. Our method is to implement axiomatic metaphysics in an automated reasoning system. In this paper, we describe what we have discovered when the theory of abstract objects is implemented in PROVER9 (a first-order automated reasoning system which is the successor to OTTER). After reviewing the second-order, axiomatic theory of abstract objects, we show (1) how to represent a fragment of that theory in PROVER9's first-order syntax, (...) and (2) how PROVER9 then finds proofs of interesting theorems of metaphysics, such as that every possible world is maximal. We conclude the paper by discussing some issues for further research. (shrink)

The many worlds anthropic principle is explored here from the a priori perspective of rationalist metaphysics, within the framework of modal logic. It is shown how the apparent contradictions of quantum superposition can be thought of in terms of different levels of world models. The framework of modal logic is used, but given the rationalist assumption that all possible worlds exist. There is thus no absolute distinction between possibility and necessity. To take the point of view of a conscious (...) being in a world, however, is to adopt some such distinction--something we must do in order to do physics. This paper is intended to lay the groundwork for future attempts to develop theories of what is necessarily true in a world with conscious entities. It also contains some tentative speculations on the difficult issue of death and quantum mechanics. (shrink)

Computational philosophy is the use of mechanized computational techniques to unearth philosophical insights that are either difficult or impossible to find using traditional philosophical methods. Computational metaphysics is computational philosophy with a focus on metaphysics. In this paper, we (a) develop results in modal metaphysics whose discovery was computer assisted, and (b) conclude that these results work not only to the obvious benefit of philosophy but also, less obviously, to the benefit of computer (...) science, since the new computational techniques that led to these results may be more broadly applicable within computer science. The paper includes a description of our background methodology and how it evolved, and a discussion of our new results. (shrink)

Computer models and simulations have provided enormous benefits to researchers in the natural and social sciences, as well as many areas of philosophy. However, to date, there has been little attempt to use computer models in the development and evaluation of metaphysical theories. This is a shame, as there are good reasons for believing that metaphysics could benefit just as much from this practice as other disciplines. In this paper I assess the possibilities and limitations of using computer models (...) in metaphysics. I outline the way in which different kinds of model could be useful for different areas of metaphysics, and I illustrate in more detail how agent-based models specifically could be used to model two well-known theories of laws: David Lewis’s "Best System Account" and David Armstrong's "Nomic Necessitation" view. Some logically possible processes cannot be simulated on a standard computing device. I finish by assessing how much of a threat this is to the prospect of metaphysical modeling in general. (shrink)

We build on some of Daniel Dennett’s ideas about predictive indispensability to characterize properties of video games discernable by people as computationally emergent if, and only if: (1) they can be instantiated by a computing machine, and (2) there is no algorithm for detecting instantiations of them. We then use this conception of emergence to provide support to the aesthetic ideas of Stanley Fish and to illuminate some aspects of the Chomskyan program in cognitive science.

The central motivating idea behind the development of this work is the concept of prespace, a hypothetical structure that is postulated by some physicists to underlie the fabric of space or space-time. I consider how such a structure could relate to space and space-time, and the rest of reality as we know it, and the implications of the existence of this structure for quantum theory. Understanding how this structure could relate to space and to the rest of reality requires, I (...) believe, that we consider how space itself relates to reality, and how other so-called "spaces" used in physics relate to reality. In chapter 2, I compare space and space-time to other spaces used in physics, such as configuration space, phase space and Hilbert space. I support what is known as the "property view" of space, opposing both the traditional views of space and space-time, substantivalism and relationism. I argue that all these spaces are property spaces. After examining the relationships of these spaces to causality, I argue that configuration space has, due to its role in quantum mechanics, a special status in the microscopic world similar to the status of position space in the macroscopic world. In chapter 3, prespace itself is considered. One way of approaching this structure is through the comparison of the prespace structure with a computational system, in particular to a cellular automaton, in which space or space-time and all other physical quantities are broken down into discrete units. I suggest that one way open for a prespace metaphysics can be found if physics is made fully discrete in this way. I suggest as a heuristic principle that the physical laws of our world are such that the computational cost of implementing those laws on an arbitrary computational system is minimized, adapting a heuristic principle of this type proposed by Feynman. In chapter 4, some of the ideas of the previous chapters are applied in an examination of the physics and metaphysics of quantum theory. I first discuss the "measurement problem" of quantum mechanics: this problem and its proposed solution are the primary subjects of chapter 4. It turns out that considering how quantum theory could be made fully discrete leads naturally to a suggestion of how standard linear quantum mechanics could be modified to give rise to a solution to the measurement problem. The computational heuristic principle reinforces the same solution. I call the modified quantum mechanics Critical Complexity Quantum Mechanics (CCQM). I compare CCQM with some of the other proposed solutions to the measurement problem, in particular the spontaneous localization model of Ghirardi, Rimini and Weber. Finally, in chapters 5 and 6, I argue that the measure of complexity of quantum mechanical states I introduce in CCQM also provides a new definition of entropy for quantum mechanics, and suggests a solution to the problem of providing an objective foundation for statistical mechanics, thermodynamics, and the arrow of time. (shrink)

It has been argued that ethically correct robots should be able to reason about right and wrong. In order to do so, they must have a set of do’s and don’ts at their disposal. However, such a list may be inconsistent, incomplete or otherwise unsatisfactory, depending on the reasoning principles that one employs. For this reason, it might be desirable if robots were to some extent able to reason about their own reasoning—in other words, if they had some meta-ethical capacities. (...) In this paper, we sketch how one might go about designing robots that have such capacities. We show that the field of computational meta-ethics can profit from the same tools as have been used in computational metaphysics. (shrink)

Computers may help us to better understand (not just verify) arguments. In this article we defend this claim by showcasing the application of a new, computer-assisted interpretive method to an exemplary natural-language ar- gument with strong ties to metaphysics and religion: E. J. Lowe’s modern variant of St. Anselm’s ontological argument for the existence of God. Our new method, which we call computational hermeneutics, has been particularly conceived for use in interactive-automated proof assistants. It aims at shedding light (...) on the meanings of words and sentences by framing their inferential role in a given argument. By employing automated theorem reasoning technology within interactive proof assistants, we are able to drastically reduce (by several orders of magnitude) the time needed to test the logical validity of an argu- ment’s formalization. As a result, a new approach to logical analysis, inspired by Donald Davidson’s account of radical interpretation, has been enabled. In computational hermeneutics, the utilization of automated reasoning tools ef- fectively boosts our capacity to expose the assumptions we indirectly commit ourselves to every time we engage in rational argumentation and it fosters the explicitation and revision of our concepts and commitments. (shrink)

Shanahan’s eloquently argued version of the global workspace theory fits well into the emerging understanding of consciousness as a computational phenomenon. His disinclination toward metaphysics notwithstanding, Shanahan’s book can also be seen as supportive of a particular metaphysical stance on consciousness — the computational identity theory.

Although implementation is ubiquitous in computer science, there is no systematic philosophical analysis of its metaphysical structure. In this article, I argue that the conceptual resources of analytical metaphysics can be very helpful in laying the foundations for a metaphysics of implementation and, by extension, of computer science. More specifically, I hold that implementation is a form of metaphysical grounding, and I show that, by combining the properties of grounding with the specific constraints of computer science, one can (...) clarify what a metaphysics of computer science could look like. In sections 2 and 3 of the article, I discuss various meanings of implementation, while in section 4, I submit my central claim that implementation is a form of metaphysical grounding. I substantiate this claim by showing that implementation and grounding share the same formal properties. If this is correct, then issues of ontological dependence, metaphysical explanation, hyperintensionality, and foundedness, typically associated with grounding, can be re-formulated in computer science using the concept of implementation. This is what I do in sections 5.1-5.4. I conclude with some general remarks about the future development of computer science's metaphysics. (shrink)

We present a computer-supported approach for the logical analysis and conceptual explicitation of argumentative discourse. Computational hermeneutics harnesses recent progresses in automated reasoning for higher-order logics and aims at formalizing natural-language argumentative discourse using flexible combinations of expressive non-classical logics. In doing so, it allows us to render explicit the tacit conceptualizations implicit in argumentative discursive practices. Our approach operates on networks of structured arguments and is iterative and two-layered. At one layer we search for logically correct formalizations for (...) each of the individual arguments. At the next layer we select among those correct formalizations the ones which honor the argument’s dialectic role, i.e. attacking or supporting other arguments as intended. We operate at these two layers in parallel and continuously rate sentences’ formalizations by using, primarily, inferential adequacy criteria. An interpretive, logical theory will thus gradually evolve. This theory is composed of meaning postulates serving as explications for concepts playing a role in the analyzed arguments. Such a recursive, iterative approach to interpretation does justice to the inherent circularity of understanding: the whole is understood compositionally on the basis of its parts, while each part is understood only in the context of the whole. We summarily discuss previous work on exemplary applications of human-in-the-loop computational hermeneutics in metaphysical discourse. We also discuss some of the main challenges involved in fully-automating our approach. By sketching some design ideas and reviewing relevant technologies, we argue for the technological feasibility of a highly-automated computational hermeneutics. (shrink)

Computer models provide formal techniques that are highly relevant to philosophical issues in epistemology, metaphysics, and ethics. Such models can help philosophers to address both descriptive issues about how people do think and normative issues about how people can think better. The use of computer models in ways similar to their scientific applications substantially extends philosophical methodology beyond the techniques of thought experiments and abstract reflection. For formal philosophy, computer models offer a much broader range of representational techniques than (...) are found in traditional logic, probability, and set theory, taking into account the important roles of imagery, analogy, and emotion in human thinking. Computer models make possible investigation of the dynamics of inference, not just abstract formal relations. (shrink)

We examine a case in which non-computable behavior in a model is revealed by computer simulation. This is possible due to differing notions of computability for sets in a continuous space. The argument originally given for the validity of the simulation involves a simpler simulation of the simulation, still further simulations thereof, and a universality conjecture. There are difficulties with that argument, but there are other, heuristic arguments supporting the qualitative results. It is urged, using this example, that absolute validation, (...) while highly desirable, is overvalued. Simulations also provide valuable insights that we cannot yet (if ever) prove. (shrink)

More than a decade ago, philosopher John Searle started a long-running controversy with his paper “Minds, Brains, and Programs” (Searle, 1980a), an attack on the ambitious claims of artificial intelligence (AI). With his now famous _Chinese Room_ argument, Searle claimed to show that despite the best efforts of AI researchers, a computer could never recreate such vital properties of human mentality as intentionality, subjectivity, and understanding. The AI research program is based on the underlying assumption that all important aspects of (...) human cognition may in principle be captured in a computational model. This assumption stems from the belief that beyond a certain level, implementational details are irrelevant to cognition. According to this belief, neurons, and biological wetware in general, have no preferred status as the substrate for a mind. As it happens, the best examples of minds we have at present have arisen from a carbon-based substrate, but this is due to constraints of evolution and possibly historical accidents, rather than to an absolute metaphysical necessity. As a result of this belief, many cognitive scientists have chosen to focus not on the biological substrate of the mind, but instead on the abstract causal structure_ _that the mind embodies (at an appropriate level of abstraction). The view that it is abstract causal structure that is essential to mentality has been an implicit assumption of the AI research program since Turing (1950), but was first articulated explicitly, in various forms, by Putnam (1960), Armstrong (1970) and Lewis (1970), and has become known as _functionalism_. From here, it is a very short step to _computationalism_, the view that computational structure is what is important in capturing the essence of mentality. This step follows from a belief that any abstract causal structure can be captured computationally: a belief made plausible by the Church–Turing Thesis, which articulates the power. (shrink)

To be an agent, one must be able to formulate intentions. To be able to formulate intentions, one must have a first-person perspective. Computers lack a first-person perspective. So, computers are not agents.

Only computational explanations of a content‐involving sort can answer certain ‘how’‐questions; can support content‐involving counterfactuals; and have the generality characteristic of psychological explanations. Purely formal characteriza‐tions of computations have none of these properties, and do not determine content. These points apply not only to psychological explanation, but to Turing machines themselves. Computational explanations which involve content are not opposed to naturalism. They are also required if we are to explain the content‐involving properties of mental states.

The role of content in computational accounts of cognition is a matter of some controversy. An early prominent view held that the explanatory relevance of content consists in its supervenience on the the formal properties of computational states (see, e.g., Fodor 1980). For reasons that derive from the familiar Twin Earth thought experiments, it is usually thought that if content is to supervene on formal properties, it must be narrow; that is, it must not be the sort of (...) content that determines reference and truth-conditions. An interesting alternative to this view has recently been proposed by Egan (1995). According to Egan, the explanatory role of content is such that contents must in general be broad to be explanatorily relevant. But Egan’s view involves a non-realist interpretation of content assignments. I will argue here that this non-realism about contents is undermotivated. A realist variation on her view of the explanatory role of content, however, would survive this criticism. This realist variation, I suggest, shares with the views of other commentators on Marr’s theory (e.g., Burge 1986; Shapiro 1993; forthcoming) certain commitments concerning the supervenience base of visual contents and processes. I will argue, however, that these commitments beg important questions regarding the individuation of cognitive states and processes. I conclude, contrary to Burge and Shapiro, that Marr’s theory does not favor anti-individualism. (shrink)

The relation between computational and intentional psychology has always been a vexing issue. The worry is that if mental processes are computational, then these processes, which are defined over symbols, are sensitive solely to the non-semantic properties of symbols. If so, perhaps psychology could dispense with adverting in its laws to intentional/semantic properties of symbols. Stich, as is well-known, has made a great deal out of this tension and argued for a purely "syntactic" psychology by driving a wedge (...) between a semantic individuation of symbol tokens and their narrow functional individuation. If the latter can be carried out, he claimed, we do not need semantic typing. I argue that since a narrow functional individuation cannot type-identify symbol tokens across organisms, a semantic account of typing must be the only option given that interpersonal physical individuation of tokens is not to be taken seriously. (shrink)

Extract from Hofstadter's revew in Bulletin of American Mathematical Society : http://www.ams.org/journals/bull/1980-02-02/S0273-0979-1980-14752-7/S0273-0979-1980-14752-7.pdf -/- "Aaron Sloman is a man who is convinced that most philosophers and many other students of mind are in dire need of being convinced that there has been a revolution in that field happening right under their noses, and that they had better quickly inform themselves. The revolution is called "Artificial Intelligence" (Al)-and Sloman attempts to impart to others the "enlighten- ment" which he clearly regrets not having (...) experienced earlier himself. Being somewhat of a convert, Sloman is a zealous campaigner for his point of view. Now a Reader in Cognitive Science at Sussex, he began his academic career in more orthodox philosophy and, by exposure to linguistics and AI, came to feel that all approaches to mind which ignore AI are missing the boat. I agree with him, and I am glad that he has written this provocative book. The tone of Sloman's book can be gotten across by this quotation (p. 5): "I am prepared to go so far as to say that within a few years, if there remain any philosophers who are not familiar with some of the main developments in artificial intelligence, it will be fair to accuse them of professional incom- petence, and that to teach courses in philosophy of mind, epistemology, aesthetics, philosophy of science, philosophy of language, ethics, metaphysics, and other main areas of philosophy, without discussing the relevant aspects of artificial intelligence will be as irresponsible as giving a degree course in physics which includes no quantum theory." -/- (The author now regrets the extreme polemical tone of the book.). (shrink)

A number of recent discussions comparing computer simulation and traditional experimentation have focused on the significance of “materiality.” I challenge several claims emerging from this work and suggest that computer simulation studies are material experiments in a straightforward sense. After discussing some of the implications of this material status for the epistemology of computer simulation, I consider the extent to which materiality (in a particular sense) is important when it comes to making justified inferences about target systems on the basis (...) of experimental results. (shrink)

Currently, there is widespread skepticism that higher cognitive processes, given their apparent flexibility and globality, could be carried out by specialized computational devices, or modules. This skepticism is largely due to Fodor’s influential definition of modularity. From the rather flexible catalogue of possible modular features that Fodor originally proposed has emerged a widely held notion of modules as rigid, informationally encapsulated devices that accept highly local inputs and whose opera- tions are insensitive to context. It is a mistake, however, (...) to equate such features with computational devices in general and therefore to assume, as Fodor does, that higher cognitive processes must be non-computational. Of the many possible non-Fodorean architectures, one is explored here that offers possible solutions to computational problems faced by conventional modular systems: an ‘enzymatic’ architecture. Enzymes are computational devices that use lock-and-key template matching to iden- tify relevant information (substrates), which is then operated upon and returned to a common pool for possible processing by other devices. Highly specialized enzymes can operate together in a common pool of information that is not pre-sorted by information type. Moreover, enzymes can use molecular ‘tags’ to regulate the operations of other devices and to change how particular substrates are construed and operated upon, allowing for highly interactive, context-specific processing. This model shows how specialized, modular processing can occur in an open system, and suggests that skepti- cism about modularity may largely be due to failure to consider alternatives to the standard model. (shrink)

Intentionalism must be distinguished from computational psychology. The former is a mentalist-realist metatheoretical stance vis-a-vis the latter, which is a research programme devoted to the construction of informationally-characterized simulation models for human behavior, perception, cognition, etc. Intentionalism has its attractive aspects, but unfortunately it is plagued by severe conceptual difficulties. Recent attempts to justify the intentionalist interpretation of computational models, by J.A. Fodor and by C. Graves, J.J. Katz et al., fail to secure a conceptually adequate and genuinely (...) intentional sense for the intentional idiom they employ. (shrink)

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

This article explores some of the ways in which the conceptual apparatus of A Thousand Plateaus, and especially its machinic metaphysics, can be connected to recent developments in computer modelling and social simulation, which provide new tools for thinking that are becoming increasingly popular among philosophers and social scientists. Conversely, the successful deployment of these tools provides warrant for the flat ontology articulated in A Thousand Plateaus and therefore contributes to the ‘reversal of Platonism’ for which Deleuze had called (...) in his earlier works, such as Logic of Sense. The first major section offers a brief exposition of some key concepts in A Thousand Plateaus in order to set the stage for the second and third major sections, which argue that the fabrication of a metaphysics of immanence can be accelerated by connecting its conceptual apparatus more explicitly to insights derived from philosophical analyses of computational modelling and simulation and the social scientific use of ‘assemblage theory’. The article concludes with a summary of the argument and a brief consideration of some of the potential ethical and political implications of this interdisciplinary engagement. (shrink)

How might philosophy of religion be impacted by developments in computational modeling and social simulation? After briefly describing some of the content and context biases that have shaped traditional philosophy of religion, this article provides examples of computational models that illustrate the explanatory power of conceptually clear and empirically validated causal architectures informed by the bio-cultural sciences. It also outlines some of the material implications of these developments for broader metaphysical and metaethical discussions in philosophy. Computer modeling and (...) simulation can contribute to the reformation of the philosophy of religion in at least three ways: by facilitating conceptual clarity about the role of biases in the emergence and maintenance of phenomena commonly deemed “religious,” by supplying tools that enhance our capacity to link philosophical analysis and synthesis to empirical data in the psychological and social sciences, and by providing material insights for metaphysical hypotheses and metaethical proposals that rely solely on immanent resources. (shrink)

Eco-cognitive computationalism considers computation in context, following some of the main tenets advanced by the recent cognitive science views on embodied, situated, and distributed cognition. It is in the framework of this eco-cognitive perspective that we can usefully analyze the recent attention in computer science devoted to the importance of the simplification of cognitive and motor tasks caused in organic entities by the morphological features: ignorant bodies can be domesticated to become useful “mimetic bodies”, that is able to render an (...) intertwined computation simpler, resorting to that “simplexity” of animal embodied cognition, which represents one of the main quality of organic agents. Through eco-cognitive computationalism we can clearly acknowledge that the concept of computation changes, depending on historical and contextual causes, and we can build an epistemological view that illustrates the “emergence” of new kinds of computations, such as the one regarding morphological computation. This new perspective shows how the computational domestication of ignorant entities can originate new unconventional cognitive embodiments. In the last part of the article I will introduce the concept of overcomputationalism, showing that my proposed framework helps us see the related concepts of pancognitivism, paniformationalism, and pancomputationalism in a more naturalized and prudent perspective, avoiding the excess of old-fashioned ontological or metaphysical overstatements. (shrink)

Intelligent design advocate William Dembski has introduced a measure of information called “complex specified information”, or CSI. He claims that CSI is a reliable marker of design by intelligent agents. He puts forth a “Law of Conservation of Information” which states that chance and natural laws are incapable of generating CSI. In particular, CSI cannot be generated by evolutionary computation. Dembski asserts that CSI is present in intelligent causes and in the flagellum of Escherichia coli, and concludes that neither have (...) natural explanations. In this paper, we examine Dembski’s claims, point out significant errors in his reasoning, and conclude that there is no reason to accept his assertions. (shrink)

In philosophical logic and metaphysics there is a long-standing debate around the most appropriate structures to represent indeterministic scenarios concerning the future. We reconstruct here such a debate in a computational setting, focusing on the fundamental difference between moment-based and history-based structures. Our presentation is centered around two versions of an indeterministic scenario in which a programmer wants a machine to perform a given task at some point after a specified time. One of the two versions includes an (...) assumption about the future behaviour of the machine that cannot be encoded in any programming instruction; such version has models over history-based structures but no model over a moment-based structure. Therefore, our work adds a new stance to the debate: moment-based structures can be said to rule out certain indeterministic scenarios that are computationally unfeasible. (shrink)

The paper criticizes standard functionalist arguments for multiple realization. It focuses on arguments in which psychological states are conceived as computational, which is precisely where the multiple realization doctrine has seemed the strongest. It is argued that a type-type identity thesis between computational states and physical states is no less plausible than a multiple realization thesis. The paper also presents, more tentatively, positive arguments for a picture of local reduction.

As a discipline, psychiatry is in the process of finding the right set of concepts to organize research and guide treatment. Dissatisfaction with the status quo as expressed in standard manuals has animated a number of computational paradigms, each proposing to rectify the received concept of mental disorder. We explore how different computational paradigms: normative modeling, network theory and learning-theoretic approaches like reinforcement learning and active inference, reconceptualize mental disorders. Although each paradigm borrows heavily from machine learning, they (...) differ significantly in their methodology, their preferred level of description, the role they assign to the environment and, especially, the degree to which they aim to assimilate psychiatric disorders to a standard medical disease model. By imagining how these paradigms might evolve, we bring into focus three rather different visions for the future of psychiatric research. Although machine learning plays a crucial role in the articulation of these paradigms, it is clear that we are far from automating the process of conceptual revision. The leading role continues to be played by the theoretical, metaphysical and methodological commitments of the competing paradigms. (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)

According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should – in principle – be able to reduce the descriptions and explanations of special sciences to physical ones, for example, explaining biological regularities, via chemistry, by the laws of particle physics. The multiple realization of the property types of the special sciences is often seen to be an obstacle to such epistemic reductions. Here, we introduce another, new argument against (...) epistemic reduction. Based on mathematical complexity, we show that, under certain conditions, there can be “complexity barriers” that make epistemic reduction – in principle – unachievable even if physicalism were true. (shrink)

Examining one of the fundamental issues in cognitive psychology: How does our conscious experience come to be the way it is?

Computational philosophy is the use of mechanized computational techniques to instantiate, extend, and amplify philosophical research. Computational philosophy is not philosophy of computers or computational techniques; it is rather philosophy using computers and computational techniques. The idea is simply to apply advances in computer technology and techniques to advance discovery, exploration and argument within any philosophical area. -/- After touching on historical precursors, this article discusses contemporary computational philosophy across a variety of fields: epistemology, (...) metaphysics, philosophy of science, ethics and social philosophy, philosophy of language and philosophy of mind, often with examples of operating software. Far short of any attempt at an exhaustive treatment, the intention is to introduce the spirit of each application by using some representative examples. (shrink)

In this paper we consider persuasion in the context of practical reasoning, and discuss the problems associated with construing reasoning about actions in a manner similar to reasoning about beliefs. We propose a perspective on practical reasoning as presumptive justification of a course of action, along with critical questions of this justification, building on the account of Walton. From this perspective, we articulate an interaction protocol, which we call PARMA, for dialogues over proposed actions based on this theory. We outline (...) an axiomatic semantics for the PARMA Protocol, and discuss two implementations which use this protocol to mediate a discussion between humans. We then show how our proposal can be made computational within the framework of agents based on the Belief-Desire-Intention model, and illustrate this proposal with an example debate within a multi agent system. (shrink)

In this paper I review some leading developments in the empirical theory of affect. I argue that (1) affect is a distinct perceptual representation governed system, and (2) that there are significant modular factors in affect. The paper concludes with the observation thatfeeler (affective perceptual system) may be a natural kind within cognitive science. The main purpose of the paper is to explore some hitherto unappreciated connections between the theory of affect and the computational theory of mind.

Modeling and computer simulations, we claim, should be considered core philosophical methods. More precisely, we will defend two theses. First, philosophers should use simulations for many of the same reasons we currently use thought experiments. In fact, simulations are superior to thought experiments in achieving some philosophical goals. Second, devising and coding computational models instill good philosophical habits of mind. Throughout the paper, we respond to the often implicit objection that computer modeling is “not philosophical.”.