SUPPORT THE WORK

GetWiki

Turing Award

ARTICLE SUBJECTS
aesthetics  →
being  →
complexity  →
database  →
enterprise  →
ethics  →
fiction  →
history  →
internet  →
knowledge  →
language  →
licensing  →
linux  →
logic  →
method  →
news  →
perception  →
philosophy  →
policy  →
purpose  →
religion  →
science  →
sociology  →
software  →
truth  →
unix  →
wiki  →
ARTICLE TYPES
essay  →
feed  →
help  →
system  →
wiki  →
ARTICLE ORIGINS
critical  →
discussion  →
forked  →
imported  →
original  →
Turing Award
[ temporary import ]
please note:
- the content below is remote from Wikipedia
- it has been imported raw for GetWiki








factoids
weblink}}}}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 lasting and major technical importance to the computer field". The Turing Award is generally recognized as the highest distinction in computer science and the "Nobel Prize of computing".DASGUPTA > FIRST1=SANJOY FIRST2=CHRISTOS, Christos Papadimitriou first3=Umesh, Umesh Vazirani, Algorithms, McGraw-Hill, 2008, 978-0-07-352340-8, , p. 317.Bibliography of Turing Award lectures, DBLPWEB,weblink ACM'S Turing Award Prize Raised To $250,000, Association for Computing Machinery, ACM press release, 27 July 2007, 2008-10-16, Steven Geringer, dead,weblink" title="web.archive.org/web/20081230233653weblink">weblink 30 December 2008, See also: WEB,weblink Why there's no Nobel Prize in Computing, Brown, Bob, Network World, June 6, 2011, June 3, 2015, The award is named after Alan Turing, 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.BOOK, Homer, Steven and Alan L., Computability and Complexity Theory,weblink 35, 978-0-387-95055-6, 2007-11-05, 2001, From 2007 to 2013, the award was accompanied by an additional prize of US$250,000, with financial support provided by Intel and Google.WEB, A. M. Turing Award, ACM,weblink 2007-11-05, dead,weblink" title="web.archive.org/web/20091212132624weblink">weblink 2009-12-12, Since 2014, the award has been accompanied by a prize of US$1 million, with financial support provided by Google.WEB, ACM's Turing Award Prize Raised to $1 Million, ACM,weblink 2014-11-13, dead,weblink" title="web.archive.org/web/20151123032706weblink">weblink 2015-11-23, The first recipient, in 1966, was Alan Perlis, of Carnegie Mellon University. The first female recipient was Frances E. Allen of IBM in 2006.PRESS RELEASE, First Woman to Receive ACM Turing Award, The Association for Computing Machinery,weblinkweblink" title="web.archive.org/web/20070702034203weblink">weblink dead, July 2, 2007, February 21, 2007, 2007-11-05,

