The use of the calculator is suggested in teaching algorithms for the four basic operations, in place of any difficult standard algorithm. (MP)

Algorithms for generating random numbers are discussed along with disadvantages. A program for a programable calculator is given that overcomes those disadvantages. (MP)

Discusses the fraction system developed by the ancient Egyptians. Includes puzzles and number-theory problems. (MA)

The general management simulation game, Tempomatic IV is used in a comparison of ranking and relational performance evaluation procedures. Results indicate that the relational approach has clear advantages over ranking approaches, especially in generating more useful information. Also, reliance on mechanically generated scores can lead to…

The author redefines basic numeracy as the ability to use a four-function calculator sensibly. He then defines "sensibly" and considers the place of algorithms in the scheme of mathematical calculations. (MN)

Competence is defined as the knowledge of a mature speaker of a language, irrespective of questions about acquisition. It is questioned whether there can be a procedure for generating sentences as a model of this competence; it is concluded that there cannot be a precise, non-random model for competence. (CHK)

Reviews aspects of the relationship between machine learning and information retrieval. Highlights include learning programs that extend from knowledge-sparse learning to knowledge-rich learning; the role of the thesaurus; knowledge bases; artificial intelligence; weighting documents; work frequency; and merging classification structures. (78…

Provides several algorithms that use extended precision methods to compute large factorials exactly. The programs are written in BASIC and PASCAL. The approach used for computing N considers how large N is, how the built-in limitation on exact integer representation can be bypassed, and how long it takes to compute N. (JN)

The forum is focused on thinking about and with algorithms as a way of unifying all one's mathematical endeavors. The lead article by Maurer presents examples and discussion of this point. Responses, often disagreeing with his views, are by Douglas, Korte, Hilton, Renz, Smorynski, Hammersley, and Halmos. (MNS)

Presents a general mathematical framework for information retrieval, in which query evaluation is seen as a mapping from the free term algebra built by query descriptors and weights to the semantic algebra of evaluation value. Competing mathematical models that try to describe how retrieval systems behave are reviewed. (Author/MBR)

Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

Describes design and presents examples of industrial use of small expert systems and guidelines for choosing problems which lend themselves to small tool solutions. Use of microcomputer facilitated decision tables to diagnose and categorize people, things, and issues is suggested, and development of three decision table formats is described. (MBR)

Two mathematical topics are interpreted from the viewpoints of traditional (performing algorithms) and contemporary (creating algorithms and thinking in terms of them for solving problems and developing theory) algorithmic mathematics. The two topics are Horner's method for evaluating polynomials and Gauss's method for solving systems of linear…

Discusses difficulties of producing computer assisted learning (CAL) software economically. Proposed as a solution, modular programing is illustrated by describing production of a matrix algebra package. Use of special CAL modules and facilities provided by subroutine libraries are cited, and development of a package to teach matrix theory is…

The Galois-lattice is a graphic method for representing all possible developmental phases to reach a given total knowledge via different partial knowledge structures. Algorithms are proposed for incorporating statistical analysis into the Galois-lattice method. A comparison to the Rasch model and application for educational research are given. (BS)