Premio Turing: Malsamoj inter versioj
| [nekontrolita versio] | [nekontrolita versio] |
Enhavo forigita Enhavo aldonita
YMS (diskuto | kontribuoj) +Michael Stonebraker (http://amturing.acm.org/award_winners/stonebraker_1172121.cfm), +Leslie Lamport (http://amturing.acm.org/award_winners/lamport_1205376.cfm) |
8zu (diskuto | kontribuoj) →Ricevintoj de la premio: alfishi anglan tabelon |
||
Linio 2:
== Ricevintoj de la premio ==
{| class="wikitable"
|- bgcolor="#ccccc"
! style="width:7%" |Jaro
! style="width:20%" | Ricevinto
! Kontribuo
|-
!1966
|[[Alan Perlis|Alan J. Perlis]]
|For his influence in the area of advanced [[computer programming]] techniques and [[compiler]] construction<ref>{{Cite journal | last1 = Perlis | first1 = A. J. | doi = 10.1145/321371.321372 | title = The Synthesis of Algorithmic Systems | journal = Journal of the ACM | volume = 14 | pages = 1 | year = 1967 | pmid = | pmc = }}</ref>
|-
!1967
|[[Maurice Wilkes]]
|Professor Wilkes is best known as the builder and designer of the [[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<ref>{{Cite journal | doi = 10.1145/321439.321440| title = Computers then and Now| journal = Journal of the ACM| volume = 15| pages = 1| year = 1968| last1 = Wilkes | first1 = M. V. }}</ref>
|-
!1968
|[[Richard Hamming]]
|For his work on [[numerical methods]], automatic coding systems, and error-detecting and error-correcting codes<ref>{{Cite journal | doi = 10.1145/321495.321497| title = One Man's View of Computer Science| journal = Journal of the ACM| volume = 16| pages = 3| year = 1969| last1 = Hamming | first1 = R. W.}}</ref>
|-
!1969
|[[Marvin Minsky]]
|For his central role in creating, shaping, promoting, and advancing the field of [[artificial intelligence]].<ref>{{Cite journal | doi = 10.1145/321574.321575| title = Form and Content in Computer Science (1970 ACM turing lecture)| journal = Journal of the ACM| volume = 17| issue = 2| pages = 197| year = 1970| last1 = Minsky | first1 = M. }}</ref>
|-
!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<ref>{{Cite journal | doi = 10.1145/321637.321638| title = Some Comments from a Numerical Analyst| journal = Journal of the ACM| volume = 18| issue = 2| pages = 137| year = 1971| last1 = Wilkinson | first1 = J. H.}}</ref>
|-
!1971
|[[John McCarthy (computer scientist)|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<ref>{{Cite journal | doi = 10.1145/33447.33448| title = Generality in artificial intelligence| journal = Communications of the ACM| volume = 30| issue = 12| pages = 1030| year = 1987| last1 = McCarthy | first1 = J. }}</ref>
|-
!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<ref>{{Cite journal | doi = 10.1145/355604.361591| title = The humble programmer| journal = Communications of the ACM| volume = 15| issue = 10| pages = 859| year = 1972| last1 = Dijkstra | first1 = E. W. }}</ref>
|-
!1973
|[[Charles Bachman|Charles W. Bachman]]
|For his outstanding contributions to [[database]] technology<ref>{{Cite journal | doi = 10.1145/355611.362534| title = The programmer as navigator| journal = Communications of the ACM| volume = 16| issue = 11| pages = 653| year = 1973| last1 = Bachman | first1 = C. W. }}</ref>
|-
!1974
|[[Donald Knuth|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<ref>{{Cite journal | doi = 10.1145/361604.361612| title = Computer programming as an art| journal = Communications of the ACM| volume = 17| issue = 12| pages = 667| year = 1974| last1 = Knuth | first1 = D. E. }}</ref>
|-
!1975
|In joint scientific efforts extending over twenty years, initially in collaboration with [[J. C. Shaw]] at the [[RAND Corporation]], and {{Sic|nolink=y|subsequent|ially|expected=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<ref>{{Cite journal | doi = 10.1145/360018.360022| title = Computer science as empirical inquiry: Symbols and search| journal = Communications of the ACM| volume = 19| issue = 3| pages = 113| year = 1976| last1 = Newell | first1 = A. | last2 = Simon | first2 = H. A. }}</ref>
|-
!1976
|[[Michael O. Rabin]] and <br> [[Dana Scott|Dana S. Scott]]
|For their joint paper "Finite Automata and Their Decision Problem,"<ref>{{Cite journal | last1 = Rabin | first1 = M. O. | last2 = Scott | first2 = D. | doi = 10.1147/rd.32.0114 | title = Finite Automata and Their Decision Problems | journal = IBM Journal of Research and Development | volume = 3 | issue = 2 | pages = 114 | year = 1959 | pmid = | pmc = }}</ref> which introduced the idea of [[nondeterministic machine]]s, 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<ref>{{Cite journal | doi = 10.1145/359810.359816| title = Complexity of computations| journal = Communications of the ACM| volume = 20| issue = 9| pages = 625| year = 1977| last1 = Rabin | first1 = M. O. }}</ref><ref>{{Cite journal | doi = 10.1145/359810.359826| title = Logic and programming languages| journal = Communications of the ACM| volume = 20| issue = 9| pages = 634| year = 1977| last1 = Scott | first1 = D. S. }}</ref>
|-
!1977
|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 language]]s<ref>{{Cite journal | doi = 10.1145/359576.359579| title = Can programming be liberated from the von Neumann style?: A functional style and its algebra of programs| journal = Communications of the ACM| volume = 21| issue = 8| pages = 613| year = 1978| last1 = Backus | first1 = J. }}</ref>
|-
!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 programming|automatic program synthesis]], and [[analysis of algorithms]]<ref>{{Cite journal | last1 = Floyd | first1 = R. W. | title = The paradigms of programming | url = http://dl.acm.org/ft_gateway.cfm?id=359140&ftid=289772&dwn=1&CFID=285645736&CFTOKEN=55009136| doi = 10.1145/359138.359140 | journal = Communications of the ACM | volume = 22 | issue = 8 | pages = 455 | year = 1979 | pmid = | pmc = }}</ref>
|-
!1979
|[[Kenneth E. Iverson]]
|For his pioneering effort in programming languages and mathematical notation resulting in what the computing field now knows as [[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<ref>{{Cite journal | doi = 10.1145/358896.358899| title = Notation as a tool of thought| journal = Communications of the ACM| volume = 23| issue = 8| pages = 444| year = 1980| last1 = Iverson | first1 = K. E. }}</ref>
|-
!1980
|[[Tony Hoare]]
|For his fundamental contributions to the definition and design of programming languages<ref>{{Cite journal | doi = 10.1145/358549.358561| title = The emperor's old clothes| journal = Communications of the ACM| volume = 24| issue = 2| pages = 75| year = 1981| last1 = Hoare | first1 = C. A. R. }}</ref>
|-
!1981
|[[Edgar F. Codd]]
|For his fundamental and continuing contributions to the theory and practice of database management systems, esp. [[relational database]]s<ref>{{Cite journal | last1 = Codd | first1 = E. F. | authorlink1 = Edgar F. Codd| title = Relational database: A practical foundation for productivity | doi = 10.1145/358396.358400 | journal = Communications of the ACM | volume = 25 | issue = 2 | pages = 109 | year = 1982 | pmid = | pmc = }}</ref>
|-
!1982
|[[Stephen A. Cook]]
|For his advancement of our understanding of the complexity of computation in a significant and profound way<ref>{{Cite journal | doi = 10.1145/358141.358144| title = An overview of computational complexity| journal = Communications of the ACM| volume = 26| issue = 6| pages = 400| year = 1983| last1 = Cook | first1 = S. A. }}</ref>
|-
!1983
|[[Ken Thompson (computer programmer)|Ken Thompson]] and <br> [[Dennis M. Ritchie]]
|For their development of generic operating systems theory and specifically for the implementation of the [[Unix|UNIX]] operating system
|-
!1984
|[[Niklaus Wirth]]
|For developing a sequence of innovative computer languages, [[Euler programming language|EULER]], [[Algol-W|ALGOL-W]], [[Modula|MODULA]] and [[Pascal (programming language)|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-complete]]ness
|-
!1986
|[[John Hopcroft]] and <br>[[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 computer]]s (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|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, [[Compatible Time-Sharing System|CTSS]] and [[Multics]].
|-
!1991
|[[Robin Milner]]
|For three distinct and complete achievements: 1) [[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|machine assisted proof construction]]; 2) [[ML programming language|ML]], the first language to include polymorphic [[type inference]] together with a [[type safety|type-safe]] [[exception handling|exception-handling]] mechanism; 3) [[calculus of communicating systems|CCS]], 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|operational]] and [[denotational semantics|denotational]] [[semantics]].<ref>{{Cite journal | last1 = Milner | first1 = R. | doi = 10.1145/151233.151240 | title = Elements of interaction: Turing award lecture | journal = Communications of the ACM | volume = 36 | pages = 78–89 | year = 1993 | pmid = | pmc = }}</ref>
|-
!1992
|[[Butler W. Lampson]]
|For contributions to the development of distributed, personal computing environments and the technology for their implementation: [[workstation]]s, [[computer network|networks]], [[operating system]]s, programming systems, [[computer display|displays]], [[computer security|security]] and [[word processor|document publishing]].
|-
!1993
|[[Juris Hartmanis]] and <br> [[Richard E. Stearns]]
|In recognition of their seminal paper which established the foundations for the field of [[computational complexity theory]].<ref>{{Cite journal | doi = 10.1145/188280.188379| title = Turing Award lecture: It's time to reconsider time| journal = Communications of the ACM| volume = 37| issue = 11| pages = 95| year = 1994| last1 = Stearns | first1 = R. E. }}</ref>
|-
!1994
|[[Edward Feigenbaum]] and <br> [[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.<ref>{{Cite journal | last1 = Reddy | first1 = R. | title = To dream the possible dream | doi = 10.1145/229459.233436 | journal = Communications of the ACM | volume = 39 | issue = 5 | pages = 105 | year = 1996 | pmid = | pmc = }}</ref>
|-
!1995
|[[Manuel Blum]]
|In recognition of his contributions to the foundations of [[computational complexity theory]] and its application to [[cryptography]] and [[program verification|program checking]].
|-
!1996
|[[Amir Pnueli]]
|For seminal work introducing [[temporal logic]] into computing science and for outstanding contributions to program and systems [[formal verification|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 (computer scientist)|Jim Gray]]
|For seminal contributions to [[database]] and [[transaction processing]] research and technical leadership in system implementation.
|-
!1999
|[[Frederick P. Brooks|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 generator|pseudorandom number generation]], [[cryptography]], and [[communication complexity]].
|-
!2001
|[[Ole-Johan Dahl]] and <br> [[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
|[[Ron Rivest|Ronald L. Rivest]], <br> [[Adi Shamir]] and <br> [[Leonard Adleman|Leonard M. Adleman]]
|For [[RSA (algorithm)|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 language]]s, leading the team that developed [[Smalltalk]], and for fundamental contributions to personal computing.
|-
!2004
|[[Vinton G. Cerf]] and <br> [[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|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]], <br> [[E. Allen Emerson]] and <br> [[Joseph Sifakis]]
|For their roles in developing [[model checking]] into a highly effective verification technology, widely adopted in the hardware and software industries.<ref>[http://www.ddj.com/206103622 2007 Turing Award Winners Announced]</ref>
|-
!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 ([[Probably approximately correct learning|PAC]]) learning, the complexity of enumeration and of algebraic computation, and the theory of parallel and distributed computing.
|-
!2011
|[[Judea Pearl]]<ref>{{cite journal | last1 = Pearl | first1 = Judea | last2 = | first2 = | year = 2011 | title = The Mechanization of Causal Inference: A "mini" Turing Test and Beyond | journal = ACM Turing award lectures | volume = | issue = | pages = | publisher = ACM | isbn = 978-1-4503-1049-9 | jstor = | doi = 10.1145/1283920.2351636 | url = http://dl.acm.org/citation.cfm?id=1283920.2351636 | format = mp4 | accessdate = | doi-broken-date = 2017-01-25 }}</ref>
|For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning.<ref>{{cite web |url=http://amturing.acm.org/award_winners/pearl_2658896.cfm |title=Judea Pearl |publisher=ACM}}</ref>
|-
!2012
|[[Silvio Micali]]<br /> [[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.<ref>{{cite web |url=http://www.acm.org/press-room/news-releases/2013/turing-award-12/ |title=Turing award 2012 |publisher=ACM}}</ref>
|-
!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.<ref>{{cite web |url=http://amturing.acm.org/award_winners/lamport_1205376.cfm |title=Turing award 2013 |publisher=ACM}}</ref><ref>{{Cite journal | last1 = Lamport | first1 = L. |authorlink1=Leslie Lamport| title = Time, clocks, and the ordering of events in a distributed system | doi = 10.1145/359545.359563 | journal = [[Communications of the ACM ]]| volume = 21 | issue = 7 | pages = 558–565| year = 1978 | url=http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf}}</ref>
|-
!2014
|[[Michael Stonebraker]]
|For fundamental contributions to the concepts and practices underlying modern database systems.<ref>{{cite web |url=http://amturing.acm.org/award_winners/stonebraker_1172121.cfm |title=Turing award 2014 |publisher=ACM}}</ref>
|-
!2015
|[[Martin E. Hellman]]<br> [[Whitfield Diffie]]
| For fundamental contributions to modern cryptography. Diffie and Hellman's groundbreaking 1976 paper, "New Directions in Cryptography,"<ref name="DiffieHellman1976">{{cite journal|last1=Diffie|first1=W.|last2=Hellman|first2=M.|title=New directions in cryptography|journal=IEEE Transactions on Information Theory|volume=22|issue=6|year=1976|pages=644–654|url=https://www-ee.stanford.edu/~hellman/publications/24.pdf|doi=10.1109/TIT.1976.1055638}}</ref> introduced the ideas of public-key cryptography and digital signatures, which are the foundation for most regularly-used security protocols on the internet today.<ref>{{cite web
|url=http://amturing.acm.org/award_winners/diffie_8371646.cfm|title=Cryptography Pioneers Receive 2015 ACM A.M. Turing Award| publisher=ACM}}</ref>
|}
== Eksteraj ligiloj ==
| |||