We report on an innovative design of algorithmic analysis that supports automatic online assessment of students' exploration of geometry propositions in a dynamic geometry environment. We hypothesized that difficulties with and misuse of terms or logic in conjectures are rooted in the early exploration stages of inquiry. We developed a generic…

A new heuristic factorization scheme uses learning to improve the efficiency of determining the symbolic factorization of multivariable polynomials with interger coefficients and an arbitrary number of variables and terms. The factorization scheme makes extensive use of artificial intelligence techniques (e.g., model-building, learning, and…

This paper is a theoretical discussion of several functions of knowledge systems based on the idea of partial matching, that is, comparison of two or more descriptions by identification of their similarities. Several knowledge system functions are described in terms of partial or best matchings including analogical reasoning, inductive inference,…

The hypothesis investigated is that understanding of the long division algorithm requires a higher cognitive level than understanding of fundamental division concepts. Sixth-grade children were tested on performance and understanding of a given algorithm and concepts of division. (MP)

The topic of teaching troubleshooting is examined as an example of the teaching of cognitive strategies for technical problem solving. The traditional behavioral approach to teaching troubleshooting has essentially been algorithmic. Recent cognitive research suggests an approach founded first on task analysis and characterized by: (1) analysis of…

This description of the Structure-Mapping Engine (SME), a flexible, cognitive simulation program for studying analogical processing which is based on Gentner's Structure-Mapping theory of analogy, points out that the SME provides a "tool kit" for constructing matching algorithms consistent with this theory. This report provides: (1) a…

One difficulty that mathematically naive subjects encounter in solving arithmetic word problems involves the limitation on short term memory (STM) capacity. It is hypothesized that naive subjects, not having access to formal problem solving strategies, may find visualization useful in reducing strain on STM. Two experiments are reported. The…

Proposes a criterion for selecting a sequence of objectives from a learning hierarchy and describes a sequence generating algorithm which is designed to generate a minimal memory load sequence from a learning tree. Its effectiveness in generating low memory load sequences from hierarchies that are not trees is also discussed. (RP)

A study to investigate one of the mechanisms teachers may use to convince themselves incorrectly that students have learned science concepts requiring formal operational ability is presented. The investigation indicates instructors may actually teach and test for memorization of algorithms rather than understanding. (MP)

This volume contains a series of papers on algorithmic learning. Included are six reviews of research pertaining to various aspects of algorithmic learning, six reports of pilot experiments in this area, a theoretical discussion of "The Conditions for Algorithmic Imagination," and an annotated bibliography. All the papers assume a common…

A survey of general mathematics students whose teachers were taking an inservice workshop revealed that they had not yet mastered division. More direct introduction of the standard division algorithm is favored in elementary grades, with instruction of transitional processes curtailed. Weaknesses in transitional algorithms appear to outweigh…

Considers the possibility of applying instance theory to the study of second language. Instance theory emphasizes the storage and subsequent use of individual experiences over the creation of abstract principles. Suggests that the theory can be applied to the study of second languages, only if it is used in conjunction with a theory of universal…

Forty-five children aged four-and-a-half to five-and-a-half years old were given number conservation tasks in three conditions: (1) a count condition in which children were helped to count each set after the transformation; (2) a match condition in which children were helped to connect by a string each animal with its peanut; and (3) the standard…

Presents a computational framework for modeling cognitive development that provides a language paradigm with which to compare and contrast different facets of children's knowledge. Describes the generative connectionist algorithm "cascade-correlation," the successful use of the algorithm to model cognitive development in various…

This study was designed to follow up earlier work on mapping instruction. The two main goals were to: (1) test the effectiveness of mapping instruction as a general cure for "buggy" subtraction algorithms, and (2) explore two alternative explanations of how this new form of instruction works. It was hypothesized that mapping cures bugs…