Something remarkable is happening in the cognitive sciences. After a quarter of a century of cognitive models that were inspired by the metaphor of the digital computer, the newest cognitive models are inspired by the properties of the brain itself. Variously referred to as connectionist, parallel distributed processing, or neutral network models, they explore the idea that complex intellectual operations can be carried out by large networks of simple, neuron-like units. The units themselves are identical, very low-level and 'stupid'. Intelligent (...) performance is derived from the pattern of connection strengths between units, and the fundamental cognitive activity is pattern recognition and completion. Connectionism and the Mind provides an introduction to this newly emerging approach to understanding the mind. The first few chapters focus on network architecture, offering accessible treatment of the equations that describe learning and the propagation of activation. Furthermore, the reader is walked step-by-step through the activities of networks engaged in pattern recognition, learning, and cognitive tasks such as memory retrieval and prototype formation. The remainder of the book addresses the implications of connectionism for theories of the mind, both philosophical and psychological. Foe example: What Role is played by pattern recognition and completion as basic as cognitive functions? Connectionist models have particular strength in learning and pattern recognition; should they be limited to those functions, or can they provide an overall account of cognitive functioning? In particular, can connectionist models provide an adequate account of the ability to employ linguistic and other symbol systems, or must an adequate system incorporate symbol processing as a basic cognitive capacity? Finally, Connectionism and the Mind examines the relation of connectionist models to philosophical accounts of propositional attitudes, and to a variety of other inquiries in cognitive psychology, linguistics, developmental psychology, artificial intelligence and neuroscience. (shrink)

An analysis of two heuristic strategies for the development of mechanistic models, illustrated with historical examples from the life sciences. In Discovering Complexity, William Bechtel and Robert Richardson examine two heuristics that guided the development of mechanistic models in the life sciences: decomposition and localization. Drawing on historical cases from disciplines including cell biology, cognitive neuroscience, and genetics, they identify a number of "choice points" that life scientists confront in developing mechanistic explanations and show how different choices result in divergent (...) explanatory models. Describing decomposition as the attempt to differentiate functional and structural components of a system and localization as the assignment of responsibility for specific functions to specific structures, Bechtel and Richardson examine the usefulness of these heuristics as well as their fallibility—the sometimes false assumption underlying them that nature is significantly decomposable and hierarchically organized. When Discovering Complexity was originally published in 1993, few philosophers of science perceived the centrality of seeking mechanisms to explain phenomena in biology, relying instead on the model of nomological explanation advanced by the logical positivists (a model Bechtel and Richardson found to be utterly inapplicable to the examples from the life sciences in their study). Since then, mechanism and mechanistic explanation have become widely discussed. In a substantive new introduction to this MIT Press edition of their book, Bechtel and Richardson examine both philosophical and scientific developments in research on mechanistic models since 1993. (shrink)

Time underlies many interesting human behaviors. Thus, the question of how to represent time in connectionist models is very important. One approach is to represent time implicitly by its effects on processing rather than explicitly (as in a spatial representation). The current report develops a proposal along these lines first described by Jordan (1986) which involves the use of recurrent links in order to provide networks with a dynamic memory. In this approach, hidden unit patterns are fed back to themselves: (...) the internal representations which develop thus reflect task demands in the context of prior internal states. A set of simulations is reported which range from relatively simple problems (temporal version of XOR) to discovering syntactic/semantic features for words. The networks are able to learn interesting internal representations which incorporate task demands with memory demands: indeed, in this approach the notion of memory is inextricably bound up with task processing. These representations reveal a rich structure, which allows them to be highly context‐dependent, while also expressing generalizations across classes of items. These representations suggest a method for representing lexical categories and the type/token distinction. (shrink)

Continuing his exploration of the organization of complexity and the science of design, this new edition of Herbert Simon's classic work on artificial ...

