In exploring the nature of psychological explanation, this book looks at how psychologists theorize about the human ability to calculate, to speak a language and the like. It shows how good theorizing explains or tries to explain such abilities as perception and cognition. It recasts the familiar explanations of "intelligence" and "cognitive capacity" as put forward by philosophers such as Fodor, Dennett, and others in terms of a theory of explanation that makes established doctrine more intelligible to professionals and their (...) students.In particular, the book shows that vestigial adherence to the positivists' D-N model has distorted the view of philosophers of science about what psychologists (and biologists) do and has masked the real nature of explanation. Major sections in the book cover Analysis and Subsumption; Functional Analysis; Understanding Cognitive Capacities; and Historical Reflections.Robert Cummins is Associate Professor of Philosophy at the University of Illinois, Chicago Circle. A Bradford Book. (shrink)

Many philosophers think that being in an intentional state is a matter of being related to a sentence in a mental language-a 'Language of Thought' (see especially Fodor 1975, 1987 Appendix; Field 1978). According to this view-which I shall call 'the LT hypothesis'-when anyone has a belief or a desire or a hope with a certain content, they have a sentence of this language, with that content, 'written' in their heads. The claim is meant quite literally: the mental representations that (...) make up the items of this language have semantic and syntactic properties. This is why, according to this view, cognitive psychology does, and should, treat that part of the mind which deals with intentional states as a semantic and a syntactic 'engine'. (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)

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)

It is widely assumed that the explanatory states of scientific psychology are type-individuated by their semantic or intentional properties. First, I argue that this assumption is implausible for theories like David Marr's [1982] that seek to provide computational or syntactic explanations of psychological processes. Second, I examine the implications of this conclusion for the debate over psychological individualism. While most philosophers suppose that syntactic states supervene on the intrinsic physical states of information-processing systems, I contend they may not. Syntatic descriptions (...) must be adequately constrained, and the most plausible such constraints appeal to a system's teleological function or design and hence to its history. As a result, physical twins may not realize the same syntactic states. (shrink)

On the Origin of Objects is the culmination of Brian Cantwell Smith's decade-long investigation into the philosophical and metaphysical foundations of computation, artificial intelligence, and cognitive science. Based on a sustained critique of the formal tradition that underlies the reigning views, he presents an argument for an embedded, participatory, "irreductionist," metaphysical alternative. Smith seeks nothing less than to revise our understanding not only of the machines we build but also of the world with which they interact. Smith's ambitious project begins (...) as a search for a comprehensive theory of computation, able to do empirical justice to practice and conceptual justice to the computational theory of mind. A rigorous commitment to these two criteria ultimately leads him to recommend a radical overhaul of our traditional conception of metaphysics. Everything that exists - objects, properties, life, practice - lies Smith claims in the "middle distance," an intermediate realm of partial engagement with and partial separation from, the enveloping world. Patterns of separation and engagement are taken to underlie a single notion unifying representation and ontology: that of subjects' "registration" of the world around them. Along the way, Smith offers many fascinating ideas: the distinction between particularity and individuality, the methodological notion of an "inscription error," an argument that there are no individualswithin physics, various deconstructions of the type-instance distinction, an analysis of formality as overly disconnected ("discreteness run amok"), a conception of the boundaries of objects as properties of unruly interactions between objects and subjects, an argument for the theoretical centrality of reference preservation, and a theatrical, acrobatic metaphor for the contortions involved in the preservation of reference and resultant stabilization of objects. Sidebars and diagrams throughout the book help clarify and guide Smith's highly original and compelling argument. A Bradford Book. (shrink)

This systematic investigation of computation and mental phenomena by a noted psychologist and computer scientist argues that cognition is a form of computation, that the semantic contents of mental states are encoded in the same general way as computer representations are encoded. It is a rich and sustained investigation of the assumptions underlying the directions cognitive science research is taking. 1 The Explanatory Vocabulary of Cognition 2 The Explanatory Role of Representations 3 The Relevance of Computation 4 The Psychological Reality (...) of Programs: Strong Equivalence 5 Constraining Functional Architecture 6 The Bridge from Physical to Symbolic: Transduction 7 Functional Architecture and Analogue Processes 8 Mental Imagery and Functional Architecture 9 Epilogue: What is Cognitive Science the Science of? (shrink)

In this carefully argued critique, Steven Horst pronounces the theory deficient.

This dissertation addresses a variety of foundational issues pertaining to the notion of algorithm employed in mathematics and computer science. In these settings, an algorithm is taken to be an effective mathematical procedure for solving a previously stated mathematical problem. Procedures of this sort comprise the notional subject matter of the subfield of computer science known as algorithmic analysis. In this context, algorithms are referred to via proper names of which computational properties are directly predicated )). Moreover, many formal results (...) are traditionally stated by explicitly quantifying over algorithms. These observations motivate the view that algorithms are themselves abstract mathematical objects -- a view I refer to as algorithmic realism. The status of this view is clearly related to that of Church's Thesis -- i.e. the claim that a function is computable by an algorithm just in case it is partial recursive. But whereas Church's Thesis is widely accepted on the basis of several well-known mathematical analyses of algorithmic computability, there is presently no consensus on how we can uniformly identify individual algorithms with mathematical objects. In the first chapter of this work, I attempt to illustrate the theoretical significance of algorithmic realism. I suggest that this view is not only of foundational significance to computer science, but also worth highlighting due to the role algorithms play in the fixation of mathematical knowledge and their relationship to intensional entities such as propositions and properties. Chapter Two presents a formal framework for reducing computational discourse to mathematical discourse modeled on contemporary discussion of mathematical nominalism. Chapter Three is centered on a case study intended to illustrate the technical exigencies involved with defending algorithmic realism. Chapter Four explores various ways in which algorithms might be identified with models of computation. And finally, Chapter Five argues that no such identification can uniformly satisfy all statements of algorithmic identity and non-identity affirmed by computational practice. I suggest that the technical crux of algorithmic realism lies in the necessity of reducing recursive specifications of algorithms to iterative models of computation in a manner which preserves algorithmic identity. (shrink)