SCS Faculty: Recipients of the A.M. Turing Award
--ACM's most prestigious technical award is accompanied by a cash prize and presented to an individual/s selected for contributions of a technical nature made to the computing community. The contributions are considered of "lasting and major technical importance to the computer field."

• Manuel Blum, 1995
  For contributions to the foundations of computational complexity theory and its application to cryptography and program checking

• Edmund M. Clarke, 2007(jointly with E. Allen Emerson and Joseph Sifakis)
  For their original and continuing research in a quality assurance process known as Model Checking.

• 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.

• Allen Newell*, 1975 (jointly with Herbert Simon)
  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, Inaugural Award
  For his influence in the area of advanced programming techniques and compiler construction.

• Raj Reddy, 1994 (jointly with Edward Feigenbaum)
  For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commerical impact of artificial intelligence technology.

• Herbert A. Simon*, 1975 (jointly with Allen Newell)
  For joint scient`ific efforts extending over twenty years, initially in collaboration with J.S. 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.

• Dana Scott, 1976 (jointly with Michael Rabin) (Emeritus)
  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 classic paper has been a continuous source of inspiration for subsequent work in this field.

• Leslie G. Valiant, 2010
  For transformative contributions to the theory of computation, including the theory of probably approximately correct (PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.
  ACM Releasse

  Alumni
  

• Edward Feigenbaum, 1994 (jointly with Raj Reddy)
  For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commerical impact of artificial intelligence technology.

• Shafi Goldwasser, 2012 (jointly with Silvio Micali)
  For transformative work that laid the complexity-theoretic foundations for the science of cryptography, and in the process pioneered new methods for efficient verification of mathematical proofs in complexity theory.

• Ivan 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.

  
  *Deceased List includes present and former faculty