There is a broad impetus across policy and institutional domains to expand public engagement and involvement with emerging technology research and innovation. Yet innovative theory, methods, and practices to critically explore algorithmic system controversies and democratic possibilities are still in nascent form. In this paper, we bring together…

With the advent of big data and advances in technology, psychological assessments have become increasingly sophisticated and complex. Nevertheless, traditional psychometric issues concerning the validity, reliability, and measurement bias of such assessments remain fundamental in determining whether score inferences of human attributes are…

Discusses the development of the Smart Book, a device which simplifies access to information normally found in printed form, and describes its two distinct components--the reader unit containing computer equipment, display screen, and controls, and the ROM book pack containing the text of the book and program functions. Possible applications are…

Presents a technique for the numerical inversion of Laplace Transforms and several examples employing this technique. Limitations of the method in terms of available computer word length and the effects of these limitations on approximate inverse functions are also discussed. (JN)

The brief therapy approach to counseling was born in the post-World War II cybernetics movement. The shift from a problem focus to a solution focus altered the way in which counselors approached helping clients out of their inflexible cognitive representations. Alongside this evolution in psychotherapy were the growth of research in artificial…

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)

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)

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 the use of manipulative materials to model operations and algorithms. Indicates that they clarify the several interpretations of each operation, establish a basis for correct mathematical language, and show why algorithms work. (JN)

This review of four different computer-assisted instruction algorithms concludes that current authoring guides are more concerned with "user orientation" than with instructional principles, and advocates the application of a design model based on Gagne's information processing model of instruction. Nine references are listed. (MER)

Presents a theorem and its converse to generate all of the primitive Pythagorean quadruples. Provides a BASIC program generating them. (YP)

Discusses a numerical technique called the method of adjoints, turning a linear two-point boundary value problem into an initial value problem. Described are steps for using the method in linear or nonlinear systems. Applies the technique to solve a simple pendulum problem. Lists 15 references. (YP)

Presents two methods for replacing a series by one converging more rapidly: regrouping the terms of a series and manipulations of power series. Describes a general algorithm for approximating the natural logarithm of any number. (YP)

The "word problem" is stated for a given collection. Facts regarding Dehn's Algorithm, definition of Thue systems, a rewriting system, lemmas and corollaries are provided. The situation is examined where the monoid presented by a finite Thue system is a group. (DC)

Possible ways of mechanization for counting using a binary system are discussed. Shows a binary representation of the numbers and geometric models having eight triples of lamps. Provides three problem sets. (YP)