Shows how to characterize language learning in a finite parameter space, such as in the "principles-and-parameters" approach, as a Markov structure. Explains how sample complexity varies with input distributions and learning regimes. Finds that a simple random-step algorithm always converges to the right target language and works faster than a…

Studies of stereo vision guide research on how animals see and how computers might accomplish this human activity. Discusses a sequence of algorithms to first extract information from visual images and then to calculate the depths of objects in the three-dimensional world, concentrating on stereopsis (stereo vision). (JN)

Maintains that coalitions form as a function of the popularity of an individual and the reciprocation between individuals. An algorithm is introduced, incorporating both popularity and reciprocation components, to generate units of analysis for coalition identification. The algorithm reflects aspects of the whole group and intensity of dyads.…

Built-in data structures are the registers and memory words where binary values are stored; hard-wired algorithms are the fixed rules, embodied in electronic logic circuits, by which stored data are interpreted as instructions to be executed. Various topics related to these two basic elements of every computer program are discussed. (JN)

Shows that the rules of thumb for propagating significant figures through arithmetic calculations frequently yield misleading results. Also describes two procedures for performing this propagation more reliably than the rules of thumb. However, both require considerably more calculational effort than do the rules. (JN)

Offers characterization of sign-transmission which is more general than conventional signal-transmission theory. Concepts and terminology, formal description of individual communications process, reconciliation with classical signal-detection theory, applications of sign-detection formalism to information retrieval on MEDLINE database, and a…

Presents methodological considerations in developing an automatic cheap algorithm for computerized path diagraming, gives some plotted results, and describes a program which produces the plots from an input matrix of path coefficients on a standard line printer. The program accommodates unidirectional and reciprocal causation and represents…

Explores potential of mathematical theory of communication for information science and examines question of how to encode a message at time it is encountered for subsequent recall. Examples of problem, a prototype computer program and experiment, coding as embedding in associational nets, and nature of information are discussed. (Nine references.)…

Presents both logical and empirical evidence to illustrate that the conventional scoring algorithm for ranking tasks significantly underestimates the initial level of group ability and that Slevin's alternative scoring algorithm significantly overestimates the initial level of ability. Presents a modification of Slevin's algorithm which authors…

This discussion of information structures in written texts describes how linguistic analysis of short published reports leads to the presentation of an algorithm that depicts the problem-solving process in terms of a series of evaluative questions. (Author/CHC)