Turing Award: Difference between revisions

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search
← Previous edit
VisualWikitext
imported>OAbot
m Open access bot: url-access updated in citation with #oabot.
 
Line 3: Line 3:
{{Use mdy dates|date=November 2022}}
{{Use mdy dates|date=November 2022}}
{{Infobox award
{{Infobox award
| name       = ACM Turing Award
| name = ACM Turing Award
| image       = Alan Turing (1912-1954) in 1936 at Princeton University.jpg
| image = Turing_statue_Surrey.jpg
| caption     = [[Alan Turing]], the award's namesake
| caption = Statue of [[Alan Turing]], the award's namesake
| alt         = Photo of Alan Turing
| alt = Statue of Alan Turing
| image_size  =
| awarded_for = Outstanding contributions in [[computer science]]
| awarded_for = Outstanding contributions in [[computer science]]
| presenter   = [[Association for Computing Machinery]]
| presenter = [[Association for Computing Machinery]]
| country     = United States
| country = United States
| reward     = {{US$|1000000}}<ref name="million">{{cite journal | doi = 10.1145/2685372 | title = ACM's Turing Award prize raised to $1 million |url=https://dl.acm.org/doi/pdf/10.1145/2685372 | journal = Communications of the ACM | volume = 57 | issue = 12 | page = 20 | year = 2014| author = CACM Staff | url-access = subscription }}</ref>
| reward = {{US$|1000000}}<ref name="million">{{cite journal | doi = 10.1145/2685372 | title = ACM's Turing Award prize raised to $1 million |url=https://dl.acm.org/doi/pdf/10.1145/2685372 | journal = Communications of the ACM | volume = 57 | issue = 12 | page = 20 | year = 2014| author = CACM Staff | url-access = subscription }}</ref>
| firstawarded = {{start date and age|1966}}
| firstawarded = {{start date and age|1966}}
| lastawarded = 2025
| website = {{URL|https://amturing.acm.org}}
| website     = {{URL|https://amturing.acm.org}}
}}
}}
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]]. It is generally recognized as the highest distinction in the field of computer science and is often referred to as the "[[List of prizes known as the Nobel of a field or the highest honors of a field|Nobel Prize of Computing]]". {{As of|2025}}, 79 people have been awarded the prize, with the most recent recipients being [[Andrew Barto]] and [[Richard S. Sutton]], who won in 2024.<ref name="ACM" /><ref name="BartoSutton">{{cite press release|title=ACM A.M. Turing Award Honors Two Researchers Who Led the Development of Cornerstone AI Technology|publisher=The Association for Computing Machinery|url=https://awards.acm.org/about/2024-turing|url-status=live|archive-url=https://web.archive.org/web/20250305185022/https://awards.acm.org/about/2024-turing|archive-date=March 5, 2025|date=March 5, 2025}}</ref><ref>{{Cite book |last1=Dasgupta |first1=Sanjoy |last2=Papadimitriou |first2=Christos |author2-link=Christos Papadimitriou |last3=Vazirani |first3=Umesh | author3-link=Umesh Vazirani |title=Algorithms |url=https://archive.org/details/algorithms00dasg_934 |url-access=limited |publisher=[[McGraw-Hill]] |year=2008 |isbn=978-0-07-352340-8 |page = [https://archive.org/details/algorithms00dasg_934/page/n316 317]
 
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]]. It is generally recognized as the highest distinction in the field of computer science and is often referred to as the "[[List of awards considered the highest in a field|Nobel Prize of Computing]]". {{As of|2025}}, 79 people have been awarded the prize, with the most recent recipients being [[Andrew Barto]] and [[Richard S. Sutton]], who won in 2024.<ref name="ACM" /><ref name="BartoSutton">{{cite press release|title=ACM A.M. Turing Award Honors Two Researchers Who Led the Development of Cornerstone AI Technology|publisher=The Association for Computing Machinery|url=https://awards.acm.org/about/2024-turing|url-status=live|archive-url=https://web.archive.org/web/20250305185022/https://awards.acm.org/about/2024-turing|archive-date=March 5, 2025|date=March 5, 2025}}</ref><ref>{{Cite book |last1=Dasgupta |first1=Sanjoy |last2=Papadimitriou |first2=Christos |author2-link=Christos Papadimitriou |last3=Vazirani |first3=Umesh | author3-link=Umesh Vazirani |title=Algorithms |url=https://archive.org/details/algorithms00dasg_934 |url-access=limited |publisher=[[McGraw-Hill]] |year=2008 |isbn=978-0-07-352340-8 |page = [https://archive.org/details/algorithms00dasg_934/page/n316 317]
}}</ref><ref>{{Cite web|title=dblp: ACM Turing Award Lectures|url=http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html|access-date=2023-02-11|website= informatik.uni-trier.de|language=en|archive-date=January 2, 2015|archive-url=https://web.archive.org/web/20150102222046/http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html|url-status=live}}</ref><ref>{{cite web |url = https://www.networkworld.com/article/692664/data-center-why-there-s-no-nobel-prize-in-computing.html |title = Why there's no Nobel Prize in Computing |last = Brown |first = Bob <!-- http://www.networkworld.com/author/Bob-Brown/ --> |website = [[Network World]] |date = June 6, 2011 |access-date = June 3, 2015
}}</ref><ref>{{Cite web|title=dblp: ACM Turing Award Lectures|url=http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html|access-date=2023-02-11|website= informatik.uni-trier.de|language=en|archive-date=January 2, 2015|archive-url=https://web.archive.org/web/20150102222046/http://www.informatik.uni-trier.de/~ley/db/journals/cacm/turing.html|url-status=live}}</ref><ref>{{cite web |url = https://www.networkworld.com/article/692664/data-center-why-there-s-no-nobel-prize-in-computing.html |title = Why there's no Nobel Prize in Computing |last = Brown |first = Bob <!-- http://www.networkworld.com/author/Bob-Brown/ --> |website = [[Network World]] |date = June 6, 2011 |access-date = June 3, 2015
| archive-date = December 4, 2023 |archive-url = https://web.archive.org/web/20231204215338/https://www.networkworld.com/article/692664/data-center-why-there-s-no-nobel-prize-in-computing.html |url-status = live}}</ref>
| archive-date = December 4, 2023 |archive-url = https://web.archive.org/web/20231204215338/https://www.networkworld.com/article/692664/data-center-why-there-s-no-nobel-prize-in-computing.html |url-status = live}}</ref>
Line 23: Line 22:


The first recipient, in 1966, was [[Alan Perlis]]. The youngest recipient was [[Donald Knuth]], who won in 1974 at the age of 36,<ref>{{cite arXiv |title=What Kind of Person Wins the Turing Award? |author1=Zhongkai Shangguan |author2=Zihe Zheng |author3=Jiebo Luo |date=2021 |pages=1 |class=cs.GL |quote=The youngest winner was Donald Knuth, who convinced the jury with "Computer Programming as an Art" and won [the] Turing Award in 1974 at the age of 36. |eprint=2104.05636 }}</ref> while the oldest recipient was [[Alfred Aho]], who won in 2020 at the age of 79.<ref>{{cite web |url=https://www.britannica.com/topic/Turing-Award |title=Turing Award |author=William L. Hosch |publisher=[[Encyclopedia Britannica]] |access-date=March 12, 2024 |archive-url=https://web.archive.org/web/20240205065404/https://www.britannica.com/topic/Turing-Award |archive-date=February 5, 2024 |url-status=live }}</ref> Only three women have been awarded the prize: [[Frances Allen]] (in 2006),<ref name="Allen">{{cite press release|title=First Woman to Receive ACM Turing Award|publisher=The Association for Computing Machinery|url=http://campus.acm.org/public/pressroom/press_releases/2_2007/turing2006.cfm|archive-url=https://web.archive.org/web/20070702034203/http://campus.acm.org/public/pressroom/press_releases/2_2007/turing2006.cfm|url-status=dead|archive-date=July 2, 2007|date=February 21, 2007|access-date=November 5, 2007}}</ref> [[Barbara Liskov]] (in 2008),<ref name="liskov" /> and [[Shafi Goldwasser]] (in 2012).<ref name="goldwasser" />
The first recipient, in 1966, was [[Alan Perlis]]. The youngest recipient was [[Donald Knuth]], who won in 1974 at the age of 36,<ref>{{cite arXiv |title=What Kind of Person Wins the Turing Award? |author1=Zhongkai Shangguan |author2=Zihe Zheng |author3=Jiebo Luo |date=2021 |pages=1 |class=cs.GL |quote=The youngest winner was Donald Knuth, who convinced the jury with "Computer Programming as an Art" and won [the] Turing Award in 1974 at the age of 36. |eprint=2104.05636 }}</ref> while the oldest recipient was [[Alfred Aho]], who won in 2020 at the age of 79.<ref>{{cite web |url=https://www.britannica.com/topic/Turing-Award |title=Turing Award |author=William L. Hosch |publisher=[[Encyclopedia Britannica]] |access-date=March 12, 2024 |archive-url=https://web.archive.org/web/20240205065404/https://www.britannica.com/topic/Turing-Award |archive-date=February 5, 2024 |url-status=live }}</ref> Only three women have been awarded the prize: [[Frances Allen]] (in 2006),<ref name="Allen">{{cite press release|title=First Woman to Receive ACM Turing Award|publisher=The Association for Computing Machinery|url=http://campus.acm.org/public/pressroom/press_releases/2_2007/turing2006.cfm|archive-url=https://web.archive.org/web/20070702034203/http://campus.acm.org/public/pressroom/press_releases/2_2007/turing2006.cfm|url-status=dead|archive-date=July 2, 2007|date=February 21, 2007|access-date=November 5, 2007}}</ref> [[Barbara Liskov]] (in 2008),<ref name="liskov" /> and [[Shafi Goldwasser]] (in 2012).<ref name="goldwasser" />
[[File:Turing_Award,_on_display_at_Nokia_Bell_Labs,_NJ,_USA,_Aug_2025.jpg|thumb|right|upright=1.6|alt=Photo of The Turing Award on display at Nokia Bell Labs, August 2025.|The Turing Award of 1983, given to [[Dennis Ritchie]] and [[Ken Thompson]], on display at [[Nokia Bell Labs]].]]


__TOC__
__TOC__
{{-}}
 
== Recipients ==
== Recipients ==
<!-- Warning: Do not edit this page to add images! Under Wikipedia's policy of "fair use", copyrighted images are typically only valid for the article matching a person's name, and can't be copied over here, unless express permission is explicitly granted. For further explanation, see [[WP:Fair use]].
<!-- Warning: Do not edit this page to add images! Under Wikipedia's policy of "fair use", copyrighted images are typically only valid for the article matching a person's name, and can't be copied over here, unless express permission is explicitly granted. For further explanation, see [[WP:Fair use]].
Line 31: Line 32:
If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->


{|class="wikitable sortable"
{|class="wikitable sortable"  
|+ Recipients of the ACM Turing award
|+ Recipients of the ACM Turing award
!scope="col" |Year
!scope="col" |Year
Line 48: Line 49:
|{{sortname|Maurice|Wilkes}}
|{{sortname|Maurice|Wilkes}}
|[[File:Maurice Vincent Wilkes 1980 (3, cropped).jpg|alt=Maurice Wilkes |80px]]
|[[File:Maurice Vincent Wilkes 1980 (3, cropped).jpg|alt=Maurice Wilkes |80px]]
|"Wilkes is best known as the builder and designer of the [[EDSAC]], the second 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 [[David Wheeler (computer scientist)|David Wheeler]] and [[Stanley 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–7 |year=1968|last1=Wilkes |first1=M. V. |s2cid=9846847 |doi-access=free }}</ref><ref name="wilkes">{{cite web |url=https://amturing.acm.org/award_winners/wilkes_1001395.cfm |publisher=[[Association for Computing Machinery]] |author=Martin Campbell-Kelly |title=Maurice V. Wilkes - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 7, 2024 |archive-url=https://web.archive.org/web/20240107010210/https://amturing.acm.org/award_winners/wilkes_1001395.cfm |url-status=live }}</ref>
|For contributions including being "the builder and designer of the [[EDSAC]], the second computer with an internally stored [[computer program|program]]" and introducing [[program libraries]] (together with [[David Wheeler (computer scientist)|David Wheeler]] and [[Stanley Gill]])<ref>{{cite journal |doi=10.1145/321439.321440|title=Computers then and Now |journal=Journal of the ACM |volume=15|pages=1–7 |year=1968|last1=Wilkes |first1=M. V. |s2cid=9846847 |doi-access=free }}</ref><ref name="wilkes">{{cite web |url=https://amturing.acm.org/award_winners/wilkes_1001395.cfm |publisher=[[Association for Computing Machinery]] |author=Martin Campbell-Kelly |title=Maurice V. Wilkes - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 7, 2024 |archive-url=https://web.archive.org/web/20240107010210/https://amturing.acm.org/award_winners/wilkes_1001395.cfm |url-status=live }}</ref>
|[[University of Cambridge]]
|[[University of Cambridge]]
|-
|-
Line 54: Line 55:
|{{sortname|Richard|Hamming}}
|{{sortname|Richard|Hamming}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|"For his work on [[numerical methods]], automatic coding systems, and [[Error detection and correction|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–12 |year=1969 |last=Hamming |first=R. W.|s2cid=6868310 |doi-access=free }}</ref><ref name="hamming">{{cite web |url=https://amturing.acm.org/award_winners/hamming_1000652.cfm |publisher=[[Association for Computing Machinery]] |author=Edmund F. Robertson |title=Richard W. Hamming - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 30, 2020 |archive-url=https://web.archive.org/web/20201030025652/https://amturing.acm.org/award_winners/hamming_1000652.cfm |url-status=live }}</ref>
|"For his work on [[numerical method]]s, automatic coding systems, and [[Error detection and correction|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–12 |year=1969 |last=Hamming |first=R. W.|s2cid=6868310 |doi-access=free }}</ref><ref name="hamming">{{cite web |url=https://amturing.acm.org/award_winners/hamming_1000652.cfm |publisher=[[Association for Computing Machinery]] |author=Edmund F. Robertson |title=Richard W. Hamming - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 30, 2020 |archive-url=https://web.archive.org/web/20201030025652/https://amturing.acm.org/award_winners/hamming_1000652.cfm |url-status=live }}</ref>
|[[Bell Labs]]
|[[University of Louisville]]<br>[[Bell Labs]]
|-
|-
!scope="row" |1969
!scope="row" |1969
Line 72: Line 73:
|{{sortname|John|McCarthy|John McCarthy (computer scientist)}}
|{{sortname|John|McCarthy|John McCarthy (computer scientist)}}
|[[File:John McCarthy Stanford.jpg|alt=John McCarthy |80px]]
|[[File:John McCarthy Stanford.jpg|alt=John McCarthy |80px]]
|"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–1035|year=1987|last1=McCarthy|first1=J.|s2cid=1045033|url=http://www-formal.stanford.edu/jmc/generality.ps|access-date=November 1, 2017|archive-date=September 21, 2017|archive-url=https://web.archive.org/web/20170921234938/http://www-formal.stanford.edu/jmc/generality.ps|url-status=live|doi-access=free}}</ref><ref name="mccarthy">{{cite web |url=https://amturing.acm.org/award_winners/mccarthy_1118322.cfm |publisher=[[Association for Computing Machinery]] |author=Lester Earnest |title=John Mccarthy - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=September 3, 2016 |archive-url=https://web.archive.org/web/20160903190145/http://amturing.acm.org/award_winners/mccarthy_0239596.cfm |url-status=live }}</ref>
|Award citation refers to McCarthy's lecture "The Present State of Research on Artificial Intelligence"<ref>{{cite journal|doi=10.1145/33447.33448|title=Generality in artificial intelligence|journal=Communications of the ACM|volume=30|issue=12|pages=1030–1035|year=1987|last1=McCarthy|first1=J.|s2cid=1045033|url=http://www-formal.stanford.edu/jmc/generality.ps|access-date=November 1, 2017|archive-date=September 21, 2017|archive-url=https://web.archive.org/web/20170921234938/http://www-formal.stanford.edu/jmc/generality.ps|url-status=live|doi-access=free}}</ref><ref name="mccarthy">{{cite web |url=https://amturing.acm.org/award_winners/mccarthy_1118322.cfm |publisher=[[Association for Computing Machinery]] |author=Lester Earnest |title=John Mccarthy - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=September 3, 2016 |archive-url=https://web.archive.org/web/20160903190145/http://amturing.acm.org/award_winners/mccarthy_0239596.cfm |url-status=live }}</ref>
|[[Stanford University]]
|[[Stanford University]]
|-
|-
Line 78: Line 79:
|{{sortname|Edsger W.|Dijkstra}}
|{{sortname|Edsger W.|Dijkstra}}
|[[File:Edsger Wybe Dijkstra.jpg|alt=Edsger W. Dijkstra |80px]]
|[[File:Edsger Wybe Dijkstra.jpg|alt=Edsger W. Dijkstra |80px]]
|"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–866 |year=1972 |last=Dijkstra |first=E. W. |doi-access=free }}</ref><ref name="dijkstra">{{cite web |url=https://amturing.acm.org/award_winners/dijkstra_1053701.cfm |publisher=[[Association for Computing Machinery]] |author=Hamilton Richards |title=Edsger Wybe Dijkstra - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 26, 2024 |archive-url=https://web.archive.org/web/20240226045727/https://amturing.acm.org/award_winners/dijkstra_1053701.cfm |url-status=live }}</ref>
|"For fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design"<ref>{{cite journal |doi=10.1145/355604.361591 |title=The humble programmer |journal=Communications of the ACM |volume=15 |issue=10 |pages=859–866 |year=1972 |last=Dijkstra |first=E. W. |doi-access=free }}</ref><ref name="dijkstra">{{cite web |url=https://amturing.acm.org/award_winners/dijkstra_1053701.cfm |publisher=[[Association for Computing Machinery]] |author=Hamilton Richards |title=Edsger Wybe Dijkstra - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 26, 2024 |archive-url=https://web.archive.org/web/20240226045727/https://amturing.acm.org/award_winners/dijkstra_1053701.cfm |url-status=live }}</ref>
|[[Centrum Wiskunde & Informatica]]<br>[[Eindhoven University of Technology]]<br>[[University of Texas at Austin]]
|[[Centrum Wiskunde & Informatica]]<br>[[Eindhoven University of Technology]]<br>[[University of Texas at Austin]]
|-
|-
Line 90: Line 91:
|{{sortname|Donald|Knuth}}
|{{sortname|Donald|Knuth}}
|[[File:KnuthAtOpenContentAlliance.jpg|alt=Donald Knuth |80px]]
|[[File:KnuthAtOpenContentAlliance.jpg|alt=Donald Knuth |80px]]
|"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–673 |year=1974 |last=Knuth |first=D. E. |doi-access=free }}</ref><ref name="knuth">{{cite web |url=https://amturing.acm.org/award_winners/knuth_1013846.cfm |publisher=[[Association for Computing Machinery]] |author=David Walden |title=Donald ("Don") Ervin Knuth - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 17, 2019 |archive-url=https://web.archive.org/web/20191017231352/http://amturing.acm.org/award_winners/knuth_1013846.cfm |url-status=live }}</ref>
|"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–673 |year=1974 |last=Knuth |first=D. E. |doi-access=free }}</ref><ref name="knuth">{{cite web |url=https://amturing.acm.org/award_winners/knuth_1013846.cfm |publisher=[[Association for Computing Machinery]] |author=David Walden |title=Donald ("Don") Ervin Knuth - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 17, 2019 |archive-url=https://web.archive.org/web/20191017231352/http://amturing.acm.org/award_winners/knuth_1013846.cfm |url-status=live }}</ref>
|[[California Institute of Technology]]<br>[[Institute for Defense Analyses#Center for Communications and Computing|Center for Communications Research, Center for Communications and Computing, Institute for Defense Analyses]]<br>[[Stanford University]]
|[[California Institute of Technology]]<br>[[Institute for Defense Analyses#Center for Communications and Computing|Center for Communications Research, Center for Communications and Computing, Institute for Defense Analyses]]<br>[[Stanford University]]
|-
|-
Line 96: Line 97:
|{{sortname|Allen|Newell}}
|{{sortname|Allen|Newell}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|rowspan=2 |"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]]."<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 |page=113 |year=1976 |last1=Newell |first1=A. |last2=Simon |first2=H. A. |doi-access=free }}</ref><ref name="newell">{{cite web |url=https://amturing.acm.org/award_winners/newell_3167755.cfm |publisher=[[Association for Computing Machinery]] |author=Hunter Heyck |title=Allen Newell - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 16, 2020 |archive-url=https://web.archive.org/web/20201016155145/https://amturing.acm.org/award_winners/newell_3167755.cfm |url-status=live }}</ref><ref name="simon">{{cite web |url=https://amturing.acm.org/award_winners/simon_1031467.cfm |publisher=[[Association for Computing Machinery]] |author=Hunter Heyck |title=Herbert ("Herb") Alexander Simon - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=April 18, 2021 |archive-url=https://web.archive.org/web/20210418204548/https://amturing.acm.org/award_winners/simon_1031467.cfm |url-status=live }}</ref>
|rowspan=2 |In collaboration with [[J. C. Shaw]] and others, for "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 |page=113 |year=1976 |last1=Newell |first1=A. |last2=Simon |first2=H. A. |doi-access=free }}</ref><ref name="newell">{{cite web |url=https://amturing.acm.org/award_winners/newell_3167755.cfm |publisher=[[Association for Computing Machinery]] |author=Hunter Heyck |title=Allen Newell - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 16, 2020 |archive-url=https://web.archive.org/web/20201016155145/https://amturing.acm.org/award_winners/newell_3167755.cfm |url-status=live }}</ref><ref name="simon">{{cite web |url=https://amturing.acm.org/award_winners/simon_1031467.cfm |publisher=[[Association for Computing Machinery]] |author=Hunter Heyck |title=Herbert ("Herb") Alexander Simon - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=April 18, 2021 |archive-url=https://web.archive.org/web/20210418204548/https://amturing.acm.org/award_winners/simon_1031467.cfm |url-status=live }}</ref>
|rowspan=2 |[[RAND Corporation]]<br>[[Carnegie Mellon University]]
|rowspan=2 |[[RAND Corporation]]<br>[[Carnegie Mellon University]]
|-
|-
Line 106: Line 107:
|{{sortname|Michael O.|Rabin}}
|{{sortname|Michael O.|Rabin}}
|[[File:M O Rabin.jpg|alt=Michael O. Rabin |80px]]
|[[File:M O Rabin.jpg|alt=Michael O. Rabin |80px]]
|rowspan=2 |"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 |s2cid=3160330 }}</ref> which introduced the idea of [[nondeterministic machine]]s, 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–633 |year=1977 |last=Rabin |first=M. O. |doi-access=free }}</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–641|year=1977|last=Scott |first=D. S. |doi-access=free }}</ref><ref name="rabin">{{cite web |url=https://amturing.acm.org/award_winners/rabin_9681074.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Michael O. Rabin - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 28, 2023 |archive-url=https://web.archive.org/web/20231128055233/https://amturing.acm.org/award_winners/rabin_9681074.cfm |url-status=live }}</ref><ref name="scott">{{cite web |url=https://amturing.acm.org/award_winners/scott_1193622.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Dana Steward Scott - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 26, 2024 |archive-url=https://web.archive.org/web/20240226045724/https://amturing.acm.org/award_winners/scott_1193622.cfm |url-status=live }}</ref>
|rowspan=2 |"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 |s2cid=3160330 }}</ref> which introduced the idea of [[Nondeterministic finite automaton|nondeterministic machines]]"<ref>{{cite journal |doi=10.1145/359810.359816 |title=Complexity of computations |journal=Communications of the ACM |volume=20|issue=9 |pages=625–633 |year=1977 |last=Rabin |first=M. O. |doi-access=free }}</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–641|year=1977|last=Scott |first=D. S. |doi-access=free }}</ref><ref name="rabin">{{cite web |url=https://amturing.acm.org/award_winners/rabin_9681074.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Michael O. Rabin - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 28, 2023 |archive-url=https://web.archive.org/web/20231128055233/https://amturing.acm.org/award_winners/rabin_9681074.cfm |url-status=live }}</ref><ref name="scott">{{cite web |url=https://amturing.acm.org/award_winners/scott_1193622.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Dana Steward Scott - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 26, 2024 |archive-url=https://web.archive.org/web/20240226045724/https://amturing.acm.org/award_winners/scott_1193622.cfm |url-status=live }}</ref>
|[[Princeton University]]
|[[Princeton University]]
|-
|-
Line 122: Line 123:
|{{sortname|Robert W.|Floyd}}
|{{sortname|Robert W.|Floyd}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|"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 |doi=10.1145/359138.359140 |journal=Communications of the ACM |volume=22 |issue=8 |pages=455–460 |year=1979 |doi-access=free }}</ref>
|"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 |doi=10.1145/359138.359140 |journal=Communications of the ACM |volume=22 |issue=8 |pages=455–460 |year=1979 |doi-access=free }}</ref><ref>{{Cite web |title=Robert W. Floyd - A.M. Turing Award Laureate |url=https://amturing.acm.org/award_winners/floyd_3720707.cfm |access-date=2025-10-18 |website=amturing.acm.org}}</ref>
|[[Carnegie Mellon University]]<br>[[Stanford University]]
|[[Carnegie Mellon University]]<br>[[Stanford University]]
|-
|-
Line 140: Line 141:
|{{sortname|Edgar F.|Codd}}
|{{sortname|Edgar F.|Codd}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|"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. |author-link=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–117 |year=1982 |doi-access=free }}</ref><ref name="codd">{{cite web |url=https://amturing.acm.org/award_winners/codd_1000892.cfm |publisher=[[Association for Computing Machinery]] |author=C. J. Date |title=Edgar F. ("Ted") Codd - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=December 23, 2017 |archive-url=https://web.archive.org/web/20171223141345/http://amturing.acm.org/award_winners/codd_1000892.cfm |url-status=live }}</ref>
|"For his fundamental and continuing contributions to the theory and practice of database management systems"<ref>{{cite journal |last1=Codd |first1=E. F. |author-link=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–117 |year=1982 |doi-access=free }}</ref><ref name="codd">{{cite web |url=https://amturing.acm.org/award_winners/codd_1000892.cfm |publisher=[[Association for Computing Machinery]] |author=C. J. Date |title=Edgar F. ("Ted") Codd - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=December 23, 2017 |archive-url=https://web.archive.org/web/20171223141345/http://amturing.acm.org/award_winners/codd_1000892.cfm |url-status=live }}</ref>
|[[IBM]]
|[[IBM]]
|-
|-
Line 146: Line 147:
|{{sortname|Stephen|Cook}}
|{{sortname|Stephen|Cook}}
|[[File:Prof.Cook (cropped).jpg|alt=Stephen Cook |80px]]
|[[File:Prof.Cook (cropped).jpg|alt=Stephen Cook |80px]]
|"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–408 |year=1983 |last=Cook |first=S. A. |doi-access=free }}</ref><ref name="cook">{{cite web |url=https://amturing.acm.org/award_winners/cook_n991950.cfm |publisher=[[Association for Computing Machinery]] |author=Bruce Kapron |title=Stephen Arthur Cook - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 21, 2019 |archive-url=https://web.archive.org/web/20191021042959/http://amturing.acm.org/award_winners/cook_n991950.cfm |url-status=live }}</ref>
|For "his advancement of our understanding of the complexity of computation in a significant and profound way"; the citation in particular mentions his paper "The Complexity of Theorem Proving Procedures," which is credited with founding the theory of [[NP-completeness]]<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–408 |year=1983 |last=Cook |first=S. A. |doi-access=free }}</ref><ref name="cook">{{cite web |url=https://amturing.acm.org/award_winners/cook_n991950.cfm |publisher=[[Association for Computing Machinery]] |author=Bruce Kapron |title=Stephen Arthur Cook - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 21, 2019 |archive-url=https://web.archive.org/web/20191021042959/http://amturing.acm.org/award_winners/cook_n991950.cfm |url-status=live }}</ref>
|[[University of Toronto]]
|[[University of Toronto]]
|-
|-
Line 161: Line 162:
|{{sortname|Niklaus|Wirth}}
|{{sortname|Niklaus|Wirth}}
|[[File:Niklaus Wirth, UrGU (cropped).jpg|alt=Niklaus Wirth |80px]]
|[[File:Niklaus Wirth, UrGU (cropped).jpg|alt=Niklaus Wirth |80px]]
|"For developing a sequence of innovative computer languages, [[Euler programming language|EULER]], [[Algol-W|ALGOL-W]], [[Pascal (programming language)|Pascal]], [[Modula|MODULA]] and [[Oberon (programming language)|Oberon]]"<ref name="wirth">{{cite web |url=https://amturing.acm.org/award_winners/wirth_1025774.cfm |publisher=[[Association for Computing Machinery]] |author=Thomas Haigh |title=Niklaus E. Wirth - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=June 29, 2017 |archive-url=https://web.archive.org/web/20170629084838/http://amturing.acm.org/award_winners/wirth_1025774.cfm |url-status=live }}</ref>
|"For developing a sequence of innovative computer languages, [[Euler (programming language)|EULER]], [[ALGOL W|ALGOL-W]], [[Modula|MODULA]] and [[Pascal (programming language)|PASCAL]]"<ref name="wirth">{{cite web |url=https://amturing.acm.org/award_winners/wirth_1025774.cfm |publisher=[[Association for Computing Machinery]] |author=Thomas Haigh |title=Niklaus E. Wirth - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=June 29, 2017 |archive-url=https://web.archive.org/web/20170629084838/http://amturing.acm.org/award_winners/wirth_1025774.cfm |url-status=live }}</ref>
|[[Stanford University]]<br>[[University of Zurich]]<br>[[ETH Zurich]]
|[[Stanford University]]<br>[[University of Zurich]]<br>[[ETH Zurich]]
|-
|-
Line 167: Line 168:
|{{sortname|Richard M.|Karp}}
|{{sortname|Richard M.|Karp}}
|[[File:Karp mg 7725-b.cr2.jpg|alt=Richard M. Karp |80px]]
|[[File:Karp mg 7725-b.cr2.jpg|alt=Richard M. Karp |80px]]
|"For his continuing contributions to the theory of algorithms including the development of efficient algorithms for [[Network flow problem|network flow]] and other [[combinatorial optimization]] problems, the identification of [[P (complexity)|polynomial-time computability]] with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of [[NP-complete]]ness"<ref name="karp">{{cite web |url=https://amturing.acm.org/award_winners/karp_3256708.cfm |publisher=[[Association for Computing Machinery]] |author1=B. Simons |author2=D. Gusfield |title=Richard ("Dick") Manning Karp - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=July 4, 2017 |archive-url=https://web.archive.org/web/20170704175158/http://amturing.acm.org/award_winners/karp_3256708.cfm |url-status=live }}</ref>
|"For his continuing contributions to the theory of algorithms including the development of efficient algorithms for [[Network flow problem|network flow]] and other [[combinatorial optimization]] problems, the identification of [[P (complexity)|polynomial-time computability]] with the intuitive notion of algorithmic efficiency, and, most notably, contributions to the theory of [[NP-completeness]]"<ref name="karp">{{cite web |url=https://amturing.acm.org/award_winners/karp_3256708.cfm |publisher=[[Association for Computing Machinery]] |author1=B. Simons |author2=D. Gusfield |title=Richard ("Dick") Manning Karp - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=July 4, 2017 |archive-url=https://web.archive.org/web/20170704175158/http://amturing.acm.org/award_winners/karp_3256708.cfm |url-status=live }}</ref>
|[[University of California, Berkeley]]
|[[University of California, Berkeley]]
|-
|-
Line 183: Line 184:
|{{sortname|John|Cocke|John Cocke (computer scientist)}}
|{{sortname|John|Cocke|John Cocke (computer scientist)}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|"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)"<ref name="cocke">{{cite web |url=https://amturing.acm.org/award_winners/cocke_2083115.cfm |publisher=[[Association for Computing Machinery]] |author1=Michael G. Burke |author2=Vivek Sarkar |title=John Cocke - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111122/https://amturing.acm.org/award_winners/cocke_2083115.cfm |url-status=live }}</ref>
|"For significant contributions in the design and theory of [[compiler]]s, the architecture of large systems and the development of [[reduced instruction set computer]]s (RISC); for discovering and systematizing many fundamental transformations now used in [[optimizing compiler]]s including [[Strength reduction|reduction of operator strength]], [[Common subexpression elimination|elimination of common subexpressions]], [[register allocation]], [[constant propagation]], and [[dead code elimination]]"<ref name="cocke">{{cite web |url=https://amturing.acm.org/award_winners/cocke_2083115.cfm |publisher=[[Association for Computing Machinery]] |author1=Michael G. Burke |author2=Vivek Sarkar |title=John Cocke - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111122/https://amturing.acm.org/award_winners/cocke_2083115.cfm |url-status=live }}</ref>
|[[IBM]]
|[[IBM]]
|-
|-
Line 195: Line 196:
|{{sortname|William|Kahan}}
|{{sortname|William|Kahan}}
|[[File:William Kahan 2008 (cropped).jpg|alt=William Kahan |80px]]
|[[File:William Kahan 2008 (cropped).jpg|alt=William Kahan |80px]]
|"For his fundamental contributions to [[numerical analysis]]. One of the foremost experts on [[floating-point arithmetic|floating-point computations]], Kahan has dedicated himself to 'making the world safe for numerical computations!'"<ref name="kahan">{{cite web |url=https://amturing.acm.org/award_winners/kahan_1023746.cfm |publisher=[[Association for Computing Machinery]] |author=Thomas Haigh |title=William ("Velvel") Morton Kahan - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111122/https://amturing.acm.org/award_winners/kahan_1023746.cfm |url-status=live }}</ref>
|"For his fundamental contributions to [[numerical analysis]]" and as "one of the foremost experts on [[floating-point arithmetic|floating-point computations]]"<ref name="kahan">{{cite web |url=https://amturing.acm.org/award_winners/kahan_1023746.cfm |publisher=[[Association for Computing Machinery]] |author=Thomas Haigh |title=William ("Velvel") Morton Kahan - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111122/https://amturing.acm.org/award_winners/kahan_1023746.cfm |url-status=live }}</ref>
|[[University of California, Berkeley]]
|[[University of California, Berkeley]]
|-
|-
Line 207: Line 208:
|{{sortname|Robin|Milner}}
|{{sortname|Robin|Milner}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|"For three distinct and complete achievements:
|The award citation mentions three primary contributions: his mechanization of the [[Logic of Computable Functions]]; the programming language [[ML (programming language)|ML]] including its [[type inference]] and [[type safety]]; the [[calculus of communicating systems]]; as well as the connection between [[operational semantics|operational]] and [[denotational semantics|denotational]] [[semantics]]<ref>{{cite journal |last=Milner |first=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 |doi-access=free }}</ref><ref name="milner">{{cite web |url=https://amturing.acm.org/award_winners/milner_1569367.cfm |publisher=[[Association for Computing Machinery]] |author=Michael Fourman |title=Arthur John Robin Gorell ("Robin") Milner - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 17, 2021 |archive-url=https://web.archive.org/web/20211117052919/https://amturing.acm.org/award_winners/milner_1569367.cfm |url-status=live }}</ref>
# [[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]];
# [[ML programming language|ML]], the first language to include polymorphic [[type inference]] together with a [[type safety|type-safe]] [[exception handling|exception-handling]] mechanism;
# [[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 |last=Milner |first=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 |doi-access=free }}</ref><ref name="milner">{{cite web |url=https://amturing.acm.org/award_winners/milner_1569367.cfm |publisher=[[Association for Computing Machinery]] |author=Michael Fourman |title=Arthur John Robin Gorell ("Robin") Milner - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 17, 2021 |archive-url=https://web.archive.org/web/20211117052919/https://amturing.acm.org/award_winners/milner_1569367.cfm |url-status=live }}</ref>
|[[Stanford University]]<br>[[University of Edinburgh]]
|[[Stanford University]]<br>[[University of Edinburgh]]
|-
|-
Line 217: Line 214:
|{{sortname|Butler|Lampson}}
|{{sortname|Butler|Lampson}}
|[[File:Professional Developers Conference 2009 Technical Leaders Panel 6 (cropped).jpg|alt=Butler Lampson |80px]]
|[[File:Professional Developers Conference 2009 Technical Leaders Panel 6 (cropped).jpg|alt=Butler Lampson |80px]]
|"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]]"<ref name="lampson">{{cite web |url=https://amturing.acm.org/award_winners/lampson_1142421.cfm |publisher=[[Association for Computing Machinery]] |author=Roy Levin |title=Butler W Lampson - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111124/https://amturing.acm.org/award_winners/lampson_1142421.cfm |url-status=live }}</ref>
|"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 monitor|displays]], [[computer security|security]] and [[word processor|document publishing]]"<ref name="lampson">{{cite web |url=https://amturing.acm.org/award_winners/lampson_1142421.cfm |publisher=[[Association for Computing Machinery]] |author=Roy Levin |title=Butler W Lampson - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111124/https://amturing.acm.org/award_winners/lampson_1142421.cfm |url-status=live }}</ref>
|[[Xerox PARC|PARC]]<br>[[Digital Equipment Corporation|DEC]]
|[[Xerox PARC|PARC]]<br>[[Digital Equipment Corporation|DEC]]
|-
|-
Line 223: Line 220:
|{{sortname|Juris|Hartmanis}}
|{{sortname|Juris|Hartmanis}}
|[[File:Juris Hartmanis(2002).jpg|alt=Juris Hartmanis |80px]]
|[[File:Juris Hartmanis(2002).jpg|alt=Juris Hartmanis |80px]]
|rowspan=2 |"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–99 |year=1994 |last=Stearns |first=R. E. |doi-access=free }}</ref><ref name="hartmanis">{{cite web |url=https://amturing.acm.org/award_winners/hartmanis_1059260.cfm |publisher=[[Association for Computing Machinery]] |author=Allan Borodin |title=Juris Hartmanis - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 21, 2024 |archive-url=https://web.archive.org/web/20240121135216/https://amturing.acm.org/award_winners/hartmanis_1059260.cfm |url-status=live }}</ref><ref name="stearns">{{cite web |url=https://amturing.acm.org/award_winners/stearns_1081900.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Richard ("Dick") Edwin Stearns - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 21, 2024 |archive-url=https://web.archive.org/web/20240121135216/https://amturing.acm.org/award_winners/stearns_1081900.cfm |url-status=live }}</ref>
|rowspan=2 |"In recognition of their seminal paper<ref>{{Cite journal |last=Hartmanis |first=J. |last2=Stearns |first2=R. E. |date=1965 |title=On the Computational Complexity of Algorithms |url=https://www.jstor.org/stable/1994208 |journal=Transactions of the American Mathematical Society |volume=117 |pages=285–306 |doi=10.2307/1994208 |issn=0002-9947}}</ref> 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–99 |year=1994 |last=Stearns |first=R. E. |doi-access=free }}</ref><ref name="hartmanis">{{cite web |url=https://amturing.acm.org/award_winners/hartmanis_1059260.cfm |publisher=[[Association for Computing Machinery]] |author=Allan Borodin |title=Juris Hartmanis - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 21, 2024 |archive-url=https://web.archive.org/web/20240121135216/https://amturing.acm.org/award_winners/hartmanis_1059260.cfm |url-status=live }}</ref><ref name="stearns">{{cite web |url=https://amturing.acm.org/award_winners/stearns_1081900.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Richard ("Dick") Edwin Stearns - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 21, 2024 |archive-url=https://web.archive.org/web/20240121135216/https://amturing.acm.org/award_winners/stearns_1081900.cfm |url-status=live }}</ref>
|rowspan=2 |General Electric Research Laboratory (now under [[Groupe Bull]], an [[Atos]] company)
|rowspan=2 |General Electric Research Laboratory (now under [[Groupe Bull]], an [[Atos]] company)
|-
|-
Line 242: Line 239:
|{{sortname|Manuel|Blum}}
|{{sortname|Manuel|Blum}}
|[[File:Blum manuel (cropped).jpg|alt=Manuel Blum |80px]]
|[[File:Blum manuel (cropped).jpg|alt=Manuel Blum |80px]]
|"In recognition of his contributions to the foundations of [[computational complexity theory]] and its application to [[cryptography]] and [[program verification|program checking]]"<ref name="Blum">{{cite web |author=Christos H. Papadimitriou |title=A.M. Turing Award Laureate – Manuel Blum |publisher=[[Association for Computing Machinery]] |url=https://amturing.acm.org/award_winners/blum_4659082.cfm |access-date=November 4, 2018 |archive-date=October 23, 2021 |archive-url=https://web.archive.org/web/20211023010431/https://amturing.acm.org/award_winners/blum_4659082.cfm |url-status=live }}</ref>
|"In recognition of his contributions to the foundations of [[computational complexity theory]] and its application to [[cryptography]] and [[formal verification|program checking]]"<ref name="Blum">{{cite web |author=Christos H. Papadimitriou |title=A.M. Turing Award Laureate – Manuel Blum |publisher=[[Association for Computing Machinery]] |url=https://amturing.acm.org/award_winners/blum_4659082.cfm |access-date=November 4, 2018 |archive-date=October 23, 2021 |archive-url=https://web.archive.org/web/20211023010431/https://amturing.acm.org/award_winners/blum_4659082.cfm |url-status=live }}</ref>
|[[University of California, Berkeley]]
|[[University of California, Berkeley]]
|-
|-
Line 248: Line 245:
|{{sortname|Amir|Pnueli}}
|{{sortname|Amir|Pnueli}}
|[[File:Amir Pnueli.jpg|alt=Amir Pnueli |80px]]
|[[File:Amir Pnueli.jpg|alt=Amir Pnueli |80px]]
|"For seminal work introducing [[temporal logic]] into computing science and for outstanding contributions to program and systems [[formal verification|verification]]"<ref name="Pnueli">{{cite web |author=Lenore Zuck |title=A.M. Turing Award Laureate – Amir Pnueli |publisher=[[Association for Computing Machinery]] |url=https://amturing.acm.org/award_winners/pnueli_4725172.cfm |access-date=November 4, 2018 |archive-date=October 20, 2021 |archive-url=https://web.archive.org/web/20211020112749/https://amturing.acm.org/award_winners/pnueli_4725172.cfm |url-status=live }}</ref>
|"For seminal work introducing [[temporal logic]] into computing science and for outstanding contributions to program and system [[formal verification|verification]]"<ref name="Pnueli">{{cite web |author=Lenore Zuck |title=A.M. Turing Award Laureate – Amir Pnueli |publisher=[[Association for Computing Machinery]] |url=https://amturing.acm.org/award_winners/pnueli_4725172.cfm |access-date=November 4, 2018 |archive-date=October 20, 2021 |archive-url=https://web.archive.org/web/20211020112749/https://amturing.acm.org/award_winners/pnueli_4725172.cfm |url-status=live }}</ref>
|[[Stanford University]]<br>[[Tel Aviv University]]<br>[[Weizmann Institute of Science]]<br>[[Courant Institute of Mathematical Sciences]]
|[[Stanford University]]<br>[[Tel Aviv University]]<br>[[Weizmann Institute of Science]]<br>[[Courant Institute of Mathematical Sciences]]
|-
|-
Line 266: Line 263:
|{{sortname|Fred|Brooks}}
|{{sortname|Fred|Brooks}}
|[[File:Fred Brooks (cropped).jpg|alt=Fred Brooks |80px]]
|[[File:Fred Brooks (cropped).jpg|alt=Fred Brooks |80px]]
|"For landmark contributions to [[computer architecture]], [[operating systems]], and software engineering"<ref name="brooks">{{cite web |url=https://amturing.acm.org/award_winners/brooks_1002187.cfm |publisher=[[Association for Computing Machinery]] |author=Grady Booch |title=Frederick ("Fred") Brooks - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111127/https://amturing.acm.org/award_winners/brooks_1002187.cfm |url-status=live }}</ref>
|"For landmark contributions to [[computer architecture]], [[operating system]]s, and software engineering"<ref name="brooks">{{cite web |url=https://amturing.acm.org/award_winners/brooks_1002187.cfm |publisher=[[Association for Computing Machinery]] |author=Grady Booch |title=Frederick ("Fred") Brooks - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 29, 2021 |archive-url=https://web.archive.org/web/20211029111127/https://amturing.acm.org/award_winners/brooks_1002187.cfm |url-status=live }}</ref>
|[[IBM]]<br>[[University of North Carolina at Chapel Hill]]
|[[IBM]]<br>[[University of North Carolina at Chapel Hill]]
|-
|-
Line 278: Line 275:
|{{sortname|Ole-Johan|Dahl}}
|{{sortname|Ole-Johan|Dahl}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|rowspan=2 |"For ideas fundamental to the emergence of [[object-oriented programming]], through their design of the programming languages [[Simula I]] and [[Simula 67]]"<ref name="dahl">{{cite web |url=https://amturing.acm.org/award_winners/dahl_6917600.cfm |publisher=[[Association for Computing Machinery]] |author=Andrew P. Black |title=Ole-Johan Dahl - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 12, 2021 |archive-url=https://web.archive.org/web/20211012080253/https://amturing.acm.org/award_winners/dahl_6917600.cfm |url-status=live }}</ref><ref name="nygaard">{{cite web |url=https://amturing.acm.org/award_winners/nygaard_5916220.cfm |publisher=[[Association for Computing Machinery]] |author=Ole Lehrman Madsen |title=Kristen Nygaard - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 28, 2023 |archive-url=https://web.archive.org/web/20231128055233/https://amturing.acm.org/award_winners/nygaard_5916220.cfm |url-status=live }}</ref>
|rowspan=2 |"For ideas fundamental to the emergence of [[object-oriented programming]], through their design of the programming languages [[Simula|Simula I and Simula 67]]"<ref name="dahl">{{cite web |url=https://amturing.acm.org/award_winners/dahl_6917600.cfm |publisher=[[Association for Computing Machinery]] |author=Andrew P. Black |title=Ole-Johan Dahl - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 12, 2021 |archive-url=https://web.archive.org/web/20211012080253/https://amturing.acm.org/award_winners/dahl_6917600.cfm |url-status=live }}</ref><ref name="nygaard">{{cite web |url=https://amturing.acm.org/award_winners/nygaard_5916220.cfm |publisher=[[Association for Computing Machinery]] |author=Ole Lehrman Madsen |title=Kristen Nygaard - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 28, 2023 |archive-url=https://web.archive.org/web/20231128055233/https://amturing.acm.org/award_winners/nygaard_5916220.cfm |url-status=live }}</ref>
|rowspan=2 |[[Norwegian Computing Center]]<br>[[University of Oslo]]
|rowspan=2 |[[Norwegian Computing Center]]<br>[[University of Oslo]]
|-
|-
Line 287: Line 284:
|{{sortname|Leonard|Adleman}}
|{{sortname|Leonard|Adleman}}
|[[File:Len-mankin-pic.jpg|alt=Leonard Adleman |80px]]
|[[File:Len-mankin-pic.jpg|alt=Leonard Adleman |80px]]
|rowspan=3 |"For [[RSA (algorithm)|their ingenious contribution]] for making [[public-key cryptography]] useful in practice"<ref name="rivest">{{cite web |url=https://amturing.acm.org/award_winners/rivest_1403005.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Ronald (Ron) Linn Rivest - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 11, 2021 |archive-url=https://web.archive.org/web/20211011044647/https://amturing.acm.org/award_winners/rivest_1403005.cfm |url-status=live }}</ref><ref name="shamir">{{cite web |url=https://amturing.acm.org/award_winners/shamir_2327856.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Adi Shamir - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=December 10, 2023 |archive-url=https://web.archive.org/web/20231210055322/https://amturing.acm.org/award_winners/shamir_2327856.cfm |url-status=live }}</ref><ref name="adleman">{{cite web |url=https://amturing.acm.org/award_winners/adleman_7308544.cfm |publisher=[[Association for Computing Machinery]] |author1=Joseph Bebel |author2=Shang-Hua Teng |title=Leonard (Len) Max Adleman - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 3, 2023 |archive-url=https://web.archive.org/web/20231003102050/https://amturing.acm.org/award_winners/adleman_7308544.cfm |url-status=live }}</ref>
|rowspan=3 |"For [[RSA cryptosystem|their ingenious contribution]] for making [[public-key cryptography]] useful in practice"<ref name="rivest">{{cite web |url=https://amturing.acm.org/award_winners/rivest_1403005.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Ronald (Ron) Linn Rivest - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 11, 2021 |archive-url=https://web.archive.org/web/20211011044647/https://amturing.acm.org/award_winners/rivest_1403005.cfm |url-status=live }}</ref><ref name="shamir">{{cite web |url=https://amturing.acm.org/award_winners/shamir_2327856.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Adi Shamir - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=December 10, 2023 |archive-url=https://web.archive.org/web/20231210055322/https://amturing.acm.org/award_winners/shamir_2327856.cfm |url-status=live }}</ref><ref name="adleman">{{cite web |url=https://amturing.acm.org/award_winners/adleman_7308544.cfm |publisher=[[Association for Computing Machinery]] |author1=Joseph Bebel |author2=Shang-Hua Teng |title=Leonard (Len) Max Adleman - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 3, 2023 |archive-url=https://web.archive.org/web/20231003102050/https://amturing.acm.org/award_winners/adleman_7308544.cfm |url-status=live }}</ref>
|[[University of Southern California]]
|[[University of Southern California]]
|-
|-
Line 300: Line 297:
|{{sortname|Alan|Kay}}
|{{sortname|Alan|Kay}}
|[[File:Alan Kay (3097597186) (cropped).jpg|alt=Alan Kay |80px]]
|[[File:Alan Kay (3097597186) (cropped).jpg|alt=Alan Kay |80px]]
|"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"<ref name="kay">{{cite web |url=https://amturing.acm.org/award_winners/kay_3972189.cfm |publisher=[[Association for Computing Machinery]] |author=Susan B. Barnes |title=Alan Kay - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 11, 2021 |archive-url=https://web.archive.org/web/20211011044645/https://amturing.acm.org/award_winners/kay_3972189.cfm |url-status=live }}</ref>
|"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"<ref name="kay">{{cite web |url=https://amturing.acm.org/award_winners/kay_3972189.cfm |publisher=[[Association for Computing Machinery]] |author=Susan B. Barnes |title=Alan Kay - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 11, 2021 |archive-url=https://web.archive.org/web/20211011044645/https://amturing.acm.org/award_winners/kay_3972189.cfm |url-status=live }}</ref>
|[[University of Utah]]<br>[[Xerox PARC|PARC]]<br>[[Stanford University]]<br>[[Atari Inc.|Atari]]<br>[[Apple Inc.|Apple]] [[Apple Advanced Technology Group|ATG]]<br>[[Walt Disney Imagineering]]<br>[[Viewpoints Research Institute]]<br>[[HP Inc.|HP]] [[HP Labs|Labs]]
|[[University of Utah]]<br>[[Xerox PARC|PARC]]<br>[[Stanford University]]<br>[[Atari Inc.|Atari]]<br>[[Apple Inc.|Apple]] [[Apple Advanced Technology Group|ATG]]<br>[[Walt Disney Imagineering]]<br>[[Viewpoints Research Institute]]<br>[[HP Inc.|HP]] [[HP Labs|Labs]]
|-
|-
Line 322: Line 319:
|{{sortname|Frances|Allen}}
|{{sortname|Frances|Allen}}
|[[File:Allen mg 2528-3750K-b.jpg|alt=Frances Allen |80px]]
|[[File:Allen mg 2528-3750K-b.jpg|alt=Frances Allen |80px]]
|"For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution"<ref name="allen">{{cite web |url=https://amturing.acm.org/award_winners/allen_1012327.cfm |publisher=[[Association for Computing Machinery]] |author=Guy Steele |title=Frances ("Fran") Elizabeth Allen - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=April 7, 2022 |archive-url=https://web.archive.org/web/20220407093736/https://amturing.acm.org/award_winners/allen_1012327.cfm |url-status=live }}</ref>
|"For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and [[automatic parallelization|automatic parallel execution]]"<ref name="allen">{{cite web |url=https://amturing.acm.org/award_winners/allen_1012327.cfm |publisher=[[Association for Computing Machinery]] |author=Guy Steele |title=Frances ("Fran") Elizabeth Allen - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=April 7, 2022 |archive-url=https://web.archive.org/web/20220407093736/https://amturing.acm.org/award_winners/allen_1012327.cfm |url-status=live }}</ref>
|[[IBM]]
|[[IBM]]
|-
|-
Line 328: Line 325:
|{{sortname|Edmund M.|Clarke}}
|{{sortname|Edmund M.|Clarke}}
|[[File:Edmund Clarke FLoC 2006 (cropped).jpg|alt=Edmund M. Clarke |80px]]
|[[File:Edmund Clarke FLoC 2006 (cropped).jpg|alt=Edmund M. Clarke |80px]]
|rowspan=3 |"For their role in developing [[model checking]] into a highly effective verification technology, widely adopted in the hardware and software industries"<ref>{{cite web|url=http://www.ddj.com/206103622|title=2007 Turing Award Winners Announced|access-date=December 9, 2008|archive-date=November 2, 2009|archive-url=https://web.archive.org/web/20091102080853/http://www.ddj.com/206103622|url-status=live}}</ref><ref name="clarke">{{cite web |url=https://amturing.acm.org/award_winners/clarke_1167964.cfm |publisher=[[Association for Computing Machinery]] |author=Ted Kirkpatrick |title=Edmund Melson Clarke - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 4, 2024 |archive-url=https://web.archive.org/web/20240104191130/https://amturing.acm.org/award_winners/clarke_1167964.cfm |url-status=live }}</ref><ref name="emerson">{{cite web |url=https://amturing.acm.org/award_winners/emerson_1671460.cfm |publisher=[[Association for Computing Machinery]] |author=Thomas Wahl |title=E. Allen Emerson - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 26, 2024 |archive-url=https://web.archive.org/web/20240226045725/https://amturing.acm.org/award_winners/emerson_1671460.cfm |url-status=live }}</ref><ref name="sifakis">{{cite web |url=https://amturing.acm.org/award_winners/sifakis_1701095.cfm |publisher=[[Association for Computing Machinery]] |author=Cristian S. Calude |title=Joseph Sifakis - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 28, 2023 |archive-url=https://web.archive.org/web/20231128055236/https://amturing.acm.org/award_winners/sifakis_1701095.cfm |url-status=live }}</ref>
|rowspan=3 |"For their role in developing [[model checking|Model-Checking]] into a highly effective verification technology that is widely adopted in the hardware and software industries"<ref>{{cite web|url=http://www.ddj.com/206103622|title=2007 Turing Award Winners Announced|access-date=December 9, 2008|archive-date=November 2, 2009|archive-url=https://web.archive.org/web/20091102080853/http://www.ddj.com/206103622|url-status=live}}</ref><ref name="clarke">{{cite web |url=https://amturing.acm.org/award_winners/clarke_1167964.cfm |publisher=[[Association for Computing Machinery]] |author=Ted Kirkpatrick |title=Edmund Melson Clarke - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 4, 2024 |archive-url=https://web.archive.org/web/20240104191130/https://amturing.acm.org/award_winners/clarke_1167964.cfm |url-status=live }}</ref><ref name="emerson">{{cite web |url=https://amturing.acm.org/award_winners/emerson_1671460.cfm |publisher=[[Association for Computing Machinery]] |author=Thomas Wahl |title=E. Allen Emerson - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 26, 2024 |archive-url=https://web.archive.org/web/20240226045725/https://amturing.acm.org/award_winners/emerson_1671460.cfm |url-status=live }}</ref><ref name="sifakis">{{cite web |url=https://amturing.acm.org/award_winners/sifakis_1701095.cfm |publisher=[[Association for Computing Machinery]] |author=Cristian S. Calude |title=Joseph Sifakis - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 28, 2023 |archive-url=https://web.archive.org/web/20231128055236/https://amturing.acm.org/award_winners/sifakis_1701095.cfm |url-status=live }}</ref>
|[[Harvard University]]<br>[[Carnegie Mellon University]]
|[[Harvard University]]<br>[[Carnegie Mellon University]]
|-
|-
Line 348: Line 345:
|{{sortname|Charles P.|Thacker}}
|{{sortname|Charles P.|Thacker}}
|[[File:Chuckthacker (cropped).jpg|alt=Charles P. Thacker |80px]]
|[[File:Chuckthacker (cropped).jpg|alt=Charles P. Thacker |80px]]
|"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]]"<ref name="thacker">{{cite web |url=https://amturing.acm.org/award_winners/thacker_1336106.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Charles P. (Chuck) Thacker - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 10, 2021 |archive-url=https://web.archive.org/web/20211010203149/https://amturing.acm.org/award_winners/thacker_1336106.cfm |url-status=live }}</ref>
|"For the pioneering design and realization of the first modern personal computer — the [[Xerox Alto|Alto at Xerox PARC]] — and seminal inventions and contributions to [[local area network]]s (including the [[Ethernet]]), multiprocessor workstations, snooping [[cache coherence]] protocols, and [[tablet computer|tablet personal computers]]"<ref name="thacker">{{cite web |url=https://amturing.acm.org/award_winners/thacker_1336106.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Charles P. (Chuck) Thacker - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=October 10, 2021 |archive-url=https://web.archive.org/web/20211010203149/https://amturing.acm.org/award_winners/thacker_1336106.cfm |url-status=live }}</ref>
|[[Xerox PARC|PARC]]<br>[[Digital Equipment Corporation|DEC]]<br>[[Microsoft]] [[Microsoft Research|Research]]
|[[Xerox PARC|PARC]]<br>[[Digital Equipment Corporation|DEC]]<br>[[Microsoft]] [[Microsoft Research|Research]]
|-
|-
Line 354: Line 351:
|{{sortname|Leslie|Valiant}}
|{{sortname|Leslie|Valiant}}
|[[File:Leslie Valiant (cropped).jpg|alt=Leslie Valiant |80px]]
|[[File:Leslie Valiant (cropped).jpg|alt=Leslie Valiant |80px]]
|"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"<ref name="valiant">{{cite web |url=https://amturing.acm.org/award_winners/valiant_2612174.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Leslie Gabriel Valiant - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 17, 2021 |archive-url=https://web.archive.org/web/20211117052920/https://amturing.acm.org/award_winners/valiant_2612174.cfm |url-status=live }}</ref>
|"For transformative contributions to the [[theory of computation]], including the theory of [[Probably approximately correct learning|probably approximately correct (PAC) learning]], the complexity of enumeration and of [[algebraic computation]], and the theory of parallel and distributed computing"<ref name="valiant">{{cite web |url=https://amturing.acm.org/award_winners/valiant_2612174.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Leslie Gabriel Valiant - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 17, 2021 |archive-url=https://web.archive.org/web/20211117052920/https://amturing.acm.org/award_winners/valiant_2612174.cfm |url-status=live }}</ref>
|[[Harvard University]]
|[[Harvard University]]
|-
|-
Line 366: Line 363:
|{{sortname|Shafi|Goldwasser}}
|{{sortname|Shafi|Goldwasser}}
|[[File:Shafi Goldwasser.JPG|alt=Shafi Goldwasser |80px]]
|[[File:Shafi Goldwasser.JPG|alt=Shafi Goldwasser |80px]]
|rowspan=2 |"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 name="goldwasser">{{cite web |url=https://amturing.acm.org/award_winners/goldwasser_8627889.cfm |publisher=[[Association for Computing Machinery]] |author=Charles Rackoff |title=Shafi Goldwasser - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 17, 2024 |archive-url=https://web.archive.org/web/20240217130805/https://amturing.acm.org/award_winners/goldwasser_8627889.cfm |url-status=live }}</ref><ref>{{cite web |url=http://www.acm.org/press-room/news-releases/2013/turing-award-12/ |title=Turing award 2012 |publisher=[[Association for Computing Machinery]] |url-status=dead |archive-url=https://web.archive.org/web/20130318034311/http://www.acm.org/press-room/news-releases/2013/turing-award-12/ |archive-date=March 18, 2013 }}</ref><ref name="micali">{{cite web |url=https://amturing.acm.org/award_winners/micali_9954407.cfm |publisher=[[Association for Computing Machinery]] |author=Avi Wigderson |title=Silvio Micali - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=December 11, 2023 |archive-url=https://web.archive.org/web/20231211070649/https://amturing.acm.org/award_winners/micali_9954407.cfm |url-status=live }}</ref>
|rowspan=2 |"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 name="goldwasser">{{cite web |url=https://amturing.acm.org/award_winners/goldwasser_8627889.cfm |publisher=[[Association for Computing Machinery]] |author=Charles Rackoff |title=Shafi Goldwasser - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=February 17, 2024 |archive-url=https://web.archive.org/web/20240217130805/https://amturing.acm.org/award_winners/goldwasser_8627889.cfm |url-status=live }}</ref><ref>{{cite web |url=http://www.acm.org/press-room/news-releases/2013/turing-award-12/ |title=Turing award 2012 |publisher=[[Association for Computing Machinery]] |url-status=dead |archive-url=https://web.archive.org/web/20130318034311/http://www.acm.org/press-room/news-releases/2013/turing-award-12/ |archive-date=March 18, 2013 }}</ref><ref name="micali">{{cite web |url=https://amturing.acm.org/award_winners/micali_9954407.cfm |publisher=[[Association for Computing Machinery]] |author=Avi Wigderson |title=Silvio Micali - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=December 11, 2023 |archive-url=https://web.archive.org/web/20231211070649/https://amturing.acm.org/award_winners/micali_9954407.cfm |url-status=live }}</ref>
|[[Massachusetts Institute of Technology]]<br>[[Weizmann Institute of Science]]
|[[Massachusetts Institute of Technology]]<br>[[Weizmann Institute of Science]]
|-
|-
Line 376: Line 373:
|{{sortname|Leslie|Lamport}}
|{{sortname|Leslie|Lamport}}
|[[File:Leslie Lamport.jpg|alt=Leslie Lamport |80px]]
|[[File:Leslie Lamport.jpg|alt=Leslie Lamport |80px]]
|"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=[[Association for Computing Machinery]]  |access-date=March 18, 2014 |archive-date=January 16, 2016 |archive-url=https://web.archive.org/web/20160116085443/http://amturing.acm.org/award_winners/lamport_1205376.cfm |url-status=live }}</ref><ref>{{cite journal |last1=Lamport |first1=L. |author-link=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 |citeseerx=10.1.1.155.4742 |s2cid=215822405 |access-date=August 28, 2015 |archive-date=October 31, 2008 |archive-url=https://web.archive.org/web/20081031234845/http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf |url-status=live }}</ref><ref name="lamport">{{cite web |url=https://amturing.acm.org/award_winners/lamport_1205376.cfm |publisher=[[Association for Computing Machinery]] |author1=Dahlia Malkhi |author2=Martin Abadi |author3=Hagit Attiya |author4=Idit Keidar |author5=Nancy Lynch |author6=Nir Shavit |author7=George Varghese |author8=Len Shustek |title=Leslie Lamport - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=June 1, 2023 |archive-url=https://web.archive.org/web/20230601004222/https://amturing.acm.org/award_winners/lamport_1205376.cfm |url-status=live }}</ref>
|"For fundamental contributions to the theory and practice of distributed and concurrent systems, notably the invention of concepts such as causality and [[logical clock]]s, [[Safety and liveness properties|safety and liveness]], [[replicated state machine]]s, and [[sequential consistency]]"<ref>{{cite web |url=http://amturing.acm.org/award_winners/lamport_1205376.cfm |title=Turing award 2013 |publisher=[[Association for Computing Machinery]]  |access-date=March 18, 2014 |archive-date=January 16, 2016 |archive-url=https://web.archive.org/web/20160116085443/http://amturing.acm.org/award_winners/lamport_1205376.cfm |url-status=live }}</ref><ref>{{cite journal |last1=Lamport |first1=L. |author-link=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 |citeseerx=10.1.1.155.4742 |s2cid=215822405 |access-date=August 28, 2015 |archive-date=October 31, 2008 |archive-url=https://web.archive.org/web/20081031234845/http://research.microsoft.com/users/lamport/pubs/time-clocks.pdf |url-status=live }}</ref><ref name="lamport">{{cite web |url=https://amturing.acm.org/award_winners/lamport_1205376.cfm |publisher=[[Association for Computing Machinery]] |author1=Dahlia Malkhi |author2=Martin Abadi |author3=Hagit Attiya |author4=Idit Keidar |author5=Nancy Lynch |author6=Nir Shavit |author7=George Varghese |author8=Len Shustek |title=Leslie Lamport - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=June 1, 2023 |archive-url=https://web.archive.org/web/20230601004222/https://amturing.acm.org/award_winners/lamport_1205376.cfm |url-status=live }}</ref>
|[[Massachusetts Computer Associates]] (now under Essig PLM)<br>[[SRI International]]<br>[[Digital Equipment Corporation|DEC]]<br>[[Compaq]] (now under [[HP Inc.|HP]])<br>[[Microsoft]] [[Microsoft Research|Research]]
|[[Massachusetts Computer Associates]] (now under Essig PLM)<br>[[SRI International]]<br>[[Digital Equipment Corporation|DEC]]<br>[[Compaq]] (now under [[HP Inc.|HP]])<br>[[Microsoft]] [[Microsoft Research|Research]]
|-
|-
Line 388: Line 385:
|{{sortname|Whitfield|Diffie}}
|{{sortname|Whitfield|Diffie}}
|[[File:Whitfield Diffie Royal Society (cropped).jpg|alt=Whitfield Diffie |80px]]
|[[File:Whitfield Diffie Royal Society (cropped).jpg|alt=Whitfield Diffie |80px]]
|rowspan=2 |"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 |citeseerx=10.1.1.37.9720 |access-date=March 4, 2016 |archive-date=December 3, 2017 |archive-url=https://web.archive.org/web/20171203090237/https://www-ee.stanford.edu/~hellman/publications/24.pdf |url-status=live }}</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 name="diffie">{{cite web |url=http://amturing.acm.org/award_winners/diffie_8371646.cfm |title=Cryptography Pioneers Receive 2015 ACM A.M. Turing Award |publisher=[[Association for Computing Machinery]] |access-date=March 1, 2016 |archive-date=July 4, 2017 |archive-url=https://web.archive.org/web/20170704184453/http://amturing.acm.org/award_winners/diffie_8371646.cfm |url-status=live }}</ref><ref name="hellman">{{cite web |url=https://amturing.acm.org/award_winners/hellman_4055781.cfm |publisher=[[Association for Computing Machinery]] |author=Jeffrey R. Yost |title=Martin Hellman - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=September 22, 2022 |archive-url=https://web.archive.org/web/20220922011018/https://amturing.acm.org/award_winners/hellman_4055781.cfm |url-status=live }}</ref>
|rowspan=2 |"For inventing and promulgating both asymmetric public-key cryptography, including its application to digital signatures, and a practical cryptographic key-exchange method<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 |bibcode=1976ITIT...22..644D |citeseerx=10.1.1.37.9720 |access-date=March 4, 2016 |archive-date=December 3, 2017 |archive-url=https://web.archive.org/web/20171203090237/https://www-ee.stanford.edu/~hellman/publications/24.pdf |url-status=live }}</ref><ref name="diffie">{{cite web |url=http://amturing.acm.org/award_winners/diffie_8371646.cfm |title=Cryptography Pioneers Receive 2015 ACM A.M. Turing Award |publisher=[[Association for Computing Machinery]] |access-date=March 1, 2016 |archive-date=July 4, 2017 |archive-url=https://web.archive.org/web/20170704184453/http://amturing.acm.org/award_winners/diffie_8371646.cfm |url-status=live }}</ref><ref name="hellman">{{cite web |url=https://amturing.acm.org/award_winners/hellman_4055781.cfm |publisher=[[Association for Computing Machinery]] |author=Jeffrey R. Yost |title=Martin Hellman - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=September 22, 2022 |archive-url=https://web.archive.org/web/20220922011018/https://amturing.acm.org/award_winners/hellman_4055781.cfm |url-status=live }}</ref>
|rowspan=2 |[[Stanford University]]
|rowspan=2 |[[Stanford University]]
|-
|-
Line 427: Line 424:
|{{sortname|Edwin|Catmull}}
|{{sortname|Edwin|Catmull}}
|[[File:VES Awards 89 cropped.jpg|alt=Edwin Catmull |80px]]
|[[File:VES Awards 89 cropped.jpg|alt=Edwin Catmull |80px]]
|rowspan=2 |"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"<ref>{{Cite web|title=2019 ACM A.M. Turing Award Laureates|url=https://awards.acm.org/about/2019-turing|access-date=2023-02-11 |publisher=[[Association for Computing Machinery]] |language=en|archive-date=March 18, 2020|archive-url=https://web.archive.org/web/20200318184230/https://awards.acm.org/about/2019-turing|url-status=live}}</ref><ref name="catmull">{{cite web |url=https://amturing.acm.org/award_winners/catmull_1244219.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Edwin E. Catmull - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 23, 2023 |archive-url=https://web.archive.org/web/20231123033148/https://amturing.acm.org/award_winners/catmull_1244219.cfm |url-status=live }}</ref><ref name="hanrahan">{{cite web |url=https://amturing.acm.org/award_winners/hanrahan_4652251.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Patrick M. Hanrahan - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 4, 2024 |archive-url=https://web.archive.org/web/20240104191129/https://amturing.acm.org/award_winners/hanrahan_4652251.cfm |url-status=live }}</ref>
|rowspan=2 |"For fundamental contributions to [[3D computer graphics]], and the impact of [[computer-generated imagery]] (CGI) in filmmaking and other applications"<ref>{{Cite web|title=2019 ACM A.M. Turing Award Laureates|url=https://awards.acm.org/about/2019-turing|access-date=2023-02-11 |publisher=[[Association for Computing Machinery]] |language=en|archive-date=March 18, 2020|archive-url=https://web.archive.org/web/20200318184230/https://awards.acm.org/about/2019-turing|url-status=live}}</ref><ref name="catmull">{{cite web |url=https://amturing.acm.org/award_winners/catmull_1244219.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Edwin E. Catmull - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=November 23, 2023 |archive-url=https://web.archive.org/web/20231123033148/https://amturing.acm.org/award_winners/catmull_1244219.cfm |url-status=live }}</ref><ref name="hanrahan">{{cite web |url=https://amturing.acm.org/award_winners/hanrahan_4652251.cfm |publisher=[[Association for Computing Machinery]] |author= |title=Patrick M. Hanrahan - A.M. Turing Award Laureate |access-date=4 March 2024 |archive-date=January 4, 2024 |archive-url=https://web.archive.org/web/20240104191129/https://amturing.acm.org/award_winners/hanrahan_4652251.cfm |url-status=live }}</ref>
|[[University of Utah]]<br>[[Pixar]]<br>[[Walt Disney Animation Studios]]
|[[University of Utah]]<br>[[Pixar]]<br>[[Walt Disney Animation Studios]]
|-
|-
Line 459: Line 456:
|{{sortname|Avi|Wigderson}}
|{{sortname|Avi|Wigderson}}
|[[File:Avi Wigderson (London 2012) Cropped.jpg|alt=Avi Wigderson |80px]]
|[[File:Avi Wigderson (London 2012) Cropped.jpg|alt=Avi Wigderson |80px]]
|"For reshaping our understanding of the role of randomness in computation, and for decades of intellectual leadership in theoretical computer science"<ref name="wigderson">{{Cite web |title=Avi Wigderson of the Institute for Advanced Study is the recipient of the 2023 ACM A.M. Turing Award |url=https://awards.acm.org/about/2023-turing |access-date=2024-04-10 |website=awards.acm.org |language=en |archive-date=April 10, 2024 |archive-url=https://web.archive.org/web/20240410094325/https://awards.acm.org/about/2023-turing |url-status=live }}</ref>
|"For foundational contributions to the theory of computation, including reshaping our understanding of the role of randomness in computation and mathematics, and for his decades of intellectual leadership in theoretical computer science"<ref name="wigderson">{{Cite web |title=Avi Wigderson of the Institute for Advanced Study is the recipient of the 2023 ACM A.M. Turing Award |url=https://awards.acm.org/about/2023-turing |access-date=2024-04-10 |website=awards.acm.org |language=en |archive-date=April 10, 2024 |archive-url=https://web.archive.org/web/20240410094325/https://awards.acm.org/about/2023-turing |url-status=live }}</ref><ref>{{Cite web |title=Avi Wigderson - A.M. Turing Award Laureate |url=https://amturing.acm.org/award_winners/wigderson_3844537.cfm |access-date=2025-10-18 |website=amturing.acm.org}}</ref>
|[[Institute for Advanced Study]], [[Princeton University]], [[Hebrew University of Jerusalem]]
|[[Institute for Advanced Study]], [[Princeton University]], [[Hebrew University of Jerusalem]]
|-
|-
Line 465: Line 462:
|{{sortname|Andrew|Barto}}
|{{sortname|Andrew|Barto}}
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|align="center" |[[File:No image.svg|80px]]<!-- Per WP:NFCC, non-free images are not to be used on lists. If you have any questions or would like to help with sourcing free-use images in the public domain, please start a discussion on the talk page. -->
|rowspan=2 |"For developing the conceptual and algorithmic foundations of [[reinforcement learning]]"<ref name="BartoSutton"/>
|rowspan=2 |"For developing the conceptual and algorithmic foundations of [[reinforcement learning]]"<ref name="BartoSutton"/><ref>{{Cite web |title=Andrew Barto - A.M. Turing Award Laureate |url=https://amturing.acm.org/award_winners/barto_9471663.cfm |access-date=2025-10-18 |website=amturing.acm.org}}</ref><ref>{{Cite web |title=Dr. Richard Sutton - A.M. Turing Award Laureate |url=https://amturing.acm.org/award_winners/sutton_0160594.cfm |access-date=2025-10-18 |website=amturing.acm.org}}</ref>
|[[University of Massachusetts Amherst]]
|[[University of Massachusetts Amherst]]
|-
|-
Line 477: Line 474:
{{columns-list|
{{columns-list|
* [[Fields Medal]]
* [[Fields Medal]]
* [[ACM Prize in Computing]]
* [[IEEE John von Neumann Medal]]
* [[IEEE John von Neumann Medal]]
* [[List of awards named after people]]
* [[List of awards named after people]]
Line 487: Line 485:


== References ==
== References ==
{{notelist}}
{{Reflist}}
{{Reflist}}


Latest revision as of 02:12, 16 November 2025

Template:Short description Template:Main other Template:Use mdy dates Template:Infobox 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. It is generally recognized as the highest distinction in the field of computer science and is often referred to as the "Nobel Prize of Computing". Template:As of, 79 people have been awarded the prize, with the most recent recipients being Andrew Barto and Richard S. Sutton, who won in 2024.[1][2][3][4][5]

The award is named after Alan Turing, also referred as "Father of Computer Science", who was a British mathematician and reader in mathematics at the University of Manchester. Turing is often credited as being the founder of theoretical computer science and artificial intelligence,[6] and a key contributor to the Allied cryptanalysis of the Enigma cipher during World War II.[7] From 2007 to 2013, the award was accompanied by a prize of Template:US$, with financial support provided by Intel and Google.[1][8] Since 2014, the award has been accompanied by a prize of Template:US$ million, with financial support provided by Google.[9][10]

The first recipient, in 1966, was Alan Perlis. The youngest recipient was Donald Knuth, who won in 1974 at the age of 36,[11] while the oldest recipient was Alfred Aho, who won in 2020 at the age of 79.[12] Only three women have been awarded the prize: Frances Allen (in 2006),[13] Barbara Liskov (in 2008),[14] and Shafi Goldwasser (in 2012).[15]

Photo of The Turing Award on display at Nokia Bell Labs, August 2025.
The Turing Award of 1983, given to Dennis Ritchie and Ken Thompson, on display at Nokia Bell Labs.

Recipients

Recipients of the ACM Turing award
Year Recipient(s) Photo Rationale Affiliated institute(s)
1966 Template:Sortname File:No image.svg "For his influence in the area of advanced computer programming techniques and compiler construction"[16][17] Carnegie Mellon University
1967 Template:Sortname Maurice Wilkes For contributions including being "the builder and designer of the EDSAC, the second computer with an internally stored program" and introducing program libraries (together with David Wheeler and Stanley Gill)[18][19] University of Cambridge
1968 Template:Sortname File:No image.svg "For his work on numerical methods, automatic coding systems, and error-detecting and error-correcting codes"[20][21] University of Louisville
Bell Labs
1969 Template:Sortname Marvin Minsky "For his central role in creating, shaping, promoting, and advancing the field of artificial intelligence"[22][23] Massachusetts Institute of Technology
1970 Template:Sortname File:No image.svg "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"[24][25] National Physical Laboratory
1971 Template:Sortname John McCarthy Award citation refers to McCarthy's lecture "The Present State of Research on Artificial Intelligence"[26][27] Stanford University
1972 Template:Sortname Edsger W. Dijkstra "For fundamental contributions to programming as a high, intellectual challenge; for eloquent insistence and practical demonstration that programs should be composed correctly, not just debugged into correctness; for illuminating perception of problems at the foundations of program design"[28][29] Centrum Wiskunde & Informatica
Eindhoven University of Technology
University of Texas at Austin
1973 Template:Sortname Charles Bachman "For his outstanding contributions to database technology"[30][31] General Electric Research Laboratory (now under Groupe Bull, an Atos company)
1974 Template:Sortname 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"[32][33] California Institute of Technology
Center for Communications Research, Center for Communications and Computing, Institute for Defense Analyses
Stanford University
1975 Template:Sortname File:No image.svg In collaboration with J. C. Shaw and others, for "basic contributions to artificial intelligence, the psychology of human cognition, and list processing."[34][35][36] RAND Corporation
Carnegie Mellon University
Template:Sortname

Herbert A. Simon

1976 Template:Sortname Michael O. Rabin "For their joint paper 'Finite Automata and Their Decision Problem',[37] which introduced the idea of nondeterministic machines"[38][39][40][41] Princeton University
Template:Sortname Dana Scott University of Chicago
1977 Template:Sortname 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"[42][43] IBM
1978 Template:Sortname File:No image.svg "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"[44][45] Carnegie Mellon University
Stanford University
1979 Template:Sortname File:No image.svg "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"[46][47] IBM
1980 Template:Sortname Tony Hoare "For his fundamental contributions to the definition and design of programming languages"[48][49] Queen's University Belfast
University of Oxford
1981 Template:Sortname File:No image.svg "For his fundamental and continuing contributions to the theory and practice of database management systems"[50][51] IBM
1982 Template:Sortname Stephen Cook For "his advancement of our understanding of the complexity of computation in a significant and profound way"; the citation in particular mentions his paper "The Complexity of Theorem Proving Procedures," which is credited with founding the theory of NP-completeness[52][53] University of Toronto
1983 Template:Sortname Dennis Ritchie "For their development of generic operating systems theory and specifically for the implementation of the UNIX operating system"[54][55] Bell Labs
Template:Sortname Ken Thompson
1984 Template:Sortname Niklaus Wirth "For developing a sequence of innovative computer languages, EULER, ALGOL-W, MODULA and PASCAL"[56] Stanford University
University of Zurich
ETH Zurich
1985 Template:Sortname 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"[57] University of California, Berkeley
1986 Template:Sortname John Hopcroft "For fundamental achievements in the design and analysis of algorithms and data structures"[58][59] Cornell University
Template:Sortname Robert Tarjan Stanford University
Cornell University
University of California, Berkeley
Princeton University
1987 Template:Sortname File:No image.svg "For significant contributions in the design and theory of compilers, the architecture of large systems and the development of reduced instruction set computers (RISC); for discovering and systematizing many fundamental transformations now used in optimizing compilers including reduction of operator strength, elimination of common subexpressions, register allocation, constant propagation, and dead code elimination"[60] IBM
1988 Template:Sortname Ivan Sutherland "For his pioneering and visionary contributions to computer graphics, starting with Sketchpad, and continuing after"[61] Stanford University
Harvard University
University of Utah
California Institute of Technology
1989 Template:Sortname William Kahan "For his fundamental contributions to numerical analysis" and as "one of the foremost experts on floating-point computations"[62] University of California, Berkeley
1990 Template:Sortname 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"[63] Massachusetts Institute of Technology
1991 Template:Sortname File:No image.svg The award citation mentions three primary contributions: his mechanization of the Logic of Computable Functions; the programming language ML including its type inference and type safety; the calculus of communicating systems; as well as the connection between operational and denotational semantics[64][65] Stanford University
University of Edinburgh
1992 Template:Sortname 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"[66] PARC
DEC
1993 Template:Sortname Juris Hartmanis "In recognition of their seminal paper[67] which established the foundations for the field of computational complexity theory"[68][69][70] General Electric Research Laboratory (now under Groupe Bull, an Atos company)
Template:Sortname Richard E. Stearns
1994 Template:Sortname Edward A. 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"[71][72][73] Stanford University
Template:Sortname Raj Reddy Stanford University
Carnegie Mellon University
1995 Template:Sortname Manuel Blum "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking"[74] University of California, Berkeley
1996 Template:Sortname Amir Pnueli "For seminal work introducing temporal logic into computing science and for outstanding contributions to program and system verification"[75] Stanford University
Tel Aviv University
Weizmann Institute of Science
Courant Institute of Mathematical Sciences
1997 Template:Sortname Douglas Engelbart "For an inspiring vision of the future of interactive computing and the invention of key technologies to help realize this vision"[76] SRI International
Tymshare
McDonnell Douglas
Bootstrap Institute/Alliance,[77]
The Doug Engelbart Institute
1998 Template:Sortname Jim Gray "For seminal contributions to database and transaction processing research and technical leadership in system implementation"[78] IBM
Microsoft
1999 Template:Sortname Fred Brooks "For landmark contributions to computer architecture, operating systems, and software engineering"[79] IBM
University of North Carolina at Chapel Hill
2000 Template:Sortname 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"[80] Stanford University
University of California, Berkeley
Princeton University
2001 Template:Sortname File:No image.svg "For ideas fundamental to the emergence of object-oriented programming, through their design of the programming languages Simula I and Simula 67"[81][82] Norwegian Computing Center
University of Oslo
Template:Sortname Kristen Nygaard
2002 Template:Sortname Leonard Adleman "For their ingenious contribution for making public-key cryptography useful in practice"[83][84][85] University of Southern California
Template:Sortname Ron Rivest Massachusetts Institute of Technology
Template:Sortname Adi Shamir
2003 Template:Sortname 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"[86] University of Utah
PARC
Stanford University
Atari
Apple ATG
Walt Disney Imagineering
Viewpoints Research Institute
HP Labs
2004 Template:Sortname 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"[87][88] University of California, Los Angeles
Stanford University, DARPA
MCI (now under Verizon)
CNRI, Google
Template:Sortname Bob Kahn Massachusetts Institute of Technology
Bolt Beranek and Newman
DARPA
CNRI
2005 Template:Sortname 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"[89] Regnecentralen (now under Fujitsu)
University of Copenhagen
2006 Template:Sortname 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"[90] IBM
2007 Template:Sortname Edmund M. Clarke "For their role in developing Model-Checking into a highly effective verification technology that is widely adopted in the hardware and software industries"[91][92][93][94] Harvard University
Carnegie Mellon University
Template:Sortname E. Allen Emerson Harvard University
University of Texas at Austin
Template:Sortname Joseph Sifakis French National Centre for Scientific Research
2008 Template:Sortname 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"[14] Massachusetts Institute of Technology
2009 Template:Sortname Charles P. Thacker "For the pioneering design and realization of the first modern personal computer — the Alto at Xerox PARC — and seminal inventions and contributions to local area networks (including the Ethernet), multiprocessor workstations, snooping cache coherence protocols, and tablet personal computers"[95] PARC
DEC
Microsoft Research
2010 Template:Sortname 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"[96] Harvard University
2011 Template:Sortname Judea Pearl "For fundamental contributions to artificial intelligence through the development of a calculus for probabilistic and causal reasoning"[97][98] University of California, Los Angeles
New Jersey Institute of Technology
2012 Template:Sortname 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"[15][99][100] Massachusetts Institute of Technology
Weizmann Institute of Science
Template:Sortname Silvio Micali Massachusetts Institute of Technology
2013 Template:Sortname 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"[101][102][103] Massachusetts Computer Associates (now under Essig PLM)
SRI International
DEC
Compaq (now under HP)
Microsoft Research
2014 Template:Sortname Michael Stonebraker "For fundamental contributions to the concepts and practices underlying modern database systems"[104][105] University of California, Berkeley
Massachusetts Institute of Technology
2015 Template:Sortname Whitfield Diffie "For inventing and promulgating both asymmetric public-key cryptography, including its application to digital signatures, and a practical cryptographic key-exchange method[106][107][108] Stanford University
Template:Sortname Martin Hellman
2016 Template:Sortname Tim Berners-Lee "For inventing the World Wide Web, the first web browser, and the fundamental protocols and algorithms allowing the Web to scale"[109] CERN
Massachusetts Institute of Technology
World Wide Web Consortium
2017 Template:Sortname John L. Hennessy "For pioneering a systematic, quantitative approach to the design and evaluation of computer architectures with enduring impact on the microprocessor industry"[110][111][112] Stanford University
Template:Sortname David Patterson University of California, Berkeley
2018 Template:Sortname Yoshua Bengio "For conceptual and engineering breakthroughs that have made deep neural networks a critical component of computing"[113][114][115][116] Script error: No such module "Lang"., McGill University,
Mila
Template:Sortname Geoffrey Hinton University of Toronto
University of California, San Diego
Carnegie Mellon University
University College London
University of Edinburgh
Google AI
Template:Sortname Yann LeCun University of Toronto
Bell Labs
Courant Institute of Mathematical Sciences, New York University
Meta AI
2019 Template:Sortname Edwin Catmull "For fundamental contributions to 3D computer graphics, and the impact of computer-generated imagery (CGI) in filmmaking and other applications"[117][118][119] University of Utah
Pixar
Walt Disney Animation Studios
Template:Sortname Pat Hanrahan Pixar
Princeton University
Stanford University
2020 Template:Sortname File:No image.svg "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"[120][121][122] Bell Labs
Columbia University
Template:Sortname File:No image.svg Bell Labs
Princeton University
Stanford University
2021 Template:Sortname 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"[123][124] Argonne National Laboratory
Oak Ridge National Laboratory
University of Manchester
Texas A&M University Institute for Advanced Study
University of Tennessee
Rice University
2022 Template:Sortname Robert Metcalfe "For the invention, standardization, and commercialization of Ethernet"[125] Massachusetts Institute of Technology, Harvard University, Xerox PARC, University of Texas at Austin
2023 Template:Sortname Avi Wigderson "For foundational contributions to the theory of computation, including reshaping our understanding of the role of randomness in computation and mathematics, and for his decades of intellectual leadership in theoretical computer science"[126][127] Institute for Advanced Study, Princeton University, Hebrew University of Jerusalem
2024 Template:Sortname File:No image.svg "For developing the conceptual and algorithmic foundations of reinforcement learning"[2][128][129] University of Massachusetts Amherst
Template:Sortname Richard S. Sutton University of Alberta
Amii

See also

Template:Columns-list

References

Template:Notelist Template:Reflist

Further reading

  • Script error: No such module "citation/CS1".

External links

Template:Sister project

Template:Turing award Template:Association for Computing Machinery

Template:Authority control

  1. ↑ a b Script error: No such module "citation/CS1".
  2. ↑ a b Script error: No such module "citation/CS1".
  3. ↑ Script error: No such module "citation/CS1".
  4. ↑ Script error: No such module "citation/CS1".
  5. ↑ Script error: No such module "citation/CS1".
  6. ↑ Script error: No such module "citation/CS1".
  7. ↑ Script error: No such module "citation/CS1".
  8. ↑ Script error: No such module "citation/CS1".
  9. ↑ Cite error: Invalid <ref> tag; no text was provided for refs named million
  10. ↑ Script error: No such module "citation/CS1".
  11. ↑ Script error: No such module "citation/CS1".
  12. ↑ Script error: No such module "citation/CS1".
  13. ↑ Script error: No such module "citation/CS1".
  14. ↑ a b Script error: No such module "citation/CS1".
  15. ↑ a b Script error: No such module "citation/CS1".
  16. ↑ Script error: No such module "Citation/CS1".
  17. ↑ Script error: No such module "citation/CS1".
  18. ↑ Script error: No such module "Citation/CS1".
  19. ↑ Script error: No such module "citation/CS1".
  20. ↑ Script error: No such module "Citation/CS1".
  21. ↑ Script error: No such module "citation/CS1".
  22. ↑ Script error: No such module "Citation/CS1".
  23. ↑ Script error: No such module "citation/CS1".
  24. ↑ Script error: No such module "Citation/CS1".
  25. ↑ Script error: No such module "citation/CS1".
  26. ↑ Script error: No such module "Citation/CS1".
  27. ↑ Script error: No such module "citation/CS1".
  28. ↑ Script error: No such module "Citation/CS1".
  29. ↑ Script error: No such module "citation/CS1".
  30. ↑ Script error: No such module "Citation/CS1".
  31. ↑ Script error: No such module "citation/CS1".
  32. ↑ Script error: No such module "Citation/CS1".
  33. ↑ Script error: No such module "citation/CS1".
  34. ↑ Script error: No such module "Citation/CS1".
  35. ↑ Script error: No such module "citation/CS1".
  36. ↑ Script error: No such module "citation/CS1".
  37. ↑ Script error: No such module "Citation/CS1".
  38. ↑ Script error: No such module "Citation/CS1".
  39. ↑ Script error: No such module "Citation/CS1".
  40. ↑ Script error: No such module "citation/CS1".
  41. ↑ Script error: No such module "citation/CS1".
  42. ↑ Script error: No such module "Citation/CS1".
  43. ↑ Script error: No such module "citation/CS1".
  44. ↑ Script error: No such module "Citation/CS1".
  45. ↑ Script error: No such module "citation/CS1".
  46. ↑ Script error: No such module "Citation/CS1".
  47. ↑ Script error: No such module "citation/CS1".
  48. ↑ Script error: No such module "Citation/CS1".
  49. ↑ Script error: No such module "citation/CS1".
  50. ↑ Script error: No such module "Citation/CS1".
  51. ↑ Script error: No such module "citation/CS1".
  52. ↑ Script error: No such module "Citation/CS1".
  53. ↑ Script error: No such module "citation/CS1".
  54. ↑ Script error: No such module "citation/CS1".
  55. ↑ Script error: No such module "citation/CS1".
  56. ↑ Script error: No such module "citation/CS1".
  57. ↑ Script error: No such module "citation/CS1".
  58. ↑ Script error: No such module "citation/CS1".
  59. ↑ Script error: No such module "citation/CS1".
  60. ↑ Script error: No such module "citation/CS1".
  61. ↑ Script error: No such module "citation/CS1".
  62. ↑ Script error: No such module "citation/CS1".
  63. ↑ Script error: No such module "citation/CS1".
  64. ↑ Script error: No such module "Citation/CS1".
  65. ↑ Script error: No such module "citation/CS1".
  66. ↑ Script error: No such module "citation/CS1".
  67. ↑ Script error: No such module "Citation/CS1".
  68. ↑ Script error: No such module "Citation/CS1".
  69. ↑ Script error: No such module "citation/CS1".
  70. ↑ Script error: No such module "citation/CS1".
  71. ↑ Script error: No such module "Citation/CS1".
  72. ↑ Script error: No such module "citation/CS1".
  73. ↑ Script error: No such module "citation/CS1".
  74. ↑ Script error: No such module "citation/CS1".
  75. ↑ Script error: No such module "citation/CS1".
  76. ↑ Script error: No such module "citation/CS1".
  77. ↑ Script error: No such module "citation/CS1".
  78. ↑ Script error: No such module "citation/CS1".
  79. ↑ Script error: No such module "citation/CS1".
  80. ↑ Script error: No such module "citation/CS1".
  81. ↑ Script error: No such module "citation/CS1".
  82. ↑ Script error: No such module "citation/CS1".
  83. ↑ Script error: No such module "citation/CS1".
  84. ↑ Script error: No such module "citation/CS1".
  85. ↑ Script error: No such module "citation/CS1".
  86. ↑ Script error: No such module "citation/CS1".
  87. ↑ Script error: No such module "citation/CS1".
  88. ↑ Script error: No such module "citation/CS1".
  89. ↑ Script error: No such module "citation/CS1".
  90. ↑ Script error: No such module "citation/CS1".
  91. ↑ Script error: No such module "citation/CS1".
  92. ↑ Script error: No such module "citation/CS1".
  93. ↑ Script error: No such module "citation/CS1".
  94. ↑ Script error: No such module "citation/CS1".
  95. ↑ Script error: No such module "citation/CS1".
  96. ↑ Script error: No such module "citation/CS1".
  97. ↑ Script error: No such module "citation/CS1".
  98. ↑ Script error: No such module "citation/CS1".
  99. ↑ Script error: No such module "citation/CS1".
  100. ↑ Script error: No such module "citation/CS1".
  101. ↑ Script error: No such module "citation/CS1".
  102. ↑ Script error: No such module "Citation/CS1".
  103. ↑ Script error: No such module "citation/CS1".
  104. ↑ Script error: No such module "citation/CS1".
  105. ↑ Script error: No such module "citation/CS1".
  106. ↑ Script error: No such module "Citation/CS1".
  107. ↑ Script error: No such module "citation/CS1".
  108. ↑ Script error: No such module "citation/CS1".
  109. ↑ Script error: No such module "citation/CS1".
  110. ↑ Script error: No such module "citation/CS1".
  111. ↑ Script error: No such module "citation/CS1".
  112. ↑ Script error: No such module "citation/CS1".
  113. ↑ Script error: No such module "citation/CS1".
  114. ↑ Script error: No such module "citation/CS1".
  115. ↑ Script error: No such module "citation/CS1".
  116. ↑ Script error: No such module "citation/CS1".
  117. ↑ Script error: No such module "citation/CS1".
  118. ↑ Script error: No such module "citation/CS1".
  119. ↑ Script error: No such module "citation/CS1".
  120. ↑ Script error: No such module "citation/CS1".
  121. ↑ Script error: No such module "citation/CS1".
  122. ↑ Script error: No such module "citation/CS1".
  123. ↑ Script error: No such module "citation/CS1".
  124. ↑ Script error: No such module "citation/CS1".
  125. ↑ Script error: No such module "citation/CS1".
  126. ↑ Script error: No such module "citation/CS1".
  127. ↑ Script error: No such module "citation/CS1".
  128. ↑ Script error: No such module "citation/CS1".
  129. ↑ Script error: No such module "citation/CS1".
Retrieved from "http://debianws.lexgopc.com/wiki143/index.php?title=Turing_Award&oldid=3146774"