Turing Award
From Wikipedia, the free encyclopedia
(Redirected from A. M. Turing Award)
| ACM Turing Award | |
|---|---|
| Awarded for | Outstanding contributions in computer science |
| Country | New York, (United States) |
| Presented by | Association for Computing Machinery (ACM) |
| Reward | US $250,000 |
| First awarded | 1966 |
| Last awarded | 2012 |
| Official website | amturing.acm.org |
The ACM A.M. Turing Award is an annual prize given by the Association for Computing Machinery (ACM) to "an individual selected for contributions of a technical nature made to the computing community". It is stipulated that "The contributions should be of lasting and major technical importance to the computer field".[1] The Turing Award is recognized as the "highest distinction in Computer science"[2] and "Nobel Prize of computing".[3]
The award is named after Alan Turing, mathematician and reader in mathematics at the University of Manchester. Turing is "frequently credited for being the Father of theoretical computer science and artificial intelligence".[4] As of 2007, the award is accompanied by a prize of $250,000, with financial support provided by Intel and Google.[1]
The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. Frances E. Allen of IBM, in 2006, was the first female recipient in the award's forty year history.[5][6][7] The 2008 award also went to a woman, Barbara Liskov.
Recipients [edit]
| Year | Recipients | Citation |
|---|---|---|
| 1966 |  Alan J. Perlis[8] |
For his influence in the area of advanced computer programming techniques and compiler construction |
| 1967 |  Maurice Wilkes |
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 |
For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes |
| 1969 | Marvin Minsky |
artificial intelligence |
| 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 |
| 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 |
| 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 |
| 1973 | Charles W. Bachman |
For his outstanding contributions to database technology |
| 1974 | Donald E. 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 |
| 1975 | Allen Newell and Herbert A. Simon |
In joint scientific efforts extending over twenty years, initially in collaboration with J. C. Shaw at the RAND Corporation, and subsequentially [sic] 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 |
| 1976 |  Michael O. Rabin and Dana S. Scott |
For their joint paper "Finite Automata and Their Decision Problem,"[9] 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 |
| 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 |
| 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 |
| 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 |
| 1980 | C. Antony R. Hoare |
For his fundamental contributions to the definition and design of programming languages |
| 1981 | Edgar F. Codd |
For his fundamental and continuing contributions to the theory and practice of database management systems, esp. relational databases |
| 1982 | Stephen A. Cook |
For his advancement of our understanding of the complexity of computation in a significant and profound way |
| 1983 | Ken Thompson and Dennis M. Ritchie |
For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system |
| 1984 |  Niklaus Wirth |
For developing a sequence of innovative computer languages, EULER, ALGOL-W, MODULA and Pascal |
| 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 |
| 1986 | John Hopcroft and Robert Tarjan |
For fundamental achievements in the design and analysis of algorithms and data structures |
| 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) |
| 1988 | Ivan Sutherland |
For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after |
| 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." |
| 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. |
| 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. |
| 1992 | Butler W. 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. |
| 1993 | Juris Hartmanis and Richard E. Stearns |
In recognition of their seminal paper which established the foundations for the field of computational complexity theory. |
| 1994 | Edward Feigenbaum and Raj Reddy |
For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology.[10] |
| 1995 |  Manuel Blum |
In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking. |
| 1996 | Amir Pnueli |
For seminal work introducing temporal logic into computing science and for outstanding contributions to program and systems verification. |
| 1997 | Douglas Engelbart |
For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision. |
| 1998 | Jim Gray |
For seminal contributions to database and transaction processing research and technical leadership in system implementation. |
| 1999 | Frederick P. Brooks, Jr. |
For landmark contributions to computer architecture, operating systems, and software engineering. |
| 2000 |  Andrew Chi-Chih 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. |
| 2001 |  Ole-Johan Dahl and Kristen Nygaard |
For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I and Simula 67. |
| 2002 | Ronald L. Rivest, Adi Shamir and Leonard M. Adleman |
For their ingenious contribution for making public-key cryptography useful in practice. |
| 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. |
| 2004 | Vinton G. Cerf and Robert E. Kahn |
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. |
| 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. |
| 2006 | Frances E. 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. |
| 2007 | Edmund M. Clarke, E. Allen Emerson and  Joseph Sifakis |
For [their roles] in developing model checking into a highly effective verification technology, widely adopted in the hardware and software industries.[11] |
| 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. |
| 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. |
| 2010 | Leslie G. 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. |
| 2011 | Judea Pearl[12] |
For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.[13] |
| 2012 |  Silvio Micali Shafi Goldwasser |
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.[14] |
See also [edit]
- List of Turing Award laureates by university affiliation
- Nobel Prize
- IEEE John von Neumann Medal
- Schock Prize
- Nevanlinna Prize
References [edit]
- ^ a b "A. M. Turing Award". ACM. Retrieved 2007-11-05.
- ^ Dasgupta, Sanjoy; Papadimitriou, Christos; Vazirani, Umesh (2008). Algorithms. McGraw-Hill. ISBN 978-0-07-352340-8, p. 317.
- ^ Steven Geringer (27 July 2007). "ACM'S Turing Award Prize Raised To $250,000". ACM press release. Retrieved 2008-10-16.
- ^ Homer, Steven and Alan L. (2001). Computability and Complexity Theory. Springer via Google Books limited view. p. 35. ISBN 0-387-95055-9. Retrieved 2007-11-05.
- ^ "First Woman to Receive ACM Turing Award" (Press release). The Association for Computing Machinery. February 21, 2007. Retrieved 2007-11-05.
- ^ Marianne Kolbasuk McGee (February 26, 2007, online February 24, 2007). "There's Still A Shortage Of Women In Tech, First Female Turing Award Winner Warns". InformationWeek (CMP Media). Retrieved 2007-11-05.
- ^ Perelman, Deborah (February 27, 2007). "Turing Award Anoints First Female Recipient". eWEEK (Ziff Davis Enterprise). Retrieved 2007-11-05.
- ^ Perlis, A. J. (1967). "The Synthesis of Algorithmic Systems". Journal of the ACM 14: 1. doi:10.1145/321371.321372.
- ^ 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.
- ^ Reddy, R. (1996). "To dream the possible dream". Communications of the ACM 39 (5): 105. doi:10.1145/229459.233436.
- ^ 2007 Turing Award Winners Announced
- ^ doi:10.1145/1283920.2351636
This citation will be automatically completed in the next few minutes. You can jump the queue or expand by hand - ^ "Judea Pearl". ACM.
- ^ "Turing award 2012". ACM.
External links [edit]
 |
Wikimedia Commons has media related to: Turing Award |
