A. M. Turing has bequeathed us a conceptulary including 'Turing, or Turing-Church, thesis', 'Turing machine', 'universal Turing machine', 'Turing test' and 'Turing structures', plus other unnamed achievements. These include a proof that any formal language adequate to express arithmetic contains undecidable formulas, as well as achievements in computer science, artificial intelligence, mathematics, biology, and cognitive science. Here it is argued that these achievements hang together and have prospered well in the 50 years since Turing's death.

Leibniz's overall view of the relationship between reasoning and computation is discussed on the basis of two broad claims that one finds in his writings, concerning respectively the nature of human reasoning and the possibility of replacing human thinking by a mechanical procedure. A joint examination of these claims enables one to appreciate the wide scope of Leibniz's interests for mechanical procedures, concerning a variety of philosophical themes further developed both in later logical investigations and in methodological contributions to cognitive (...) psychology. (shrink)

The significance of the plurality of the Copernican Revolution is the main thrust of this undergraduate text In this study of the Copernican Revolution, the ...

In this book Saul Kripke brings his powerful philosophical intelligence to bear on Wittgenstein's analysis of the notion of following a rule.

Discussion of Wittgenstein's philosophy has suffered from a scarcity of commentators who understand his work well enough to explain it in their own words. Apart from certain notable exceptions, all too many advocates and critics alike have tended merely to repeat slogans, with approval or ridicule as the case may be. The result has been an unusual degree of polarization and acrimony—some philosophers abandoning normal critical standards, falling under the spell and becoming fanatical supporters; and others taking an equally extreme (...) opposite view, deriding the absence of analytic technique, and refusing to see anything of value in Wittgenstein's work. (shrink)

The objective of research in the foundations of Al is to explore such basic questions as: What is a theory in Al? What are the most abstract assumptions underlying the competing visions of intelligence? What are the basic arguments for and against each assumption? In this essay I discuss five foundational issues: (1) Core Al is the study of conceptualization and should begin with knowledge level theories. (2) Cognition can be studied as a disembodied process without solving the symbol grounding (...) problem. (3) Cognition is nicely described in propositional terms. (4) We can study cognition separately from learning. (5) There is a single architecture underlying virtually all cognition. I explain what each of these implies and present arguments from both outside and inside Al why each has been seen as right or wrong. (shrink)

This paper explores Church's Thesis and related claims madeby Turing. Church's Thesis concerns computable numerical functions, whileTuring's claims concern both procedures for manipulating uninterpreted marksand machines that generate the results that these procedures would yield. Itis argued that Turing's claims are true, and that they support (the truth of)Church's Thesis. It is further argued that the truth of Turing's and Church'sTheses has no interesting consequences for human cognition or cognitiveabilities. The Theses don't even mean that computers can do as much (...) as peoplecan when it comes to carrying out effective procedures. For carrying out aprocedure is a purposive, intentional activity. No actual machine does, orcan do, as much. (shrink)

I develop a theory of counterfactuals about relative computability, i.e. counterfactuals such as 'If the validity problem were algorithmically decidable, then the halting problem would also be algorithmically decidable,' which is true, and 'If the validity problem were algorithmically decidable, then arithmetical truth would also be algorithmically decidable,' which is false. These counterfactuals are counterpossibles, i.e. they have metaphysically impossible antecedents. They thus pose a challenge to the orthodoxy about counterfactuals, which would treat them as uniformly true. What’s more, I (...) argue that these counterpossibles don’t just appear in the periphery of relative computability theory but instead they play an ineliminable role in the development of the theory. Finally, I present and discuss a model theory for these counterfactuals that is a straightforward extension of the familiar comparative similarity models. (shrink)

The author defends John R. Searle's Chinese Room argument against a particular objection made by William J. Rapaport called the Korean Room. Foundational issues such as the relationship of strong AI to human mentality and the adequacy of the Turing Test are discussed. Through undertaking a Gedankenexperiment similar to Searle's but which meets new specifications given by Rapaport for an AI system, the author argues that Rapaport's objection to Searle does not stand and that Rapaport's arguments seem convincing only because (...) they assume the foundations of strong AI at the outset. (shrink)