Recipients{| class"wikitable"

bgcolor="#ccccc"! style="width:10px" |Year! style="width:150px" |Recipient! Picture! Rationale!1966Alan Perlis>Alan J. Perliscomputer programming techniques and compiler construction.PERLIS DOI = 10.1145/321371.321372 JOURNAL = JOURNAL OF THE ACM PAGES = 1–9 PMID =, !1967|Maurice Wilkes80px)EDSAC, the first computer with an internally stored computer program>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.10.1145/321439.321440> TITLE = COMPUTERS THEN AND NOW VOLUME = 15 YEAR = 1968 FIRST1 = M. V., !1968|Richard Hamming|numerical methods, automatic coding systems, and error-detecting and error-correcting codes.10.1145/321495.321497 JOURNAL = JOURNAL OF THE ACM PAGES = 3–12 LAST1 = HAMMING, R. W., !1969|Marvin Minsky80px)artificial intelligence.10.1145/321574.321575 JOURNAL = JOURNAL OF THE ACM ISSUE = 2 YEAR = 1970 FIRST1 = M., !1970James H. Wilkinson>|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.10.1145/321637.321638 JOURNAL = JOURNAL OF THE ACM ISSUE = 2 YEAR = 1971 FIRST1 = J. H., !1971John McCarthy (computer scientist)>John McCarthy80px) JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 12 YEAR = 1987 FIRST1 = J.,weblink !1972|Edsger W. Dijkstra80px)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.10.1145/355604.361591 JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 10 YEAR = 1972 FIRST1 = E. W., !1973Charles Bachman>Charles W. Bachman80px)database technology.10.1145/355611.362534 JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 11 YEAR = 1973 FIRST1 = C. W., !1974Donald Knuth>Donald E. Knuth80px)The Art of Computer Programming" through his well-known books in a continuous series by this title.10.1145/361604.361612 JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 12 YEAR = 1974 FIRST1 = D. E., !rowspan=2|1975Allen 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.10.1145/360018.360022> TITLE = COMPUTER SCIENCE AS EMPIRICAL INQUIRY: SYMBOLS AND SEARCH VOLUME = 19 PAGES = 113 LAST1 = NEWELL LAST2 = SIMON, H. A., |Herbert A. Simon80px)!rowspan=2|1976|Michael O. Rabin80px)For their joint paper "Finite Automata and Their Decision Problem,"RABIN > FIRST1 = M. O. FIRST2 = D. TITLE = FINITE AUTOMATA AND THEIR DECISION PROBLEMS VOLUME = 3 PAGES = 114 PMID = 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.10.1145/359810.359816 JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 9 YEAR = 1977 FIRST1 = M. O., 10.1145/359810.359826> TITLE = LOGIC AND PROGRAMMING LANGUAGES VOLUME = 20 PAGES = 634–641 LAST1 = SCOTT, D. S., Dana Scott>Dana S. Scott80px)!1977|John Backus80px)FORTRAN, and for seminal publication of formal procedures for the specification of programming languages.10.1145/359576.359579 JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 8 YEAR = 1978 FIRST1 = J., !1978Robert W. Floyd>|computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic programming>automatic program synthesis, and analysis of algorithms.FLOYD > FIRST1 = R. W. URL = HTTP://DL.ACM.ORG/FT_GATEWAY.CFM?ID=359140&FTID=289772&DWN=1&CFID=285645736&CFTOKEN=55009136 JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 8 YEAR = 1979 PMC =, !1979|Kenneth E. Iverson80px)APL (programming language)>APL, for his contributions to the implementation of interactive systems, to educational uses of APL, and to programming language theory and practice.10.1145/358896.358899> TITLE = NOTATION AS A TOOL OF THOUGHT VOLUME = 23 PAGES = 444–465 LAST1 = IVERSON, K. E., !1980|Tony Hoare80px) JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 2 YEAR = 1981 FIRST1 = C. A. R., !1981|Edgar F. Codd|relational databases.CODD AUTHORLINK1 = EDGAR F. CODD DOI = 10.1145/358396.358400 VOLUME = 25 PAGES = 109–117 PMID =, !1982|Stephen A. Cook80px) JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 6 YEAR = 1983 FIRST1 = S. A., !rowspan=2|1983Ken Thompson (computer programmer)>Ken Thompson80px)For their development of generic operating systems theory and specifically for the implementation of the Unix operating system.A.M. TURING AWARD LAUREATE - KENNETH LANE THOMPSON URL=HTTPS://AMTURING.ACM.ORG/AWARD_WINNERS/THOMPSON_4588371.CFM URL=HTTPS://AMTURING.ACM.ORG/AWARD_WINNERS/RITCHIE_1506389.CFM, 4 November 2018, |Dennis M. Ritchie80px)!1984|Niklaus Wirth80px)Euler programming language>EULER, Algol-W, Modula>MODULA and Pascal.!1985|Richard M. Karp80px)|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.!rowspan=2|1986|John Hopcroft80px)For fundamental achievements in the design and analysis of algorithms and data structures.|Robert Tarjan80px)!1987John 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 Sutherland80px)|For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after.!1989|William Kahan80px)numerical analysis. One of the foremost experts on floating point>floating-point computations. Kahan has dedicated himself to "making the world safe for numerical computations."!1990|Fernando J. Corbató80px)time-sharing and resource-sharing computer systems, Compatible Time-Sharing System>CTSS and Multics.!1991Robin Milner>|LCF theorem prover>LCF, the mechanization of Scott's Logic of Computable Functions, probably the first theoretically based yet practical tool for automated theorem proving; 2) ML programming language>ML, the first language to include polymorphic type inference together with a type safety exception handling>exception-handling mechanism; 3) calculus of communicating systems, a general theory of concurrency (computer science)>concurrency. In addition, he formulated and strongly advanced full abstraction, the study of the relationship between operational semantics and denotational semantics>denotational semantics.MILNER > FIRST1 = R. TITLE = ELEMENTS OF INTERACTION: TURING AWARD LECTURE VOLUME = 36 YEAR = 1993 PMC =, !1992|Butler W. Lampson80px)workstations, computer network>networks, operating systems, programming systems, computer display, computer security>security and document publishing.!rowspan=2|1993|Juris Hartmanis80px)In recognition of their seminal paper which established the foundations for the field of computational complexity theory.10.1145/188280.188379> TITLE = TURING AWARD LECTURE: IT'S TIME TO RECONSIDER TIME VOLUME = 37 PAGES = 95–99 LAST1 = STEARNS, R. E., |Richard E. Stearns80px)!rowspan=2|1994|Edward Feigenbaum80px)For pioneering the design and construction of large scale artificial intelligence systems, demonstrating the practical importance and potential commercial impact of artificial intelligence technology.REDDY > FIRST1 = R. DOI = 10.1145/229459.233436 VOLUME = 39 PAGES = 105–112 PMID =, |Raj Reddy80px)!1995|Manuel Blum80px)computational complexity theory and its application to cryptography and program verification>program checking.A.M. TURING AWARD LAUREATE - MANUEL BLUM> WEBSITE=AMTURING.ACM.ORG ACCESS-DATE=4 NOVEMBER 2018, !1996|Amir Pnueli80px)temporal logic into computing science and for outstanding contributions to program and systems formal verification>verification.A.M. TURING AWARD LAUREATE - AMIR PNUELI > WEBSITE=AMTURING.ACM.ORG ACCESS-DATE=4 NOVEMBER 2018, !1997|Douglas Engelbart80px),weblink 4 November 2018,
!1998Jim Gray (computer scientist)>Jim Gray80px)|For seminal contributions to database and transaction processing research and technical leadership in system implementation.!1999Frederick P. Brooks>Frederick P. Brooks, Jr.80px)|For landmark contributions to computer architecture, operating systems, and software engineering.!2000|Andrew Chi-Chih Yao80px)theory of computation, including the complexity-based theory of pseudorandom number generator>pseudorandom number generation, cryptography, and communication complexity.!rowspan=2|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.|Kristen Nygaard80px)!rowspan=3|2002Ron Rivest>Ronald L. Rivest80px)For their ingenious contribution for making public-key cryptography useful in practice.|Adi Shamir80px)Leonard Adleman>Leonard M. Adleman80px)!2003|Alan Kay80px)|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.!rowspan=2|2004|Vinton G. Cerf80px)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.|Robert E. Kahn80px)!2005|Peter Naur80px)programming language design and the definition of ALGOL>ALGOL 60, to compiler design, and to the art and practice of computer programming.!2006|Frances E. Allen80px)|For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution.!rowspan=3|2007|Edmund M. Clarke80px)For their roles in developing model checking into a highly effective verification technology, widely adopted in the hardware and software industries.2007 Turing Award Winners Announced|E. Allen Emerson||Joseph Sifakis80px)!2008|Barbara Liskov80px)|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. Thacker80px)|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. Valiant80px)theory of computation, including the theory of probably approximately correct (Probably approximately correct learning>PAC) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.!2011Judea PearlPEARL YEAR = 2011 JOURNAL = ACM TURING AWARD LECTURES ISSUE = ISBN = 978-1-4503-1049-9 DOI = 10.1145/1283920.2351636 FORMAT = MP4 DOI-BROKEN-DATE = 2019-08-20, 80px)PUBLISHER=ACM, !rowspan=2|2012|Silvio Micali80px)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.HTTP://WWW.ACM.ORG/PRESS-ROOM/NEWS-RELEASES/2013/TURING-AWARD-12/ >TITLE=TURING AWARD 2012 URL-STATUS=DEAD ARCHIVEDATE=2013-03-18, |Shafi Goldwasser80px)!2013|Leslie Lamport80px)PUBLISHER=ACM, LAMPORT > FIRST1 = L. TITLE = TIME, CLOCKS, AND THE ORDERING OF EVENTS IN A DISTRIBUTED SYSTEM JOURNAL = COMMUNICATIONS OF THE ACM ISSUE = 7 YEAR = 1978 CITESEERX = 10.1.1.155.4742, !2014|Michael Stonebraker80px)PUBLISHER=ACM, !rowspan=2|2015|Martin E. Hellman80px) For fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography,"DIFFIE>FIRST1=W.FIRST2=M.JOURNAL=IEEE TRANSACTIONS ON INFORMATION THEORYISSUE=6PAGES=644–654DOI=10.1109/TIT.1976.1055638, 10.1.1.37.9720, introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the Internet today.HTTP://AMTURING.ACM.ORG/AWARD_WINNERS/DIFFIE_8371646.CFM>TITLE=CRYPTOGRAPHY PIONEERS RECEIVE 2015 ACM A.M. TURING AWARD, ACM, |Whitfield Diffie80px)!2016|Tim Berners-Lee80px)World Wide Web, the first web browser, and the fundamental protocols and algorithms allowing the Web to scale.HTTP://AMTURING.ACM.ORG/AWARD_WINNERS/BERNERS-LEE_8087960.CFMPUBLISHER=ACM, !rowspan=2|2017|John L. Hennessy80px)For pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry.HTTPS://WWW.ACM.ORG/MEDIA-CENTER/2018/MARCH/TURING-AWARD-2017>TITLE=PIONEERS OF MODERN COMPUTER ARCHITECTURE RECEIVE ACM A.M. TURING AWARD, ACM, David Patterson (computer scientist)>David A. Patterson80px)!rowspan=3|2018|Yoshua Bengio80px)For conceptual and engineering breakthroughs that have made deep neural networks a critical component of computing.Fathers of the Deep Learning Revolution Receive ACM A.M. Turing Award|Geoffrey Hinton80px)|Yann LeCun80px)

See also

References

{{reflist|30em}}

External links

{{commons category|Turing Award}} {{Turing award|state=expanded}}{{Association for Computing Machinery}}

- content above as imported from Wikipedia
- "Turing Award" does not exist on GetWiki (yet)
- time: 11:13pm EST - Wed, Nov 13 2019
[ this remote article is provided by Wikipedia ]
LATEST EDITS [ see all ]
GETWIKI 09 JUL 2019
Eastern Philosophy
History of Philosophy
GETWIKI 09 MAY 2016
GETWIKI 18 OCT 2015
M.R.M. Parrott
Biographies
GETWIKI 20 AUG 2014
GETWIKI 19 AUG 2014
CONNECT