The forum is focused on thinking about and with algorithms as a way of unifying all one's mathematical endeavors. The lead article by Maurer presents examples and discussion of this point. Responses, often disagreeing with his views, are by Douglas, Korte, Hilton, Renz, Smorynski, Hammersley, and Halmos. (MNS)

Describes the current status and limitations of expert systems, and explores the possible applications of such systems in education and training. The use of expert systems as tutors, as job aids, and as a vehicle for students to develop their own expert systems on specific topics are discussed. (40 references) (CLB)

Discrete mathematics and finite mathematics differ in a number of ways. First, finite mathematics has a longer history and is therefore more stable in terms of course content. Finite mathematics courses emphasize certain particular mathematical tools which are useful in solving the problems of business and the social sciences. Discrete mathematics…

The illustrative method of teaching employed in most undergraduate accounting courses is becoming increasingly burdensome to professors and students due to the rapid proliferation of accounting and auditing professional standards and the increased complexity of the tax law. This teaching method may be near the breaking point in upper division…

Describes basic structure of a framegame, Chain Gang, in which self-instructional modules teach a cognitive skill. Procedures are presented for loading new content into the game's basic framework to teach algorithms or heuristics and for game modification to suit different situations. Handouts used in the basic game are appended. (MBR)

Raises and responds to questions about what and how to teach mathematics with the availability of calculators to all students. Discusses whether students need basic facts, mechanical skills, and knowledge of computational algorithms. Argues that students need to develop number sense and analytical skills using simple, symbolic, and graphing…

This paper presents a theoretical framework for investigating the role of algorithms in mathematical thinking using a combined ontological-psychological outlook. The intent is to demonstrate that the processes of learning and of problem solving incorporate an elaborate interplay between operational and structural conceptualizations of the same…

Presented is a way to provide students with a review and an appreciation of the versatility of pointers in data structures by improvising with binary trees. Examples are described using the Pascal programing language. (KR)