We examine the question of which aspects of language are uniquely human and uniquely linguistic in light of recent suggestions by Hauser, Chomsky, and Fitch that the only such aspect is syntactic recursion, the rest of language being either specific to humans but not to language (e.g. words and concepts) or not specific to humans (e.g. speech perception). We find the hypothesis problematic. It ignores the many aspects of grammar that are not recursive, such as phonology, morphology, case, agreement, and (...) many properties of words. It is inconsistent with the anatomy and neural control of the human vocal tract. And it is weakened by experiments suggesting that speech perception cannot be reduced to primate audition, that word learning cannot be reduced to fact learning, and that at least one gene involved in speech and language was evolutionarily selected in the human lineage but is not specific to recursion. The recursion-only claim, we suggest, is motivated by Chomsky’s recent approach to syntax, the Minimalist Program, which de-emphasizes the same aspects of language. The approach, however, is sufficiently problematic that it cannot be used to support claims about evolution. We contest related arguments that language is not an adaptation, namely that it is “perfect,” non-redundant, unusable in any partial form, and badly designed for.. (shrink)

Cognitive science normally takes the individual agent as its unit of analysis. In many human endeavors, however, the outcomes of interest are not determined entirely by the information processing properties of individuals. Nor can they be inferred from the properties of the individual agents, alone, no matter how detailed the knowledge of the properties of those individuals may be. In commercial aviation, for example, the successful completion of a flight is produced by a system that typically includes two or more (...) pilots interacting with each other and with a suite of technological devices. This article presents a theoretical framework that takes a distributed, socio‐technical system rather than an individual mind as its primary unit of analysis. This framework is explicitly cognitive in that it is concerned with how information is represented and how representations are transformed and propagated in the performance of tasks. An analysis of a memory task in the cockpit of a commercial airliner shows how the cognitive properties of such distributed systems can differ radically from the cognitive properties of the individuals who inhabit them. (shrink)

The aim of this paper is to evaluate etiological accounts of functions for the domain of technical artefacts. Etiological theories ascribe functions to items on the basis of the causal histories of those items; they apply relatively straightforwardly to the biological domain, in which neo‐Darwinian evolutionary theory provides a well‐developed and generally accepted background for describing the causal histories of biological items. Yet there is no well‐developed and generally accepted theory for describing the causal history of artefacts, so the application (...) of etiological theories to the technical domain is hardly straightforward. In this paper we consider the transposition of etiological theories in general from the biological to the technical domain. We argue that a number of etiological theories that appear defensible for biology become untenable for technology. We illustrate our argument by showing that the standard etiological accounts of Neander and Millikan, and some recent attempts to improve on them, provide examples of such untenable theories.1Introduction2Desiderata for theories of functions3Etiological theories in general3.1Common core and divergent aims3.2Reproduction versus non‐reproduction etiological theories3.3Intentionalist versus non‐intentionalist etiological theories4Problems for etiological theories in the technical domain5The failure of existing reproduction theories6The failure of existing non‐reproduction theories7Improving reproduction by hybridisation8Conclusions. (shrink)

A young scientist and mathematician explores the mystery and complexity of human thought processes from an interdisciplinary point of view.

