This article responds to two unresolved and crucial problems of cognitive science: (1) What is actually accomplished by functions of the nervous system that we ordinarily describe in the intentional idiom? and (2) What makes the information processing involved in these functions semantic? It is argued that, contrary to the assumptions of many cognitive theorists, the computational approach does not provide coherent answers to these problems, and that a more promising start would be to fall back on mathematical communication theory (...) and, with the help of evolutionary biology and neurophysiology, to attempt a characterization of the adaptive processes involved in visual perception. Visual representations are explained as patterns of cortical activity that are enabled to focus on objects in the changing visual environment by constantly adjusting to maintain levels of mutual information between pattern and object that are adequate for continuing perceptual control. In these terms, the answer proposed to (1) is that the intentional functions of vision are those involved in the establishment and maintenance of such representations, and to (2) that semantic features are added to the information processes of vision with the focus on objects that these representations accomplish. The article concludes with proposals for extending this account of intentionality to the higher domains of conceptualization and reason, and with speculation about how semantic information-processing might be achieved in mechanical systems. (shrink)

This research presents a computer model called EUREKA that begins with novice‐like strategies and knowledge organizations for solving physics word problems and acquires features of knowledge organizations and basic approaches that characterize experts in this domain. EUREKA learns a highly interrelated network of problem‐type schemas with associated solution methodologies. Initially, superficial features of the problem statement form the basis for both the problem‐type schemas and the discriminating features that organize them in the P‐MOP (Problem Memory Organization Packet) network. As EUREKA (...) solves more problems, the content of the schemas and the discriminating features change to reflect more fundamental physics principles. This changing network allows EUREKA to shift from a novicelike means‐ends strategy to a more expertlike “knowledge development” strategy in which the presence of abstract concepts are triggered by problem features. In this model, the strategy shift emerges as a natural consequence of the evolving expertlike organization of problem‐type schemos. EUREKA captures many of the descriptive models of novice expert differences, and also suggests a number of empirically testable assumptions regarding problem‐solving strategies and the representation of problem‐solving knowledge. (shrink)

The inductive category formation framework, an influential set of theories of learning in psychology and artificial intelligence, is deeply flawed. In this framework a set of necessary and sufficient features is taken to define a category. Such definitions are not functionally justified, are not used by people, and are not inducible by a learning system. Inductive theories depend on having access to all and only relevant features, which is not only impossible but begs a key question in learning. The crucial (...) roles of other cognitive processes (such as explanation and credit assignment) are ignored or oversimplified. Learning necessarily involves pragmatic considerations that can only be handled by complex cognitive processes.We provide an alternative framework for learning according to which category definitions must be based on category function. The learning system invokes other cognitive processes to accomplish difficult tasks, makes inferences, analyses and decides among potential features, and specifies how and when categories are to be generated and modified. We also examine the methodological underpinnings of the two approaches and compare their motivations. (shrink)

Learning programs that generalize from real‐world examples will have to deal with many different kinds of data. Continuous numeric data can cause problems for algorithms that search for examples with identical property values. These problems can be surmounted by categorizing the numeric data. However, this process has problems of its own. In this paper, we look at the need for categorizing numeric data and several methods for doing so. We concentrate on the use of generalization‐based memory, a memory organization where (...) actual examples are stored along with generalizations, which leads to a generalization‐based categorization algorithm. We also consider how to use a number heuristic, looking for gaps. These methods have been implemented in the UNIMEM computer system. Examples are presented of these algorithms categorizing data about the states of the United States. (shrink)