A comparison of four methods of finding the maturity value of the principal is presented. The four methods are: table, period-by-period iterative calculation, formula, and Binomial Theorem. (MP)

An algorithm for long division is presented that involves only addition and subtraction. (MP)

The calculator is used to solve certain formidable equations, which arise naturally and which may be difficult or impossible to solve by standard methods, by a method of successive approximations. (MP)

The benefits of utilizing text compression for CAI are evaluated, and an analysis of core storage, decoding, and CPU time are presented for the PDP-10 system. (RAO)

The long division algorithm approached as repeated subtractions is explained. (DT)

Discusses how performance technologists, or trainers, can provide more impact in reducing field performance deficiencies by gathering feedback from the field regarding training matters. A feedback generator is described that is expressed in terms of an algorithm and helps point to solutions to improve productivity. (LRW)

A method for checking college students' completion of program and graduation requirements by computer is outlined. The procedure operates by having degree programs defined in tables and is simple enough to be achieved by junior program staff without the need for programmers and analysts. (MSE)

Defines a set of algorithms providing the minimum amount of information necessary for computer generation of all forms in the German lexicon and detection of spelling errors, based on a method of compressing lexical information. (Author/CB)

Reviews the development of artificial intelligence systems and the mechanisms used, including knowledge representation, programing languages, and problem processing systems. Eleven books and 6 journals are listed as sources of information on artificial intelligence. (23 references) (CLB)

Presents a mathematical theory that can be used to define concentration places of objects within unordered classes. The application to research on the evolution of journals and subject areas is illustrated, and an online method of calculating concentration evolution is described. (1 references) (CLB)

Discusses an algorithm for developing problem solving simulations using microcomputers, and describes both the components of the simulation algorithm and the user interface. Examples of simulation and programming methods are presented. (MBR)

Circuits are described, with discussion on how to help students find the algorithms to solve a variety of problems involving circuits. (MNS)

How set theory, combinatorics, probability, and the study of algorithms can be used in solving two problems is described in detail. Three computer programs are listed. (MNS)

A possible method of derivation of prescriptions for solving problems, found in Babylonian cuneiform texts, is presented. It is a kind of "geometric algebra" based mainly on one figure and the manipulation of or within various areas and segments. (MNS)

Computational algorithms from American textbooks copyrighted prior to 1900 are presented--some that convey the concept, some just for special cases, and some just for fun. Algorithms for each operation with whole numbers are presented and analyzed. (MNS)