This paper explores the difference between Connectionist proposals for cognitive a r c h i t e c t u r e a n d t h e s o r t s o f m o d e l s t hat have traditionally been assum e d i n c o g n i t i v e s c i e n c e . W e c l a i m t h a t t h (...) e m a j o r d i s t i n c t i o n i s t h a t , w h i l e b o t h Connectionist and Classical architectures postulate representational mental states, the latter but not the former are committed to a symbol-level of representation, or to a ‘language of thought’: i.e., to representational states that have combinatorial syntactic and semantic structure. Several arguments for combinatorial structure in mental representations are then reviewed. These include arguments based on the ‘systematicity’ of mental representation: i.e., on the fact that cognitive capacities always exhibit certain symmetries, so that the ability to entertain a given thought implies the ability to entertain thoughts with semantically related contents. We claim that such arguments make a powerful case that mind/brain architecture is not Connectionist at the cognitive level. We then consider the possibility that Connectionism may provide an account of the neural (or ‘abstract neurological’) structures in which Classical cognitive architecture is implemented. We survey a n u m b e r o f t h e s t a n d a r d a r g u m e n t s t h a t h a v e b e e n o f f e r e d i n f a v o r o f Connectionism, and conclude that they are coherent only on this interpretation. (shrink)

What psychological and philosophical significance should we attach to recent efforts at computer simulations of human cognitive capacities? In answering this question, I find it useful to distinguish what I will call "strong" AI from "weak" or "cautious" AI. According to weak AI, the principal value of the computer in the study of the mind is that it gives us a very powerful tool. For example, it enables us to formulate and test hypotheses in a more rigorous and precise fashion. (...) But according to strong AI, the computer is not merely a tool in the study of the mind; rather, the appropriately programmed computer really is a mind, in the sense that computers given the right programs can be literally said to. (shrink)

DCPS is a connectionist production system interpreter that uses distributed representations. As a connectionist model it consists of many simple, richly interconnected neuron‐like computing units that cooperate to solve problems in parallel. One motivation for constructing DCPS was to demonstrate that connectionist models are capable of representing and using explicit rules. A second motivation was to show how “coarse coding” or “distributed representations” can be used to construct a working memory that requires far fewer units than the number of different (...) facts that can potentially be stored. The simulation we present is intended as a detailed demonstration of the feasibility of certain ideas and should not be viewed as a full implementation of production systems. Our current model only has a few of the many interesting emergent properties that we eventually hope to demonstrate: It is damage‐resistant, it performs matching and variable binding by massively parallel constraint satisfaction, and the capacity of its working memory is dependent on the similarity of the items being stored. (shrink)

inheritance reasoning in semantic networks allowing for multiple inheritance with exceptions. The approach leads to a definition of iaheritance that is..

It is a controversial issue as to which of the two approaches, the Physical Symbol System Hypothesis or Parallel Distributed Processing , is a better characterization of the mind. At the root of this controversy are two questions: What sort of computer is the brain, and what sort of programs run on that computer? What is presented here is a theory which bridges the apparent gap between PSSH and PDP approaches. In particular, a computer is presented that adheres to constraints (...) of PDP computation , and a program is presented which at first glance is only suitable for a PSSH computer but which runs on a PDP computer. The approach presented here, vertical integration, shows how to construct PDP computers that can process symbols and how to design symbol systems so that they will run on more brain-like computers. ;The type of computer presented here is called a tensor manipulation network. It is a special type of PDP network where the operation of the network is interpreted as manipulations of high rank tensors . The operations on tensors in turn are interpreted as operations on symbol structures. A wide range of tensor manipulation architectures are presented with the goal of inducing constraints on the symbol structures that it is possible for the mind to possess. ;As a demonstration of what is possible with constrained symbol structures, a program, CRAM, is presented which uses and acquires thematic knowledge. CRAM is able to read, in English, single-paragraph, fable-like stories and either give a thematically relevant summary or generate planning advice for a character in the story. CRAM is also able to learn new themes through combination of existing, known themes encountered in the fables CRAM reads. ;CRAM demonstrates that even the most symbolic cognitive tasks can be accomplished with PDP networks, if the networks are designed properly. (shrink)