A user-friendly algorithm

ABSTRACT

The interface between a person and a computer can be looked at from either side. Programmers tend to view it from the inside; they consider it their job to defend the machine against errors made by its users. From the outside, the user sees his/her problems as paramount. He/she is often at odds with this complex, inflexible, albeit powerful tool. The needs of both people and machines can be reconciled; users will respond more efficiently and intelligently if they receive meaningful feedback. A “user-friendly” algorithm that covers a wide range of interactive environments and is typical of most operating systems and many application programs is presented.

REFERENCES

• 1: Aho, A.V., and Ullman, J.D. Principles of Compiler Design. Addison Wesley, Reading, Mass., 1979, Ch. 3. A formal but readable discussion of transition diagrams.
• 2: Dwyer, B. Programming for users: A bit of psychology. Computers and People 30, 1-2 (1981), 11. Describes experiences and theory on which our algorithm is based.
• 3: Hilgard, E.R., Atkinson, R.C., and Atkinson, R.L. Introduction to Psychology, 7th Ed. Harcourt Brace Jovanovich, N.Y., 1979, Ch. 7. A general introduction to psychology, with a useful chapter on learning theory, including operant conditioning.
• 4: Schneiderman, B. Software Psychology. Winthrop, Cambridge, Mass., 1980. A survey of psychological aspects of programming, emphasizing quantifiable experiments.
• 5: Skinner, B.F. The Behavior of Organisms, an Experimental Analysis. Appleton Century Crofts, N.Y., 1938. Discusses the experimental basis of the theory of operant conditioning.

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.1 MODELS AND PRINCIPLES

General Terms:
Algorithms, Design, Theory

Keywords:
behavior modification, data entry, data validation, diagnostics, interactive systems, learning theory, man-machine dialogue, operant conditioning, shaping behavior