Korfhage, R. R. (1983). Algorithm. In A. Ralston, & E. D. Reilly Jr. (Eds.,), Encyclopedia of Computer Science and Engineering (2nd ed., pp. 51-54). New York: Van Nostrand Reinhold Company Inc.

has been cited by the following article:

• TITLE: Algorithmics for Preschoolers—A Contradiction?

  AUTHORS: Roland T. Mittermeir

  KEYWORDS: Algorithmics; Preschoolers; Capability for Expressing Algorithms; Capability for Abstracting

  JOURNAL NAME: Creative Education, Vol.4 No.9, September 5, 2013

  ABSTRACT: Developing an algorithm requires expressing it in some (formal) language. The respective language is usually understood to be textual (conventional programming language) or partly graphical (design languages, and languages in programming environments for children). As writing and reading are capabilities not to be presumed from preschoolers, many educators claim that confronting such young kids with algorithmic concepts is beyond their abstraction capability. This paper reports on an experiment with kindergarten-groups requiring them to discover simple algorithms without resorting to reading and writing. It clearly showed that limited capabilities of abstractions are not a hurdle at all, if the problems are posed in a way corresponding to the limited experience base of the children, and if solutions are small enough to be kept in memory and allow expressing themselves in other forms than writing.