The computer from Pascal to von Neumann
The computer from Pascal to von Neumann
A survey of the literature in computer science education since curriculum '68
Communications of the ACM
Another look at the discrete structures course
SIGCSE '76 Proceedings of the ACM SIGCSE-SIGCUE technical symposium on Computer science and education
A first course in discrete structures with applications to computer science
SIGCSE '74 Proceedings of the fourth SIGCSE technical symposium on Computer science education
A discrete structures course for a small college
SIGCSE '75 Proceedings of the fifth SIGCSE technical symposium on Computer science education
| Hi-index | 0.00 |
The history of computer science and of new areas of applicable mathematics are intimately related. Much of this common development is due to common developers. In the 1940's John von Neumann developed the concept and first implementation of a stored-program calculating machine. Thus von Neumann was the father of modern computer programming and, in a sense, the founder of computer architectture (2). He also was developer of the theory of games (14), a new mathematical subject that is both highly applicable and involves some of the purest of mathematics On a lower pedagogical level, we find the first simple widely used programming language and associated time-sharing system and the first textbook on finite mathematics also developed from one man, John Kemeny. Between his initial career as a brilliant logician and his current career as a university president, Kemeny championed the cause of finite mathematics in the undergraduate curriculum in the 1950's. He oversaw the future importance of finite math: logic, combinatorics, finite probability models, and linear programming. Shortly after his textbook, Introduction to Finite Mathematics, with L. Snell and G. Thompson appeared, Kemeny became involved in a project to make computers easy for average college students to use. The result was the language BASIC and one of the first successful time-sharing system.