|
1966 – A. J. Perlis
Background
For his influence in the area of advanced programming techniques and compiler construction.
1967 – Maurice V Wilkes
Background
Professor Wilkes is best known as the builder and designer of the EDSAC, the first computer with an internally stored program. Built in 1949, the EDSAC used a mercury delay line memory. He is also known as the author, with Wheeler and Gill, of a volume on "Preparation of Programs for Electronic Digital Computers" in 1951, in which program libraries were effectively introduced.
1968 – Richard Hamming
Background
For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes.
1969 – Marvin Minsky
Background
The citation for this award winner is not currently available.
1970 – J. H. Wilkinson
Background
For his research in numerical analysis to facilitiate the use of the high-speed digital computer, having received special recognition for his work in computations in linear algebra and "backward" error analysis.
1971 – John McCarthy
Background
Dr. McCarthy's lecture "The Present State of Research on Artificial Intellegence" is a topic that covers the area in which he has achieved considerable recognition for his work.
1972 – E. W. Dijkstra
Background
The working vocabulary of programmers everywhere is studded with words originated or forcefully promulgated by E.W. Dijkstra - display, deadly embrace, semaphore, go-to-less programming, structured programming. But his influence on programming is more pervasive than any glossary can possibly indicate. The precious gift that this Turing Award acknowledges is Dijkstra's style: his approach to programming as a high, intellectual challenge; his eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; and his illuminating perception of problems at the foundations of program design. He has published about a dozen papers, both technical and reflective, among which are especially to be noted his philosophical address at IFIP, his already classic papers on cooperating sequential processes, and his memorable indictment of the go-to statement. An influential series of letters by Dijkstra have recently surfaced as a polished monograph on the art of composing programs. We have come to value good programs in much the same way as we value good literature. And at the center of this movement, creating and reflecting patters no less beautiful than useful, stands E.W. Dijkstra.
[Extract from the Turing award Citation ready by M.D. McIlroy, chairman of the ACM Turing Award Committee, at the presentatiion of his lecture on August 14, 1972, at the ACM Annual Conference in Boston.]
1973 – Charles W. Bachman
Citation
For his outstanding contributions to database technology.
1974 – Donald E. Knuth
Citation
For his major contributions to the analysis of algorithms and the design of programming languages, and in particular for his contributions to the "art of computer programming" through his well-known books in a continuous series by this title.
1975 – Allen Newell
Citation
In joint scientific efforts extending over twenty years, initially in collaboration with J. C. Shaw at the RAND Corporation, and subsequentially with numerous faculty and student collegues at Carnegie-Mellon University, they have made basic contributions to artificial intelligence, the psychology of human cognition, and list processing.
1975 – Herbert A. Simon
Citation
In joint scientific efforts extending over twenty years, initially in collaboration with J. C. Shaw at the RAND Corporation, and subsequentially with numerous faculty and student collegues at Carnegie-Mellon University, they have made basic contributions to artificial intelligence, the psychology of human cognition, and list processing.
1976 – Michael O. Rabin
Citation
For their joint paper "Finite Automata and Their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.
1976 – Dana S Scott
Citation
For their joint paper "Finite Automata and Their Decision Problem," which introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their (Scott & Rabin) classic paper has been a continuous source of inspiration for subsequent work in this field.
[source:acm.org] |