A.M. Turing Award Winners
Named for "the father of computer science," Alan Mathison Turing, the award is given to an individual selected for contributions of a technical nature made to the computing community. It is considered to be the computing world's equivalent to the Nobel Prize and is handed out by the Association for Computing Machinery for contributions "of lasting and major technical importance to the computer field." There are ten Carnegie Mellon award winners, including its first-ever recipient.
Edmund M. Clarke, 2007
Computer Science Professor Edmund M. Clarke and two computer scientists from the University of Texas at Austin and the University of Grenoble in France, are winners of the 2007 A.M. Turing Award in recognition of their pioneering work on an automated method for finding design errors in computer hardware and software.
Manuel Blum, 1995
For contributions to the foundations of computational complexity theory and its application to cryptography and program checking.
Edward Feigenbaum and Raj Reddy, 1994
For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology.
Ivan E. Sutherland, 1988
For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after. Sketchpad, though written twenty-five years ago, introduced many techniques still important today. These include a display file for screen refresh, a recursively traversed hierarchical structure for modeling graphical objects, recursive methods for geometric transformations, and an object oriented programming style. Later innovations include a "Lorgnette" for viewing stereo or colored images, and elegant algorithms for registering digitized views, clipping polygons, and representing surfaces with hidden lines.
Robert W. Floyd, 1978
For having a clear influence on methodologies for the creation of efficient and reliable software, and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic program synthesis, and analysis of algorithms.
Dana Scott, 1976
(Awarded jointly with Michael Rabin)
For their joint paper "Finite Automata and Their Decision Problem." The paper introduced the idea of nondeterministic machines, which has proved to be an enormously valuable concept. Their classic paper has been a continuous source of inspiration for subsequent work in this field.
Allen Newell and Herbert A. Simon, 1975
For joint scientific efforts extending over twenty years, initially in collaboration with J.C. Shaw and subsequently with numerous faculty and students at Carnegie Mellon, they have made basic contributions to artificial intelligence, the psychology of human cognition, and list processing.
Alan J. Perlis, 1966
For his influence in the area of advanced programming techniques and compiler construction. Perlis was the first ever Turing winner.
More information can be found at the www.acm.org/awards.
