An algorithm and associated FORTRAN-77 computer subroutine are described for computing Goodman and Kruskal's tau-b statistic along with the associated nonasymptotic probability value under the null hypothesis tau=O. (Author)

Describes the use of PROLOG to program knowledge-based information retrieval systems, in which the knowledge contained in a document is translated into machine processable logic. Several examples of the resulting search process, and the program rules supporting the process, are given. (10 references) (CLB)

Describes a system that provides online access to holdings information for more than 4,500 journals on a single self-executing diskette. A brief discussion of data compression is offered, along with program listings in both BASIC and C. (MES)

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)

Results of study investigating human memory organization in processing of computer programming languages indicate that algorithmic logic segments form a cognitive organizational structure in memory for programs. Statement indentation and internal program documentation did not enhance organizational process of recall of statements in five Fortran…

Describes "Josef," a robot programing language similar to the LOGO turtle language, which has been designed as an instructional system through which the algorithmic problem-solving skills required in computer programing can be developed and tested in a controlled learning environment. Four figures and a reference list are included. (JL)

Describes examples of rational representation as a guide for translating terminology and information encountered in manuals for computers. Discusses four limitations of the representation. (YP)

Proposes that the first computer language course for students of management should teach the reading of the language rather than the writing of programs in that language. "Reading" means the study of the programing language literature, including a variety of algorithms, to understand the language, inputs, and program use. (MF)

Discusses problems associated with teaching non-recursive binary searching in computer language classes, and describes a teacher-directed dialog based on dictionary use that helps students use their previous searching experiences to conceptualize the binary search process. Algorithmic development is discussed and appropriate classroom discussion…

An implementation of the Gauss-Newton algorithm for the analysis of covariance structure that is specifically adapted for high-level computer languages is reviewed. This simple method for estimating structural equation models is useful for a variety of standard models, as is illustrated. (SLD)

Describes the nature and use of computer algebra and its applications to various physical sciences. Includes diagrams illustrating, among others, a computer algebra system and flow chart of operation of the Euclidean algorithm. (SK)

Techniques for estimating pi using the microcomputer are demonstrated. Four BASIC programs, coded from pi generating formulas, are compared for efficiency. (PK)