ABSTRACT
Lev N. Landa’s theory evolved out of his attempt to solve some specific instructional problems when he was in the Soviet Union. In particular, he was interested in how to teach complex, unobservable, often unconscious cognitive processes. Landa’s theory also has a number of prescriptions in common with other instructional theories, such as developing algorithms at the level of elementary operations (similar to Gagne’s entry level of behavior in a learning hierarchy) and the use of prescriptions (generalities) and demonstrations (examples) to teach algorithms. Among the most important issues for consideration is the extent to which Landa’s algo-heuristic approach is appropriate for all kinds of school content. The chapter also demonstrates how the Algo-Heuristic Theory can be applied to the design of an algorithm-based lesson. This algorithm represents a terminal cognitive process that is to be developed in students in the course of instruction.
