Learning mathematics with recursive computer programs
Howard A. Peelle · 1976
Recursion is a powerful idea*—with correspondingly powerful implications for learning and teaching mathematics. Computer scientists have previously pointed out that the use of recursion often permits more lucid and concise descriptions of algorithms [1]; mathematicians know that recursion is a fundamental concept upon which entire systems of mathematics can be built [11]; and, the theory of recursive functions is now developing into an area of mathematics whose importance has been compared with that of geometry and algebra [3].