The algorithm, a building block of computer science, is defined from an intuitive and pragmatic point of view, through a methodological lens of philosophy rather than that of formal computation. The treatment extracts properties of abstraction, control, structure, finiteness, effective mechanism, and imperativity, and intentional aspects of goal and preconditions. The focus on the algorithm as a robust conceptual object obviates issues of correctness and minimality. Neither the articulation of an algorithm nor the dynamic process constitute the algorithm itself. Analysis (...) for implications in computer science and philosophy reveals unexpected results, new questions, and new perspectives on current questions, including the relationship between our informally construed algorithms and Turing machines. Exploration in terms of current computational and philosophical thinking invites further developments. (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.

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.

Computation is interpretable symbol manipulation. Symbols are objects that are manipulated on the basis of rules operating only on theirshapes, which are arbitrary in relation to what they can be interpreted as meaning. Even if one accepts the Church/Turing Thesis that computation is unique, universal and very near omnipotent, not everything is a computer, because not everything can be given a systematic interpretation; and certainly everything can''t be givenevery systematic interpretation. But even after computers and computation have been successfully distinguished (...) from other kinds of things, mental states will not just be the implementations of the right symbol systems, because of the symbol grounding problem: The interpretation of a symbol system is not intrinsic to the system; it is projected onto it by the interpreter. This is not true of our thoughts. We must accordingly be more than just computers. My guess is that the meanings of our symbols are grounded in the substrate of our robotic capacity to interact with that real world of objects, events and states of affairs that our symbols are systematically interpretable as being about. (shrink)

I discuss the philosophical implications that the rising new science of quantum computing may have on the philosophy of computer science. While quantum algorithms leave the notion of Turing-Computability intact, they may re-describe the abstract space of computational complexity theory hence militate against the autonomous character of some of the concepts and categories of computer science.

This study is a philosophical critique of the foundations of Sigmund Freud's psychoanalysis. As such, it also takes cognizance of his claim that psychoanalysis has the credentials of a natural science. It shows that the reasoning on which Freud rested the major hypotheses of his edifice was fundamentally flawed, even if the probity of the clinical observations he adduced were not in question. Moreover, far from deserving to be taken at face value, clinical data from the psychoanalytic treatment setting are (...) themselves epistemically quite suspect. (shrink)

On the basis of an earlier contribution to the philosophy of computer science by Amnon Eden, this essay discusses to what extent Eden’s ‘paradigms’ of computer science can be transferred or applied to software engineering. This discussion implies an analysis of how software engineering and computer science are related to each other. The essay concludes that software engineering can neither be fully subsumed by computer science, nor vice versa. Consequently, also the philosophies of computer science and software engineering—though related to (...) each other—are not identical branches of a general philosophy of science. This also implies that not all of Eden’s earlier arguments can be directly mapped from the domain of computer science into the domain of software science. After the discussion of this main topic, the essay also points to some further problems and open issues for future studies in the philosophy of software science and engineering. (shrink)

This book is available either individually, or as part of the specially-priced Arguments of the Philosphers Collection.

Many problems in software development can be traced to a narrow understanding of professional responsibility. The author examines ways in which software developers have tried to avoid accepting responsibility for their work. After cataloguing various types of responsibility avoidance, the author introduces an expanded concept of positive responsibility. It is argued that the adoption of this sense of positive responsibility will reduce many problems in software development.

A class of problems is called decidable if there is an algorithm which will give the answer to any problem of the class after a finite length of time. The purpose of this paper is to discuss the classes of problems that can be solved by infinitely long decision procedures in the following sense: An algorithm is given which, for any problem of the class, generates an infinitely long sequence of guesses. The problem will be said to be solved in (...) the limit if, after some finite point in the sequence, all the guesses are correct and the same. Functions, sets, and functionals which are decidable by such infinite algorithms will be calledlimiting recursive. These, together with classes of objects which can beidentified in the limit, are the subjects of this report.Without qualification,setwill mean set of numbers;functionwill mean number-theoretic function of 1 variable, possibly partial;functionalswill take numerical values and have any number of numerical and/or function variables, the latter ranging solely over total functions of 1 variable. Thus a function is a special case of a functional,xwill invariably stand for a numerical variable;φfor a function variable;gfor a guess ;nfor the numerical variable which indexes the guesses, referred to as thetime. (shrink)

In this paper I offer an analysis of causation based upon a theory of mechanisms-complex systems whose internal parts interact to produce a system's external behavior. I argue that all but the fundamental laws of physics can be explained by reference to mechanisms. Mechanisms provide an epistemologically unproblematic way to explain the necessity which is often taken to distinguish laws from other generalizations. This account of necessity leads to a theory of causation according to which events are causally related when (...) there is a mechanism that connects them. I present reasons why the lack of an account of fundamental physical causation does not undermine the mechanical account. (shrink)

Most recent philosophical thought about the scientific representation of the world has focused on dyadic relationships between language-like entities and the world, particularly the semantic relationships of reference and truth. Drawing inspiration from diverse sources, I argue that we should focus on the pragmatic activity of representing, so that the basic representational relationship has the form: Scientists use models to represent aspects of the world for specific purposes. Leaving aside the terms "law" and "theory," I distinguish principles, specific conditions, models, (...) hypotheses, and generalizations. I argue that scientists use designated similarities between models and aspects of the world to form both hypotheses and generalizations. (shrink)

Russian translation of Gettier E. L. Is Justified True Belief Knowledge? // Analysis, vol. 23, 1963. Translated by Lev Lamberov with kind permission of the author.