This paper argues that at least one of the following propositions is true: the human species is very likely to go extinct before reaching a "posthuman" stage; any posthuman civilization is extremely unlikely to run a significant number of simulations of their evolutionary history ; we are almost certainly living in a computer simulation. It follows that the belief that there is a significant chance that we will one day become posthumans who run ancestor-simulations is false, unless we are currently (...) living in a simulation. A number of other consequences of this result are also discussed. (shrink)

There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.

Defending or attacking either functionalism or computationalism requires clarity on what they amount to and what evidence counts for or against them. My goal here is not to evaluate their plausibility. My goal is to formulate them and their relationship clearly enough that we can determine which type of evidence is relevant to them. I aim to dispel some sources of confusion that surround functionalism and computationalism, recruit recent philosophical work on mechanisms and computation to shed light on them, and (...) clarify how functionalism and computationalism may or may not legitimately come together. (shrink)

What is the computational notion of “implementation”? It is not individuation, instantiation, reduction, or supervenience. It is, I suggest, semantic interpretation.

I argue that at least one of the following propositions is true: the human species is very likely to become extinct before reaching a ’posthuman’ stage; any posthuman civilization is extremely unlikely to run a significant number of simulations of its evolutionary history ; we are almost certainly living in a computer simulation. It follows that the belief that there is a significant chance that we shall one day become posthumans who run ancestor-simulations is false, unless we are currently living (...) in a simulation. I discuss some consequences of this result. (shrink)

NOW IN PAPERBACK"€"Starting from a collection of simple computer experiments"€"illustrated in the book by striking computer graphics"€"Stephen Wolfram shows how their unexpected results force a whole new way of looking at the operation of our universe.

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...) semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

The account that Edelman gives in this book is accessible, yet unified and rigorous, and the big picture he presents is supported by evidence ranging from ...

According to pancomputationalism, everything is a computing system. In this paper, I distinguish between different varieties of pancomputationalism. I find that although some varieties are more plausible than others, only the strongest variety is relevant to the philosophy of mind, but only the most trivial varieties are true. As a side effect of this exercise, I offer a clarified distinction between computational modelling and computational explanation.<br><br>.

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)

This paper argues that at least one of the following propositions is true: (1) the human species is very likely to go extinct before reaching a “posthuman” stage; (2) any posthuman civilization is extremely unlikely to run a significant number of simulations of their evolutionary history (or variations thereof); (3) we are almost certainly living in a computer simulation. It follows that the belief that there is a significant chance that we will one day become posthumans who run ancestor-simulations is (...) false, unless we are currently living in a simulation. A number of other consequences of this result are also discussed. (shrink)

It is widely believed that shapes are intrinsic properties. But this claim is hard to defend. I survey all known theories of shape properties, and argue that each theory is either incompatible with the claim that shapes are intrinsic, or can be shown to be false.

Something could be round even if it were the only thing in the universe, unaccompanied by anything distinct from itself. Jaegwon Kim once suggested that we define an intrinsic property as one that can belong to something unaccompanied. Wrong: unaccompaniment itself is not intrinsic, yet it can belong to something unaccompanied. But there is a better Kim-style definition. Say that P is independent of accompaniment iff four different cases are possible: something accompanied may have P or lack P, something unaccompanied (...) may have P or lack P. P is basic intrinsic iff (1) P and not-P are nondisjunctive and contingent, and (2) P is independent of accompaniment. Two things (actual or possible) are duplicates iff they have exactly the same basic intrinsic properties. P is intrinsic iff no two duplicates differ with respect to P. (shrink)

We propose that the isomorphism generally observed between the representations composing our momentary phenomenal experience and the structure of the world is the end-product of a progressive organization that emerges thanks to elementary associative processes that take our conscious representations themselves as the stuff on which they operate, a thesis that we summarize in the concept of Self-Organizing Consciousness (SOC). Key Words: Associative learning; automatism; consciousness; development; implicit learning; incubation; language; mental representation; perception; phenomenal experience.

