## A.M. Turing Award

The Association for Computing Machinery began awarding the A. M. Turing Award in 1966, to recognize major contributions of lasting importance in computing. Through the years, it has become the most prestigious technical award in the field, often referred to as the "Nobel Prize of computing." A total of 14 Tau Bates have been honored with the award. They are:

Year | Award Recipient | Description |
---|---|---|

2017 | John Hennessy, Pennsylvania Theta '73 |
For pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry. |

2015 | Martin Hellman, New York Epsilon '66 |
For inventing and promulgating both asymmetric public-key cryptography, including its application to digital signatures, and a practical cryptographic key-exchange method. |

2012 | Shafi Goldwasser, Pennsylvania Gamma '79 |
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. |

2004 | Robert E. Kahn, New York Eta '60 |
For pioneering work on internetworking, including the design and implementation of the Internet's basic communications protocols, TCP/IP, and for inspired leadership in networking. |

1999 | Frederick Brooks, South Carolina Gamma '53 |
For landmark contributions to computer architecture, operating systems, and software engineering. |

1997 | Douglas Engelbart, Oregon Alpha '48 |
For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision. |

1994 | Edward A. Feigenbaum, Pennsylvania Gamma '56 |
For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology. |

1990 | Fernando J. Corbato, California Beta '58 |
For his pioneering work organizing the concepts and leading the development of the general-purpose, large-scale, time-sharing and resource-sharing computer systems, CTSS and Multics. |

1988 | Ivan Sutherland, Pennsylvania Gamma '59 |
For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after. |

1986 | John E. Hopcroft, Washington Gamma '61 |
For fundamental achievements in the design and analysis of algorithms and data structures. |

1986 | Robert E. Tarjan, California Beta '69 |
For fundamental achievements in the design and analysis of algorithms and data structures. |

1982 | Stephen A. Cook, Michigan Gamma '61 |
For his advancement of our understanding of the complexity of computation in a significant and profound way. His seminal paper, "The Complexity of Theorem Proving Procedures," presented at the 1971 ACM SIGACT Symposium on the Theory of Computing, laid the foundations for the theory of NP-Completeness. The ensuing exploration of the boundaries and nature of NP-complete class of problems has been one of the most active and important research activities in computer science for the last decade. |

1974 | Donald E. Knuth, Ohio Alpha '60 |
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. |

1973 | Charles W. Bachman, Michigan Alpha '48 |
For his outstanding contributions to database technology. |