Wikipedia
Turing Award
The ACM A. M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) for contributions of lasting and major technical importance to computer science.[2] It is generally recognized as the highest distinction in computer science and is colloquially known as or often referred to as the "Nobel Prize of Computing".[3][4][5][6]
| ACM Turing Award | |
|---|---|
| Awarded for | Outstanding contributions in computer science |
| Country | United States |
| Presented by | Association for Computing Machinery (ACM) |
| Reward(s) | US $1,000,000[1] |
| First awarded | 1966 |
| Last awarded | 2021 |
| Website | amturing |
The award is named after Alan Turing, who was a British mathematician and reader in mathematics at the University of Manchester. Turing is often credited as being the key founder of theoretical computer science and artificial intelligence.[7] From 2007 to 2013, the award was accompanied by an additional prize of US$250,000, with financial support provided by Intel and Google.[2] Since 2014, the award has been accompanied by a prize of US$1 million, with financial support provided by Google.[1][8]
The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. The first female recipient was Frances E. Allen of IBM in 2006.[9] The latest recipient, in 2021, is Jack Dongarra, of the University of Tennessee.
Recipients
| Year | Recipient(s) | Photo | Rationale | Affiliated institute(s) |
|---|---|---|---|---|
| 1966 | Alan Perlis | For his influence in the area of advanced computer programming techniques and compiler construction.[10] | Carnegie Mellon University | |
| 1967 | Maurice Wilkes | 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.[11] | University of Cambridge | |
| 1968 | Richard Hamming | For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes.[12] | Bell Labs | |
| 1969 | Marvin Minsky | For his central role in creating, shaping, promoting, and advancing the field of artificial intelligence.[13] | Massachusetts Institute of Technology | |
| 1970 | James H. Wilkinson | For his research in numerical analysis to facilitate the use of the high-speed digital computer, having received special recognition for his work in computations in linear algebra and "backward" error analysis.[14] | National Physical Laboratory | |
| 1971 | John McCarthy | McCarthy's lecture "The Present State of Research on Artificial Intelligence" is a topic that covers the area in which he has achieved considerable recognition for his work.[15] | Stanford University | |
| 1972 | Edsger W. Dijkstra | Edsger Dijkstra was a principal contributor in the late 1950s to the development of the ALGOL, a high level programming language which has become a model of clarity and mathematical rigor. He is one of the principal proponents of the science and art of programming languages in general, and has greatly contributed to our understanding of their structure, representation, and implementation. His fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the field of programming languages.[16] | Centrum Wiskunde & Informatica, Eindhoven University of Technology | |
| 1973 | Charles Bachman | For his outstanding contributions to database technology.[17] | General Electric Research Laboratory (now under Groupe Bull, an Atos company) | |
| 1974 | Donald Knuth | 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.[18] | California Institute of Technology, Center for Communications Research, Center for Communications and Computing, Institute for Defense Analyses, Stanford University | |
| 1975 | Allen Newell | In joint scientific efforts extending over twenty years, initially in collaboration with J. C. Shaw at the RAND Corporation, and subsequently with numerous faculty and student colleagues at Carnegie Mellon University, they have made basic contributions to artificial intelligence, the psychology of human cognition, and list processing.[19] | RAND Corporation, Carnegie Mellon University | |
| Herbert A. Simon | ||||
| 1976 | Michael O. Rabin | For their joint paper "Finite Automata and Their Decision Problem",[20] 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.[21][22] | Princeton University | |
| Dana Scott | University of Chicago | |||
| 1977 | John Backus | For profound, influential, and lasting contributions to the design of practical high-level programming systems, notably through his work on FORTRAN, and for seminal publication of formal procedures for the specification of programming languages.[23] | IBM | |
| 1978 | Robert W. Floyd | 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.[24] | Carnegie Mellon University, Stanford University | |
| 1979 | Kenneth E. Iverson | For his pioneering effort in programming languages and mathematical notation resulting in what the computing field now knows as APL, for his contributions to the implementation of interactive systems, to educational uses of APL, and to programming language theory and practice.[25] | IBM | |
| 1980 | Tony Hoare | For his fundamental contributions to the definition and design of programming languages.[26] | Queen's University Belfast, University of Oxford | |
| 1981 | Edgar F. Codd | For his fundamental and continuing contributions to the theory and practice of database management systems, esp. relational databases.[27] | IBM | |
| 1982 | Stephen Cook | For his advancement of our understanding of the complexity of computation in a significant and profound way.[28] | University of Toronto | |
| 1983 | Ken Thompson | For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system.[29][30] | Bell Labs | |
| Dennis Ritchie | ||||
| 1984 | Niklaus Wirth | For developing a sequence of innovative computer languages, EULER, ALGOL-W, Pascal, MODULA and Oberon. | Stanford University, University of Zurich, ETH Zurich | |
| 1985 | Richard M. Karp | For his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other combinatorial optimization problems, the identification of polynomial-time computability with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of NP-completeness. | University of California, Berkeley | |
| 1986 | John Hopcroft | For fundamental achievements in the design and analysis of algorithms and data structures. | Cornell University | |
| Robert Tarjan | Stanford University, Cornell University, University of California, Berkeley | |||
| 1987 | John Cocke | For significant contributions in the design and theory of compilers, the architecture of large systems and the development of reduced instruction set computers (RISC). | IBM | |
| 1988 | Ivan Sutherland | For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after. | Stanford University, Harvard University, University of Utah, California Institute of Technology | |
| 1989 | William Kahan | For his fundamental contributions to numerical analysis. One of the foremost experts on floating-point computations. Kahan has dedicated himself to "making the world safe for numerical computations." | University of California, Berkeley | |
| 1990 | Fernando J. Corbató | 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. | Massachusetts Institute of Technology | |
| 1991 | Robin Milner | For three distinct and complete achievements: 1) LCF, the mechanization of Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool for machine assisted proof construction; 2) ML, the first language to include polymorphic type inference together with a type-safe exception-handling mechanism; 3) CCS, a general theory of concurrency. In addition, he formulated and strongly advanced full abstraction, the study of the relationship between operational and denotational semantics.[31] | Stanford University, University of Edinburgh | |
| 1992 | Butler Lampson | For contributions to the development of distributed, personal computing environments and the technology for their implementation: workstations, networks, operating systems, programming systems, displays, security and document publishing. | PARC, DEC | |
| 1993 | Juris Hartmanis | In recognition of their seminal paper which established the foundations for the field of computational complexity theory.[32] | General Electric Research Laboratory (now under Groupe Bull, an Atos company) | |
| Richard E. Stearns | ||||
| 1994 | Edward Feigenbaum | For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology.[33] | Stanford University | |
| Raj Reddy | Stanford University, Carnegie Mellon University | |||
| 1995 | Manuel Blum | In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.[34] | University of California, Berkeley | |
| 1996 | Amir Pnueli | For seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification.[35] | Stanford University, Tel Aviv University, Weizmann Institute of Science | |
| 1997 | Douglas Engelbart | For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision.[36] | SRI International, Tymshare, McDonnell Douglas, Bootstrap Institute/Alliance,[37] The Doug Engelbart Institute | |
| 1998 | Jim Gray | For seminal contributions to database and transaction processing research and technical leadership in system implementation. | IBM, Microsoft | |
| 1999 | Fred Brooks | For landmark contributions to computer architecture, operating systems, and software engineering. | IBM, University of North Carolina at Chapel Hill | |
| 2000 | Andrew Yao | In recognition of his fundamental contributions to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. | Stanford University, University of California, Berkeley, Princeton University | |
| 2001 | Ole-Johan Dahl | For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I and Simula 67. | Norwegian Computing Center | |
| Kristen Nygaard | ||||
| 2002 | Ron Rivest | For their ingenious contribution for making public-key cryptography useful in practice. | Massachusetts Institute of Technology | |
| Adi Shamir | ||||
| Leonard Adleman | University of Southern California | |||
| 2003 | Alan Kay | For pioneering many of the ideas at the root of contemporary object-oriented programming languages, leading the team that developed Smalltalk, and for fundamental contributions to personal computing. | University of Utah, PARC, Stanford University, Atari, Apple ATG, Walt Disney Imagineering, Viewpoints Research Institute, HP Labs | |
| 2004 | Vint Cerf | 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. | University of California, Los Angeles, Stanford University, DARPA, MCI (now under Verizon), CNRI, Google | |
| Bob Kahn | MIT, Bolt Beranek and Newman, DARPA, CNRI | |||
| 2005 | Peter Naur | For fundamental contributions to programming language design and the definition of ALGOL 60, to compiler design, and to the art and practice of computer programming. | Regnecentralen (now under Fujitsu), University of Copenhagen | |
| 2006 | Frances Allen | For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution. | IBM | |
| 2007 | Edmund M. Clarke | For their roles in developing model checking into a highly effective verification technology, widely adopted in the hardware and software industries.[38] | Harvard University, Carnegie Mellon University | |
| E. Allen Emerson | Harvard University | |||
| Joseph Sifakis | French National Centre for Scientific Research | |||
| 2008 | Barbara Liskov | For contributions to practical and theoretical foundations of programming language and system design, especially related to data abstraction, fault tolerance, and distributed computing. | Massachusetts Institute of Technology | |
| 2009 | Charles P. Thacker | For his pioneering design and realization of the Xerox Alto, the first modern personal computer, and in addition for his contributions to the Ethernet and the Tablet PC. | PARC, DEC, Microsoft Research | |
| 2010 | Leslie Valiant | 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. | Harvard University | |
| 2011 | Judea Pearl[39] | For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.[40] | University of California, Los Angeles New Jersey Institute of Technology | |
| 2012 | 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.[41] | Massachusetts Institute of Technology | |
| Shafi Goldwasser | Massachusetts Institute of Technology, Weizmann Institute of Science | |||
| 2013 | Leslie Lamport | For fundamental contributions to the theory and practice of distributed and concurrent systems, notably the invention of concepts such as causality and logical clocks, safety and liveness, replicated state machines, and sequential consistency.[42][43] | Massachusetts Computer Associates (now under Essig PLM), SRI International, DEC, Compaq (now under HP), Microsoft Research | |
| 2014 | Michael Stonebraker | For fundamental contributions to the concepts and practices underlying modern database systems.[44] | University of California, Berkeley, Massachusetts Institute of Technology | |
| 2015 | Whitfield Diffie | For fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography",[45] introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the Internet today.[46] | Stanford University | |
| Martin Hellman | ||||
| 2016 | Tim Berners-Lee | For inventing the World Wide Web, the first web browser, and the fundamental protocols and algorithms allowing the Web to scale.[47] | CERN, Massachusetts Institute of Technology, World Wide Web Consortium | |
| 2017 | John L. Hennessy | For pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry.[48] | Stanford University | |
| David Patterson | University of California, Berkeley | |||
| 2018 | Yoshua Bengio | For conceptual and engineering breakthroughs that have made deep neural networks a critical component of computing.[49] | Université de Montréal, McGill University, Mila | |
| Geoffrey Hinton | University of Toronto, University of California, San Diego, Carnegie Mellon University, University College London, University of Edinburgh, Google AI | |||
| Yann LeCun | Bell Labs, New York University, Meta AI | |||
| 2019 | Edwin Catmull | For fundamental contributions to 3-D computer graphics, and the revolutionary impact of these techniques on computer-generated imagery (CGI) in filmmaking and other applications.[50] | University of Utah, Pixar, Walt Disney Animation Studios | |
| Pat Hanrahan | Pixar, Princeton University, Stanford University | |||
| 2020 | Alfred Aho | For fundamental algorithms and theory underlying programming language implementation and for synthesizing these results and those of others in their highly influential books, which educated generations of computer scientists.[51] | Bell Labs, Columbia University | |
| Jeffrey Ullman | Bell Labs, Princeton University, Stanford University | |||
| 2021 | Jack Dongarra | For pioneering contributions to numerical algorithms and libraries that enabled high performance computational software to keep pace with exponential hardware improvements for over four decades.[52] | Argonne National Laboratory, Oak Ridge National Laboratory, University of Manchester, Texas A&M University Institute for Advanced Study, University of Tennessee, Rice University |
See also
References
- ^ a b Cacm Staff (2014). "ACM's Turing Award prize raised to $1 million". Communications of the ACM. 57 (12): 20. doi:10.1145/2685372.
- ^ a b . ACM. Archived from the original on December 12, 2009. Retrieved November 5, 2007.
- ^ Dasgupta, Sanjoy; Papadimitriou, Christos; Vazirani, Umesh (2008). Algorithms. McGraw-Hill. p. 317. ISBN 978-0-07-352340-8.
- ^ Bibliography of Turing Award lectures, DBLP
- ^ Geringer, Steven (July 27, 2007). . ACM press release. Archived from the original on December 30, 2008. Retrieved October 16, 2008.
- ^ Brown, Bob (June 6, 2011). "Why there's no Nobel Prize in Computing". Network World. Retrieved June 3, 2015.
- ^ Homer, Steven and Alan L. (2001). Computability and Complexity Theory. p. 35. ISBN 978-0-387-95055-6. Retrieved November 5, 2007.
- ^ . ACM. Archived from the original on November 23, 2015. Retrieved November 13, 2014.
- ^ (Press release). The Association for Computing Machinery. February 21, 2007. Archived from the original on July 2, 2007. Retrieved November 5, 2007.
- ^ Perlis, A. J. (1967). "The Synthesis of Algorithmic Systems". Journal of the ACM. 14: 1–9. doi:10.1145/321371.321372. S2CID 12937998.
- ^ Wilkes, M. V. (1968). "Computers then and Now". Journal of the ACM. 15: 1–7. doi:10.1145/321439.321440. S2CID 9846847.
- ^ Hamming, R. W. (1969). "One Man's View of Computer Science". Journal of the ACM. 16: 3–12. doi:10.1145/321495.321497. S2CID 6868310.
- ^ Minsky, M. (1970). "Form and Content in Computer Science (1970 ACM turing lecture)". Journal of the ACM. 17 (2): 197–215. doi:10.1145/321574.321575. S2CID 15661281.
- ^ Wilkinson, J. H. (1971). "Some Comments from a Numerical Analyst". Journal of the ACM. 18 (2): 137–147. doi:10.1145/321637.321638. S2CID 37748083.
- ^ McCarthy, J. (1987). "Generality in artificial intelligence". Communications of the ACM. 30 (12): 1030–1035. doi:10.1145/33447.33448. S2CID 1045033.
- ^ Dijkstra, E. W. (1972). "The humble programmer". Communications of the ACM. 15 (10): 859–866. doi:10.1145/355604.361591.
- ^ Bachman, C. W. (1973). "The programmer as navigator". Communications of the ACM. 16 (11): 653–658. doi:10.1145/355611.362534.
- ^ Knuth, D. E. (1974). "Computer programming as an art". Communications of the ACM. 17 (12): 667–673. doi:10.1145/361604.361612.
- ^ Newell, A.; Simon, H. A. (1976). "Computer science as empirical inquiry: Symbols and search". Communications of the ACM. 19 (3): 113. doi:10.1145/360018.360022.
- ^ Rabin, M. O.; Scott, D. (1959). "Finite Automata and Their Decision Problems". IBM Journal of Research and Development. 3 (2): 114. doi:10.1147/rd.32.0114. S2CID 3160330.
- ^ Rabin, M. O. (1977). "Complexity of computations". Communications of the ACM. 20 (9): 625–633. doi:10.1145/359810.359816.
- ^ Scott, D. S. (1977). "Logic and programming languages". Communications of the ACM. 20 (9): 634–641. doi:10.1145/359810.359826.
- ^ Backus, J. (1978). "Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs". Communications of the ACM. 21 (8): 613–641. doi:10.1145/359576.359579.
- ^ Floyd, R. W. (1979). "The paradigms of programming". Communications of the ACM. 22 (8): 455–460. doi:10.1145/359138.359140.
- ^ Iverson, K. E. (1980). "Notation as a tool of thought". Communications of the ACM. 23 (8): 444–465. doi:10.1145/358896.358899.
- ^ Hoare, C. A. R. (1981). "The emperor's old clothes". Communications of the ACM. 24 (2): 75–83. doi:10.1145/358549.358561.
- ^ Codd, E. F. (1982). "Relational database: A practical foundation for productivity". Communications of the ACM. 25 (2): 109–117. doi:10.1145/358396.358400.
- ^ Cook, S. A. (1983). "An overview of computational complexity". Communications of the ACM. 26 (6): 400–408. doi:10.1145/358141.358144.
- ^ "A.M. Turing Award Laureate – Kenneth Lane Thompson". amturing.acm.org. Retrieved November 4, 2018.
- ^ "A.M. Turing Award Laureate – Dennis M. Ritchie". amturing.acm.org. Retrieved November 4, 2018.
- ^ Milner, R. (1993). "Elements of interaction: Turing award lecture". Communications of the ACM. 36: 78–89. doi:10.1145/151233.151240.
- ^ Stearns, R. E. (1994). "Turing Award lecture: It's time to reconsider time". Communications of the ACM. 37 (11): 95–99. doi:10.1145/188280.188379.
- ^ Reddy, R. (1996). "To dream the possible dream". Communications of the ACM. 39 (5): 105–112. doi:10.1145/229459.233436.
- ^ "A.M. Turing Award Laureate – Manuel Blum". amturing.acm.org. Retrieved November 4, 2018.
- ^ "A.M. Turing Award Laureate – Amir Pnueli". amturing.acm.org. Retrieved November 4, 2018.
- ^ "A.M. Turing Award Laureate – Douglas Engelbart". amturing.acm.org. Retrieved November 4, 2018.
- ^ . The Doug Engelbart Institute. Archived from the original on July 14, 2012. Retrieved June 17, 2012.
- ^ "2007 Turing Award Winners Announced".
- ^ Pearl, Judea (2011). The Mechanization of Causal Inference: A "mini" Turing Test and Beyond (mp4). ACM Turing Award Lectures. doi:10.1145/1283920. ISBN 978-1-4503-1049-9.
- ^ "Judea Pearl". ACM.
- ^ . ACM. Archived from the original on March 18, 2013.
- ^ "Turing award 2013". ACM.
- ^ Lamport, L. (1978). "Time, clocks, and the ordering of events in a distributed system" (PDF). Communications of the ACM. 21 (7): 558–565. CiteSeerX 10.1.1.155.4742. doi:10.1145/359545.359563. S2CID 215822405.
- ^ "Turing award 2014". ACM.
- ^ Diffie, W.; Hellman, M. (1976). "New directions in cryptography" (PDF). IEEE Transactions on Information Theory. 22 (6): 644–654. CiteSeerX 10.1.1.37.9720. doi:10.1109/TIT.1976.1055638.
- ^ "Cryptography Pioneers Receive 2015 ACM A.M. Turing Award". ACM.
- ^ "Turing award 2016". ACM.
- ^ "Pioneers of Modern Computer Architecture Receive ACM A.M. Turing Award". ACM.
- ^ "Fathers of the Deep Learning Revolution Receive ACM A.M. Turing Award".
- ^ Pioneers of Modern Computer Graphics Recognized with ACM A.M. Turing Award – Hanrahan and Catmull's Innovations Paved the Way for Today's 3-D Animated Films. Retrieved March 19, 2020.
- ^ ACM Turing Award Honors Innovators Who Shaped the Foundations of Programming Language Compilers and Algorithms. Retrieved March 31, 2021.
- ^ "Open Graph Title: University of Tennessee's Jack Dongarra receives 2021 ACM A.M. Turing Award". awards.acm.org. Retrieved March 30, 2022.
External links
Wikimedia Commons has media related to Turing Award.
- ACM Chronological listing of Turing Laureates
- Visualizing Turing Award Laureates
- ACM A.M. Turing Award Centenary Celebration
- ACM A.M. Turing Award Laureate Interviews
- Celebration of 50 Years of the ACM A.M. Turing Award