Despite its significance in neuroscience and computation, McCulloch and Pitts's celebrated 1943 paper has received little historical and philosophical attention. In 1943 there already existed a lively community of biophysicists doing mathematical work on neural networks. What was novel in McCulloch and Pitts's paper was their use of logic and computation to understand neural, and thus mental, activity. McCulloch and Pitts's contributions included (i) a formalism whose refinement and generalization led to the notion of finite automata (an important formalism in (...) computability theory), (ii) a technique that inspired the notion of logic design (a fundamental part of modern computer design), (iii) the first use of computation to address the mind–body problem, and (iv) the first modern computational theory of mind and brain. (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)

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)

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)

According to the computational theory of mind (CTM), mental capacities are explained by inner computations, which in biological organisms are realized in the brain. Computational explanation is so popular and entrenched that it’s common for scientists and philosophers to assume CTM without argument.

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.\**.

This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are discussed, and (...) a prototype natural-language-understanding system is presented as an illustration. (shrink)

The title of The Rediscovery of the Mind suggests the question "When was the mind lost?" Since most people may not be aware that it ever was lost, we must also then ask "Who lost it?" It was lost, of course, only by philosophers, by certain philosophers. This passed unnoticed by society at large. The "rediscovery" is also likely to pass unnoticed. But has the mind been rediscovered by the same philosophers who "lost" it? Probably not. John Searle is an (...) analytic philosopher, with some of the same notions as the positivists and behaviorists who rejected consciousness and "lost" the mind in the first place, but he also does not sound like the kind of reductionist who would have joined that crowd. His views, indeed, are sensible enough, and some of his insights so important, that it is a shame to find his thought profoundly limited by some of the same mistakes and prejudices that ruined philosophy, and not just philosophy of mind, under the influence of those positivists and behaviorists. There is enough of genuine value in his treatment, that it can easily be taken up and, with relatively slight modification, added to what is of permanent value in the history of philosophy. (shrink)

One of the world’s leading philosophers offers aspiring thinkers his personal trove of mind-stretching thought experiments. Over a storied career, Daniel C. Dennett has engaged questions about science and the workings of the mind. His answers have combined rigorous argument with strong empirical grounding. And a lot of fun. Intuition Pumps and Other Tools for Thinking offers seventy-seven of Dennett’s most successful "imagination-extenders and focus-holders" meant to guide you through some of life’s most treacherous subject matter: evolution, meaning, mind, and (...) free will. With patience and wit, Dennett deftly deploys his thinking tools to gain traction on these thorny issues while offering readers insight into how and why each tool was built. Alongside well-known favorites like Occam’s Razor and reductio ad absurdum lie thrilling descriptions of Dennett’s own creations: Trapped in the Robot Control Room, Beware of the Prime Mammal, and The Wandering Two-Bitser. Ranging across disciplines as diverse as psychology, biology, computer science, and physics, Dennett’s tools embrace in equal measure light-heartedness and accessibility as they welcome uninitiated and seasoned readers alike. As always, his goal remains to teach you how to "think reliably and even gracefully about really hard questions." A sweeping work of intellectual seriousness that’s also studded with impish delights, Intuition Pumps offers intrepid thinkers—in all walks of life—delicious opportunities to explore their pet ideas with new powers. (shrink)

Under the banner of "hypercomputat ion" various claims are being made for the feasibility of modes of computation that go beyond what is permitted by Turing computability. In this article it will be shown that such claims fly in the face of the inability of all currently accepted physical theories to deal with infinite precision real numbers. When the claims are viewed critically, it is seen that they amount to little more than the obvious comment that if non-computable inputs are (...) permitted, then non-computable outputs are attainable. (shrink)

An e-mail discussion can be rendered into print in several ways. Rather than trying to imitate a genuine conversation, this is a personal essay containing comments and replies by the other contributors. Most of the substantial points made in the e-mail discussion are contained here, although not always in the order they happened.

This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. (...) I argue that Bold Physical CT is not relevant to the epistemological concerns that motivate CT and hence not suitable as a physical analog of Mathematical CT. The correct physical analog of Mathematical CT is Modest Physical CT. I propose to explicate the notion of physical computability in terms of a usability constraint, according to which for a process to count as relevant to Physical CT, it must be usable by a finite observer to obtain the desired values of a function. Finally, I suggest that proposed counterexamples to Physical CT are still far from falsifying it because they have not been shown to satisfy the usability constraint. (shrink)

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

