The repetitious nature of music is thought to be very similar to the repetitious nature of computer algorithms. Subroutines are seen to be very effectively applied to music notation, through reducing repetitious entry and the amount of memory required to represent a musical score. Examples of subroutine use are provided. (MP)

A traditional question is whether or not computers shall ever think like humans. This question is redirected to a discussion of whether computers shall ever be truly creative. Creativity is defined and a program is described that is designed to complete creatively a series problem in mathematics. (MP)

Computer science education for the liberal arts student has both a practical value (creating an intelligent consumer) and an appreciative value (teaching algorithmic thinking). A computer literacy course can be structured to harmonize with the aims of liberal education. (SK)

Discussion of how to teach programming skills to novice programmers focuses on the use of a program animator that uses a copies model of recursion to teach the recursive function. Various mental models are reviewed; testing the recursion animator is described; and possibilities for further research are suggested. (12 references) (LRW)

Describes shortcomings of computer science/engineering education and explains a new focus on informatics. Highlights include simulation, visualization, algorithmization, design of information processing models, parallel computing, a history of informatics, informatics versus physics and mathematics, and implications for education. (51 references)…

The critical role of computers in scientific advancement is described in this panel report. With the growing range and complexity of problems that must be solved and with demands of new generations of computers and computer architecture, the importance of computational mathematics is increasing. Multidisciplinary teams are needed; these are found…

Shows by means of a mathematical example how algorithmic thinking and mathematical thinking complement each other. An algorithmic approach can lead to questions that deepen the understanding of mathematics material. (DDR)

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)