Part of the distinction between artefacts, objects made by humans for particular purposes, and natural objects is that artefacts are subject to normative judgements. A drill, say, can be a good drill or a poor drill, it can function well or correctly or it can malfunction. In this paper I investigate how such judgements fit into the domain of the normative in general and what the grounds for their normativity are. Taking as a starting point a general characterization of normativity (...) proposed by Dancy, I argue how statements such as ‘this is a good drill’ or ‘this drill is malfunctioning’ can be seen to express normative facts, or the content of normative statements. What they say is that a user who has a desire to achieve a particular relevant outcome has a reason to use, or not to use, the artefact in question. Next this analysis is extended to show that not just statements that say that an artefact performs its function well or poorly, but all statements that ascribe a function to an artefact can be seen as expressing a normative fact. On this approach the normativity of artefacts is analyzed in terms of reasons on grounds of practical, and to a lesser extent theoretical, rationality. I close by investigating briefly to what extent reasons on moral grounds are, in the analysis adopted here, involved in the normativity of artefacts.Keywords: Artefact; Normativity; Instrumental reason; Practical rationality; Function; Use. (shrink)

Woodward's long awaited book is an attempt to construct a comprehensive account of causation explanation that applies to a wide variety of causal and explanatory claims in different areas of science and everyday life. The book engages some of the relevant literature from other disciplines, as Woodward weaves together examples, counterexamples, criticisms, defences, objections, and replies into a convincing defence of the core of his theory, which is that we can analyse causation by appeal to the notion of manipulation.

We provide a full characterization of computational error states for information systems. The class of errors considered is general enough to include human rational processes, logical reasoning, scientific progress and data processing in some functional programming languages. The aim is to reach a full taxonomy of error states by analysing the recovery and processing of data. We conclude by presenting machine-readable checking and resolve algorithms.

Approaches to explanation -- Causal and explanatory relevance -- The kairetic account of /D making -- The kairetic account of explanation -- Extending the kairetic account -- Event explanation and causal claims -- Regularity explanation -- Abstraction in regularity explanation -- Approaches to probabilistic explanation -- Kairetic explanation of frequencies -- Kairetic explanation of single outcomes -- Looking outward -- Looking inward.

The Curry-Howard isomorphism states an amazing correspondence between systems of formal logic as encountered in proof theory and computational calculi as found in type theory. For instance, minimal propositional logic corresponds to simply typed lambda-calculus, first-order logic corresponds to dependent types, second-order logic corresponds to polymorphic types, sequent calculus is related to explicit substitution, etc. The isomorphism has many aspects, even at the syntactic level: formulas correspond to types, proofs correspond to terms, provability corresponds to inhabitation, proof normalization corresponds to (...) term reduction, etc. But there is more to the isomorphism than this. For instance, it is an old idea---due to Brouwer, Kolmogorov, and Heyting---that a constructive proof of an implication is a procedure that transforms proofs of the antecedent into proofs of the succedent; the Curry-Howard isomorphism gives syntactic representations of such procedures. The Curry-Howard isomorphism also provides theoretical foundations for many modern proof-assistant systems (e.g. Coq). This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic. Key features - The Curry-Howard Isomorphism treated as common theme - Reader-friendly introduction to two complementary subjects: Lambda-calculus and constructive logics - Thorough study of the connection between calculi and logics - Elaborate study of classical logics and control operators - Account of dialogue games for classical and intuitionistic logic - Theoretical foundations of computer-assisted reasoning · The Curry-Howard Isomorphism treated as the common theme. · Reader-friendly introduction to two complementary subjects: lambda-calculus and constructive logics · Thorough study of the connection between calculi and logics. · Elaborate study of classical logics and control operators. · Account of dialogue games for classical and intuitionistic logic. · Theoretical foundations of computer-assisted reasoning. (shrink)

Studdert-Kennedy, Gerald, Evidence and Explanation in Social Science. ... Kauffman, Stuart, "Articulation of Parts Explanation in Biology and the Rational ...

Woodward's long awaited book is an attempt to construct a comprehensive account of causation explanation that applies to a wide variety of causal and explanatory claims in different areas of science and everyday life. The book engages some of the relevant literature from other disciplines, as Woodward weaves together examples, counterexamples, criticisms, defenses, objections, and replies into a convincing defense of the core of his theory, which is that we can analyze causation by appeal to the notion of manipulation.