A survey of contemporary philosophical and scientific literatures reveals that different authors employ the term ‘heuristic’ in ways that deviate from, and are sometimes inconsistent with, one another. Given its widespread use in philosophy and cognitive science generally, it is striking that there appears to be little concern for a clear account of what phenomena heuristics pick out or refer to. In response, I consider several accounts of ‘heuristic’, and I draw a number of distinctions between different sorts of heuristics (...) in order to make sense of various research programmes. I then develop a working characterization of ‘heuristic’ which is shown to be coherent and robust enough to serve as a kind within philosophy and cognitive science broadly. My intent is not to pursue a unified account of ‘heuristic’, but to highlight some features of certain kinds of heuristics that are important for theorizing about cognition in order to proceed with a science of the mind/brain. 1 Why We Need an Appropriate Characterization of ‘Heuristic’2 Inadequate Definitions2.1 A positive attempt2.2 Heuristics versus guaranteed correct outcomes3 A Taxonomy of Heuristics3.1 Stimulus-driven versus heuristic3.2 Perceptual versus cognitive heuristics3.3 Computational versus cognitive heuristics3.4 Methodological versus inferential heuristics3.5 Summary of distinctions4 Characterizing Cognitive Heuristics4.1 Heuristics as rules of thumb4.2 Beyond rules of thumb: exploiting information5 Concluding Remarks. (shrink)

We discuss mathematical and physical arguments against continuity and in favor of discreteness, with particular emphasis on the ideas of Émile Borel.

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)

An e-mail discussion can be rendered into print in several ways. Rather than trying to imitate a genuine conversation, this is a personal essay containing comments and replies by the other contributors. Most of the substantial points made in the e-mail discussion are contained here, although not always in the order they happened.

A survey of the field of hypercomputation, including discussion of a variety of objections.

According to some philosophers, computational explanation is proprietary
to psychology—it does not belong in neuroscience. But neuroscientists routinely offer computational explanations of cognitive phenomena. In fact, computational explanation was initially imported from computability theory into the science of mind by neuroscientists, who justified this move on neurophysiological grounds. Establishing the legitimacy and importance of computational explanation in neuroscience is one thing; shedding light on it is another. I raise some philosophical questions pertaining to computational explanation and outline some promising answers that (...) are being developed by a number of authors. (shrink)

What is computer-science about? CS is obviously the science of computers. But what exactly are computers? We know that there are physical computers, and, perhaps, also abstract computers. Let us limit the discussion here to physical entities and ask: What are physical computers? What does it mean for a physical entity to be a computer? The answer, it seems, is that physical computers are physical dynamical systems that implement formal entities such as Turing-machines. I do not think that this answer (...) is false. But it invites another, and troubling, question: What distinguishes computers from other physical dynamical systems? The difficulty is that, on the one hand, every physical system im-plements abstract formal entities such as sets of differential equations, while on the other hand we certainly do not want to count every dynamical system as a computer. After all, if CS is somehow distinctive, then there must be a difference between computers and other systems such as solar systems, stomachs, and carburetors. But what is the difference? (shrink)

I argue that neural activity, strictly speaking, is not computation. This is because computation, strictly speaking, is the processing of strings of symbols, and neuroscience shows that there are no neural strings of symbols. This has two consequences. On the one hand, the following widely held consequences of computationalism must either be abandoned or supported on grounds independent of computationalism: (i) that in principle we can capture what is functionally relevant to neural processes in terms of some formalism taken from (...) computability theory (such as Turing Machines), (ii) that it is possible to design computer programs that are functionally equivalent to neural processes in the same sense in which it is possible to design computer programs that are functionally equivalent to each other, (iii) that the study of neural (or mental) computation is independent of the study of neural implementation, (iv) that the Church-Turing thesis applies to neural activity in the sense in which it applies to digital computers. On the other hand, we need to gradually reinterpret or replace computational theories in psychology in terms of theoretical constructs that can be realized by known neural processes, such as the spike trains of neuronal ensembles. (shrink)