I propose to consider the question, "Can machines think?" This should begin with definitions of the meaning of the terms "machine" and "think." The definitions might be framed so as to reflect so far as possible the normal use of the words, but this attitude is dangerous, If the meaning of the words "machine" and "think" are to be found by examining how they are commonly used it is difficult to escape the conclusion that the meaning and the answer to (...) the question, "Can machines think?" is to be sought in a statistical survey such as a Gallup poll. But this is absurd. Instead of attempting such a definition I shall replace the question by another, which is closely related to it and is expressed in relatively unambiguous words. The new form of the problem can be described in terms of a game which we call the 'imitation game." It is played with three people, a man (A), a woman (B), and an interrogator (C) who may be of either sex. The interrogator stays in a room apart front the other two. The object of the game for the interrogator is to determine which of the other two is the man and which is the woman. He knows them by labels X and Y, and at the end of the game he says either "X is A and Y is B" or "X is B and Y is A." The interrogator is allowed to put questions to A and B. We now ask the question, "What will happen when a machine takes the part of A in this game?" Will the interrogator decide wrongly as often when the game is played like this as he does when the game is played between a man and a woman? These questions replace our original, "Can machines think?". (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)

I defend the historical definition of "function" originally given in my Language, Thought and Other Biological Categories (1984a). The definition was not offered in the spirit of conceptual analysis but is more akin to a theoretical definition of "function". A major theme is that nonhistorical analyses of "function" fail to deal adequately with items that are not capable of performing their functions.

The topic of this paper is the notion of technical (as opposed to biological) malfunction. It is shown how to form the property being a malfunctioning F from the property F and the property modifier malfunctioning (a mapping taking a property to a property). We present two interpretations of malfunctioning. Both interpretations agree that a malfunctioning F lacks the dispositional property of functioning as an F. However, its subsective interpretation entails that malfunctioning Fs are Fs, whereas its privative interpretation entails (...) that malfunctioning Fs are not Fs. We chart various of their respective logical consequences and discuss some of the philosophical implications of both interpretations. (shrink)

Taken at face value, a programming language is defined by a formal grammar. But, clearly, there is more to it. By themselves, the naked strings of the language do not determine when a program is correct relative to some specification. For this, the constructs of the language must be given some semantic content. Moreover, to be employed to generate physical computations, a programming language must have a physical implementation. How are we to conceptualize this complex package? Ontologically, what kind of (...) thing is it? In this paper, we shall argue that an appropriate conceptualization is furnished by the notion of a technical artifact. (shrink)

The specification and implementation of computational artefacts occurs throughout the discipline of computer science. Consequently, unpacking its nature should constitute one of the core areas of the philosophy of computer science. This paper presents a conceptual analysis of the central role of specification in the discipline.

There are currently considerable confusion and disarray about just how we should view computationalism, connectionism and dynamicism as explanatory frameworks in cognitive science. A key source of this ongoing conflict among the central paradigms in cognitive science is an equivocation on the notion of computation simpliciter. ‘Computation’ is construed differently by computationalism, connectionism, dynamicism and computational neuroscience. I claim that these central paradigms, properly understood, can contribute to an integrated cognitive science. Yet, before this claim can be defended, a better (...) understanding of ‘computation’ is required. ‘Digital computation’ is an ambiguous concept. It is not just the classical dichotomy between analogue and digital computation that is the basis for the equivocation on ‘computation’ simpliciter in cognitive science, but also the diversity of extant accounts of digital computation. There are many answers on what it takes for a system to perform digital computation. Answers to this problem range from Turing machine computation, through the formal manipulation of symbols, the execution of algorithms and others, to the strong-pancomputational thesis, according to which every physical system computes every Turing-computable function. Despite some overlap among them, extant accounts of concrete digital computation are non-equivalent, thus, rendering ‘digital computation’ ambiguous. The objective of this dissertation is twofold. First, it is to promote a clearer understanding of concrete digital computation. Accordingly, my main thesis is that not only are extant accounts of concrete digital computation non-equivalent, but most of them are inadequate. I show that these accounts are not just intensionally different (this is quite trivially the case), but also extensionally distinct. In the course of examining several key accounts of concrete digital computation, I propose the instructional information processing account, according to which digital computation is the processing of discrete data in accordance with finite instructional information. The second objective is to establish the foundational role of computation in cognitive science whilst rejecting the purported representational nature of computation. (shrink)

This chapter contains sections titled: Introduction Function and Malfunction Function and Evolution Function Based on Past Origins Biological Functions Based on the Distant Past: Natural Selection Fitness and Goal‐Contribution Accounts Neo‐Teleology Looking at the Present: Causal Roles and Functions Evolution Bites Back: Vindication of the Selectionist Approach Postscript: Counterpoint Acknowledgments Notes References.

Over the past three decades, the philosophy of biology has emerged from the shadow of the philosophy of physics to become a respectable and thriving philosophical subdiscipline. The authors take a fresh look at the life sciences and the philosophy of biology from a strictly realist and emergentist-naturalist perspective. They outline a unified and science-oriented philosophical framework that enables the clarification of many foundational and philosophical issues in biology. This book will be of interest both to life scientists and philosophers.