Donald Knuth: Difference between revisions
Jump to navigation
Jump to search
imported>Reschultzed |
imported>GünniX Category |
||
| Line 2: | Line 2: | ||
{{Use mdy dates|date=September 2015}} | {{Use mdy dates|date=September 2015}} | ||
{{Infobox scientist | {{Infobox scientist | ||
| name = Donald Knuth | |||
| birth_name = Donald Ervin Knuth | | birth_name = Donald Ervin Knuth | ||
| image = Donald Ervin Knuth (cropped).jpg | | image = Donald Ervin Knuth (cropped).jpg | ||
| Line 10: | Line 11: | ||
| children = 2 | | children = 2 | ||
| field = {{ublist|[[Mathematics]]|[[Computer science]]}} | | field = {{ublist|[[Mathematics]]|[[Computer science]]}} | ||
| work_institutions = [[ | | work_institutions = [[California Institute of Technology]], [[Stanford University]] | ||
| education = {{ublist|[[Case Western Reserve University]] ([[Bachelor of Science|BS]], [[Master of Science|MS]])|[[California Institute of Technology]] ([[Doctor of Philosophy|PhD]])}} | | education = {{ublist|[[Case Western Reserve University]] ([[Bachelor of Science|BS]], [[Master of Science|MS]])|[[California Institute of Technology]] ([[Doctor of Philosophy|PhD]])}} | ||
| doctoral_advisor = [[Marshall Hall (mathematician)|Marshall Hall, Jr.]]<ref name=mathgene>{{MathGenealogy|id=10416}}</ref> | | doctoral_advisor = [[Marshall Hall (mathematician)|Marshall Hall, Jr.]]<ref name=mathgene>{{MathGenealogy|id=10416}}</ref> | ||
| Line 42: | Line 43: | ||
| website = {{URL|https://cs.stanford.edu/~knuth}} | | website = {{URL|https://cs.stanford.edu/~knuth}} | ||
}} | }} | ||
'''Donald Ervin Knuth''' ({{IPAc-en|k|ə|ˈ|n|uː|θ}} | {{For|other persons named Knuth|Knuth}} | ||
'''Donald Ervin Knuth''' ({{IPAc-en|k|ə|ˈ|n|uː|θ}} {{respell|kə|NOOTH|'}};<ref name="faq"/> born January 10, 1938) is an American computer scientist and mathematician. He is a [[professor emeritus]] at [[Stanford University]]. He is the 1974 recipient of the [[Acm Turing award|ACM Turing Award]], informally considered the [[Nobel Prize]] of computer science.<ref name = "Turing Award"/> Knuth has been called the "father of the [[analysis of algorithms]]".<ref>{{cite journal |last=Karp |first=Richard M. |author-link=Richard M. Karp |date=February 1986 |doi=10.1145/5657.5658 |issue=2 |journal=Communications of the ACM |pages=98–109 |title=Combinatorics, Complexity, and Randomness |volume=29|doi-access=free }}</ref> | |||
Knuth is the author of the multi-volume work ''[[The Art of Computer Programming]]''. He contributed to the development of the rigorous analysis of the [[computational complexity]] of algorithms and systematized formal mathematical techniques for it. In the process, he also popularized the [[Big O notation|asymptotic notation]]. In addition to fundamental contributions in several branches of [[theoretical computer science]], Knuth is the creator of the [[TeX]] computer typesetting system, the related [[METAFONT]] font definition language and rendering system, and the [[Computer Modern]] family of typefaces. | Knuth is the author of the multi-volume work ''[[The Art of Computer Programming]]''. He contributed to the development of the rigorous analysis of the [[computational complexity]] of algorithms and systematized formal mathematical techniques for it. In the process, he also popularized the [[Big O notation|asymptotic notation]]. In addition to fundamental contributions in several branches of [[theoretical computer science]], Knuth is the creator of the [[TeX]] computer typesetting system, the related [[METAFONT]] font definition language and rendering system, and the [[Computer Modern]] family of typefaces. | ||
| Line 50: | Line 52: | ||
==Biography== | ==Biography== | ||
===Early life=== | ===Early life=== | ||
Donald Knuth was born in [[Milwaukee]], [[Wisconsin]], to Ervin Henry Knuth and Louise Marie Bohning.<ref name="MacTutor">{{MacTutor |id=Knuth |date=October 2015 |access-date=2021-07-02}}</ref> He describes his heritage as "Midwestern Lutheran German".{{r|Feigenbaum 2007|p=66}} His father owned a small printing business and taught bookkeeping.<ref name="Raskin2013">{{cite book |author=Molly Knight Raskin |title=No Better Time: The Brief, Remarkable Life of Danny Lewin--the Genius who Transformed the Internet |url=https://books.google.com/books?id=Pi79AgAAQBAJ&pg=PA61 |year=2013 |publisher=Da Capo Press, Incorporated |isbn=978-0-306-82166-0 |pages=61–62}}</ref> While a student at [[Milwaukee Lutheran High School]], Knuth thought of ingenious ways to solve problems. For example, in eighth grade, he entered a contest to find the number of words that the letters in "Ziegler Giant Bar"<ref>[https://www.newspapers.com/article/the-minneapolis-star/176453787/ Advertisement], ''[[Minneapolis Star]]'', February 13, 1952, page 59.</ref> could be rearranged to create; the judges had identified 2,500 such words. With time gained away from school due to a fake stomachache, Knuth used an unabridged dictionary and determined whether each dictionary entry could be formed using the letters in the phrase. He identified over 4,500 words, winning the contest.<ref name="Feigenbaum 2007">{{cite web |last1=Feigenbaum |first1=Edward|author-link1=Edward Feigenbaum |title=Oral History of Donald Knuth |url=https://archive.computerhistory.org/resources/text/Oral_History/Knuth_Don_1/Knuth_Don.oral_history.2007.102658053_all.pdf |archive-url=https://web.archive.org/web/20081209120854/http://archive.computerhistory.org/resources/text/Oral_History/Knuth_Don_1/Knuth_Don.oral_history.2007.102658053_all.pdf |archive-date=2008-12-09 |url-status=live |website=Computer History Museum |access-date=17 September 2020 |date=2007}}</ref>{{rp|3}} As prizes, the school received a new television and enough candy bars for all of his schoolmates to eat.<ref>{{Cite book |year=1998 |title=Out of their minds: the lives and discoveries of 15 great computer scientists |first1=Dennis Elliott |last1=Shasha |first2=Cathy A |last2=Lazere |publisher=Springer |isbn=978-0-387-98269-4 |page=90 |url=https://books.google.com/books?id=-0tDZX3z-8UC&pg=PA90}}</ref><ref>{{cite book | year=2011 | title=Selected Papers on Fun and Games | first1=Donald | last1=Knuth | publisher=Center for the Study of Language and Information—CSLI Lecture Notes, no. 192 | page=400 | isbn=978-1-57586-584-3}}</ref> | Donald Knuth was born in [[Milwaukee]], [[Wisconsin]], to Ervin Henry Knuth and Louise Marie Bohning.<ref name="MacTutor">{{MacTutor |id=Knuth |date=October 2015 |access-date=2021-07-02}}</ref> He describes his heritage as "Midwestern Lutheran German".{{r|Feigenbaum 2007|p=66}} His father owned a small printing business and taught bookkeeping.<ref name="Raskin2013">{{cite book |author=Molly Knight Raskin |title=No Better Time: The Brief, Remarkable Life of Danny Lewin--the Genius who Transformed the Internet |url=https://books.google.com/books?id=Pi79AgAAQBAJ&pg=PA61 |year=2013 |publisher=Da Capo Press, Incorporated |isbn=978-0-306-82166-0 |pages=61–62}}</ref> While a student at [[Milwaukee Lutheran High School]], Knuth thought of ingenious ways to solve problems. For example, in eighth grade, he entered a contest to find the number of words that the letters in "Ziegler's Giant Bar"<ref>[https://www.newspapers.com/article/the-minneapolis-star/176453787/ Advertisement], ''[[Minneapolis Star]]'', February 13, 1952, page 59.</ref> could be rearranged to create; the judges had identified 2,500 such words. With time gained away from school due to a fake stomachache, Knuth used an unabridged dictionary and determined whether each dictionary entry could be formed using the letters in the phrase. He identified over 4,500 words, winning the contest.<ref name="Feigenbaum 2007">{{cite web |last1=Feigenbaum |first1=Edward|author-link1=Edward Feigenbaum |title=Oral History of Donald Knuth |url=https://archive.computerhistory.org/resources/text/Oral_History/Knuth_Don_1/Knuth_Don.oral_history.2007.102658053_all.pdf |archive-url=https://web.archive.org/web/20081209120854/http://archive.computerhistory.org/resources/text/Oral_History/Knuth_Don_1/Knuth_Don.oral_history.2007.102658053_all.pdf |archive-date=2008-12-09 |url-status=live |website=Computer History Museum |access-date=17 September 2020 |date=2007}}</ref>{{rp|3}} As prizes, the school received a new television and enough candy bars for all of his schoolmates to eat.<ref>{{Cite book |year=1998 |title=Out of their minds: the lives and discoveries of 15 great computer scientists |first1=Dennis Elliott |last1=Shasha |first2=Cathy A |last2=Lazere |publisher=Springer |isbn=978-0-387-98269-4 |page=90 |url=https://books.google.com/books?id=-0tDZX3z-8UC&pg=PA90}}</ref><ref>{{cite book | year=2011 | title=Selected Papers on Fun and Games | first1=Donald | last1=Knuth | publisher=Center for the Study of Language and Information—CSLI Lecture Notes, no. 192 | page=400 | isbn=978-1-57586-584-3}}</ref> | ||
===Education=== | ===Education=== | ||
| Line 59: | Line 61: | ||
Knuth was one of the founding editors of the Case Institute's ''Engineering and Science Review'', which won a national award as best technical magazine in 1959.<ref name="BetaNu-Case-edu">{{Cite web |archive-url=https://web.archive.org/web/20160904030655/http://greeklife.case.edu/org/thetachi/Our_History |url=http://greeklife.case.edu/org/thetachi/Our_History |title=Beta Nu of Theta Chi, History of Beta Nu Chapter |publisher=[[CWRU]] |archive-date=September 4, 2016 |access-date=April 15, 2019 |url-status=dead}}</ref><ref name="BetaNu-ThetaChi-org">{{Cite web |archive-url=https://web.archive.org/web/20191221062600/https://www.thetachi.org/beta-nu |url=https://www.thetachi.org/beta-nu |title=Beta Nu, Theta Chi |publisher=[[Theta Chi]] |archive-date=December 21, 2019 |access-date=December 21, 2019 |url-status=dead }}</ref> He then switched from physics to mathematics, and received two degrees from Case in 1960:<ref name="ency2020" /> his Bachelor of Science, and simultaneously a master of science by a special award of the faculty, who considered his work exceptionally outstanding.<ref name = "Turing Award">{{cite web |last=Walden |first=David |url=https://amturing.acm.org/award_winners/knuth_1013846.cfm |title=Donald E. Knuth - A.M. Turing Award Laureate |access-date=December 14, 2022 |archive-url=https://web.archive.org/web/20191017231352/http://amturing.acm.org/award_winners/knuth_1013846.cfm |archive-date=October 17, 2019 |url-status=live}}</ref><ref name = "Koshy2004" /> | Knuth was one of the founding editors of the Case Institute's ''Engineering and Science Review'', which won a national award as best technical magazine in 1959.<ref name="BetaNu-Case-edu">{{Cite web |archive-url=https://web.archive.org/web/20160904030655/http://greeklife.case.edu/org/thetachi/Our_History |url=http://greeklife.case.edu/org/thetachi/Our_History |title=Beta Nu of Theta Chi, History of Beta Nu Chapter |publisher=[[CWRU]] |archive-date=September 4, 2016 |access-date=April 15, 2019 |url-status=dead}}</ref><ref name="BetaNu-ThetaChi-org">{{Cite web |archive-url=https://web.archive.org/web/20191221062600/https://www.thetachi.org/beta-nu |url=https://www.thetachi.org/beta-nu |title=Beta Nu, Theta Chi |publisher=[[Theta Chi]] |archive-date=December 21, 2019 |access-date=December 21, 2019 |url-status=dead }}</ref> He then switched from physics to mathematics, and received two degrees from Case in 1960:<ref name="ency2020" /> his Bachelor of Science, and simultaneously a master of science by a special award of the faculty, who considered his work exceptionally outstanding.<ref name = "Turing Award">{{cite web |last=Walden |first=David |url=https://amturing.acm.org/award_winners/knuth_1013846.cfm |title=Donald E. Knuth - A.M. Turing Award Laureate |access-date=December 14, 2022 |archive-url=https://web.archive.org/web/20191017231352/http://amturing.acm.org/award_winners/knuth_1013846.cfm |archive-date=October 17, 2019 |url-status=live}}</ref><ref name = "Koshy2004" /> | ||
At the end of his senior year at Case in 1960, Knuth proposed to [[Burroughs Corporation]] to write an [[ALGOL]] compiler for the B205 for $5,500. The proposal was accepted and he worked on the ALGOL compiler between graduating from Case and going to [[California Institute of Technology|Caltech]]. {{r|Feigenbaum 2007|p=66}}<ref name="Waychoff 1979">{{cite web |last1=Waychoff |first1=Richard |title=Stories About the B5000 and People Who Were There |url= https://archive.computerhistory.org/resources/access/text/2016/06/102724640-05-01-acc.pdf |website=Computer History Museum}}</ref>{{rp|7}} | At the end of his senior year at Case in 1960, Knuth proposed to [[Burroughs Corporation]] to write an [[ALGOL]] compiler for the B205 for $5,500. The proposal was accepted and he worked on the ALGOL compiler between graduating from Case and going to [[California Institute of Technology|Caltech]].{{r|Feigenbaum 2007|p=66}}<ref name="Waychoff 1979">{{cite web |last1=Waychoff |first1=Richard |title=Stories About the B5000 and People Who Were There |url= https://archive.computerhistory.org/resources/access/text/2016/06/102724640-05-01-acc.pdf |website=Computer History Museum}}</ref>{{rp|7}} | ||
In 1963, with mathematician [[Marshall Hall (mathematician)|Marshall Hall]] as his adviser,<ref name=mathgene/> he earned a PhD in mathematics from the [[California Institute of Technology]], with a thesis titled ''Finite Semifields and Projective Planes''.<ref>{{Cite thesis |publisher=[[California Institute of Technology]] |date=1963 |url=https://thesis.library.caltech.edu/2441/1/Knuth_de_1963.pdf |title=Finite Semifields and Projective Planes |first=Donald Ervin |last=Knuth |type=PhD}}</ref> | In 1963, with mathematician [[Marshall Hall (mathematician)|Marshall Hall]] as his adviser,<ref name=mathgene/> he earned a PhD in mathematics from the [[California Institute of Technology]], with a thesis titled ''Finite Semifields and Projective Planes''.<ref>{{Cite thesis |publisher=[[California Institute of Technology]] |date=1963 |url=https://thesis.library.caltech.edu/2441/1/Knuth_de_1963.pdf |title=Finite Semifields and Projective Planes |first=Donald Ervin |last=Knuth |type=PhD}}</ref> | ||
| Line 66: | Line 68: | ||
In 1963, after receiving his PhD, Knuth joined Caltech's faculty as an assistant professor.<ref name=vitae/> | In 1963, after receiving his PhD, Knuth joined Caltech's faculty as an assistant professor.<ref name=vitae/> | ||
While at Caltech and after the success of the Burroughs B205 ALGOL compiler, he became consultant to Burroughs Corporation, joining the Product Planning Department. At Caltech he was operating as a mathematician but at Burroughs as a programmer working with the people he considered to have written the best software at the time | While at Caltech and after the success of the Burroughs B205 ALGOL compiler, he became consultant to Burroughs Corporation, joining the Product Planning Department. At Caltech he was operating as a mathematician, but at Burroughs as a programmer, working with the people he considered to have written the best software at the time: the ALGOL compiler for the B220 computer (successor to the B205).{{r|Feigenbaum 2007|p=9}} | ||
Knuth | Knuth turned down a $100,000 contract to write compilers at Green Tree Corporation, deciding instead to optimize income and continue at Caltech and Burroughs. He received a National Science Foundation Fellowship and Woodrow Wilson Foundation Fellowship, but they had the condition that the recipient could not do anything else but study as a graduate student, so he would not be able to continue as a consultant to Burroughs. He chose to turn down the fellowships and continued with Burroughs.{{r|Feigenbaum 2007|p=12}} In summer 1962, he wrote a FORTRAN compiler for Univac, but considered that "I sold my soul to the devil" to write a FORTRAN compiler.{{r|Feigenbaum 2007|p=15}} | ||
He received a National Science Foundation Fellowship and Woodrow Wilson Foundation Fellowship but they had the condition that | |||
In summer 1962, he wrote a FORTRAN compiler for Univac, but considered that | |||
After graduating, Knuth returned to Burroughs in June 1961 but did not tell them he had graduated with a master's degree, rather than the expected bachelor's degree. Impressed by the ALGOL syntax chart, symbol table, recursive-descent approach and the separation of the scanning, parsing and emitting functions of the compiler Knuth suggested an extension to the symbol table that one symbol could stand for a string of symbols. This became the basis of the DEFINE in Burroughs ALGOL, which has since been adopted by other languages. However, some really disliked the idea and wanted DEFINE removed. The last person to think it was a terrible idea was [[Edsger W. Dijkstra|Edsger Dijkstra]] on a visit to Burroughs.{{r|Waychoff 1979|p=17}} | After graduating, Knuth returned to Burroughs in June 1961, but did not tell them he had graduated with a master's degree, rather than the expected bachelor's degree. Impressed by the ALGOL syntax chart, symbol table, recursive-descent approach, and the separation of the scanning, parsing, and emitting functions of the compiler, Knuth suggested an extension to the symbol table: that one symbol could stand for a string of symbols. This became the basis of the DEFINE in Burroughs ALGOL, which has since been adopted by other languages. However, some really disliked the idea and wanted DEFINE removed. The last person to think it was a terrible idea was [[Edsger W. Dijkstra|Edsger Dijkstra]] on a visit to Burroughs.{{r|Waychoff 1979|p=17}} | ||
Knuth worked on simulation languages at Burroughs producing SOL | Knuth worked on simulation languages at Burroughs, producing SOL 'Simulation Oriented Language', an improvement on the state-of-the-art, co-designed with J. McNeeley. He attended a conference in Norway in May, 1967 organized by the people who invented the Simula language. Knuth influenced Burroughs to use Simula.<ref name="Dahl 2001">{{cite web |last1=Dahl |first1=Ole-Johan |title=The Birth of Object Orientation: the Simula Languages |url= https://www.mn.uio.no/ifi/english/about/ole-johan-dahl/bibliography/the-birth-of-object-orientation-the-simula-languages.pdf}}</ref><ref name="Biography">{{cite web |title=Biography |url= https://www.informs.org/Explore/History-of-O.R.-Excellence/Biographical-Profiles/Knuth-Donald/}}</ref> Knuth had a long association with Burroughs as a consultant from 1960 to 1968 until his move into more academic work at Stanford in 1969.<ref name="Nance">{{cite web |title=Interview with Richard Nance 2013 |url= https://d.lib.ncsu.edu/computer-simulation/videos/donald-e-knuth-interviewed-by-richard-e-nance-knuth/}}</ref><ref name="Knuth CV">{{cite web |last1=Dahl |first1=Ole-Johan |title=The Birth of Object Orientation: the Simula Languages |url= https://cs.stanford.edu/~knuth/vita.html}}</ref> | ||
Knuth had a long association with Burroughs as a consultant from 1960 to 1968 until his move into more academic work at Stanford in 1969.<ref name="Nance">{{cite web |title=Interview with Richard Nance 2013 |url= https://d.lib.ncsu.edu/computer-simulation/videos/donald-e-knuth-interviewed-by-richard-e-nance-knuth/}}</ref><ref name="Knuth CV">{{cite web |last1=Dahl |first1=Ole-Johan |title=The Birth of Object Orientation: the Simula Languages |url= https://cs.stanford.edu/~knuth/vita.html}}</ref> | |||
In 1962, Knuth accepted a commission from [[Addison-Wesley]] to write a book on computer [[programming language]] [[compiler]]s. While working on this project, he decided that he could not adequately treat the topic without first developing a fundamental theory of computer programming, which became ''[[The Art of Computer Programming]]''. He originally planned to publish this as a single book, but as he developed his outline for the book, he concluded that he required six volumes, and then seven, to thoroughly cover the subject. He published the first volume in 1968.<ref name=TAOCP>{{Cite web |last=Knuth |first=Donald Ervin |title=The Art of Computer Programming (TAOCP) |url=https://cs.stanford.edu/~knuth/taocp.html |archive-url=https://web.archive.org/web/20190803223145/https://www.cs.stanford.edu/~knuth/taocp.html |archive-date=2019-08-03 |date=2019-08-03 |access-date=2018-02-06 }}</ref> | In 1962, Knuth accepted a commission from [[Addison-Wesley]] to write a book on computer [[programming language]] [[compiler]]s. While working on this project, he decided that he could not adequately treat the topic without first developing a fundamental theory of computer programming, which became ''[[The Art of Computer Programming]]''. He originally planned to publish this as a single book, but as he developed his outline for the book, he concluded that he required six volumes, and then seven, to thoroughly cover the subject. He published the first volume in 1968.<ref name=TAOCP>{{Cite web |last=Knuth |first=Donald Ervin |title=The Art of Computer Programming (TAOCP) |url=https://cs.stanford.edu/~knuth/taocp.html |archive-url=https://web.archive.org/web/20190803223145/https://www.cs.stanford.edu/~knuth/taocp.html |archive-date=2019-08-03 |date=2019-08-03 |access-date=2018-02-06 }}</ref> | ||
| Line 81: | Line 80: | ||
Just before publishing the first volume of ''The Art of Computer Programming'', Knuth left Caltech to accept employment with the [[Institute for Defense Analyses#Center for Communications and Computing|Institute for Defense Analyses' Communications Research Division]],<ref name="Institute for Defense Analyses">{{cite web | title=Institute for Defense Analyses | website=INFORMS | date=2021-08-27 | url=https://www.informs.org/Explore/History-of-O.R.-Excellence/Non-Academic-Institutions/Institute-for-Defense-Analyses | access-date=2024-01-08}}</ref> then situated on the [[Princeton University|Princeton]] campus, which was performing mathematical research in [[cryptography]] to support the [[National Security Agency]]. | Just before publishing the first volume of ''The Art of Computer Programming'', Knuth left Caltech to accept employment with the [[Institute for Defense Analyses#Center for Communications and Computing|Institute for Defense Analyses' Communications Research Division]],<ref name="Institute for Defense Analyses">{{cite web | title=Institute for Defense Analyses | website=INFORMS | date=2021-08-27 | url=https://www.informs.org/Explore/History-of-O.R.-Excellence/Non-Academic-Institutions/Institute-for-Defense-Analyses | access-date=2024-01-08}}</ref> then situated on the [[Princeton University|Princeton]] campus, which was performing mathematical research in [[cryptography]] to support the [[National Security Agency]]. | ||
In 1967, Knuth attended a [[Society for Industrial and Applied Mathematics]] conference and someone asked what he did. At the time, computer science was partitioned into [[numerical analysis]], [[artificial intelligence]], and [[programming language theory|programming languages]]. Based on his study and ''The Art of Computer Programming'' book, Knuth decided the next time someone asked he would say, "Analysis of algorithms".<ref name="quanta_magazine">{{cite web |title=The Computer Scientist Who Can't Stop Telling Stories |url=https://www.quantamagazine.org/computer-scientist-donald-knuth-cant-stop-telling-stories-20200416 |first=Susan |last=D'Agostino |work=[[Quanta Magazine]] |date=2020-04-16 |access-date=2020-04-19 }}</ref> | In 1967, Knuth attended a [[Society for Industrial and Applied Mathematics]] conference and someone asked what he did. At the time, computer science was partitioned into [[numerical analysis]], [[artificial intelligence]], and [[programming language theory|programming languages]]. Based on his study and ''The Art of Computer Programming'' book, Knuth decided the next time someone asked he would say, "Analysis of algorithms".<ref name="quanta_magazine">{{cite web |title=The Computer Scientist Who Can't Stop Telling Stories |url=https://www.quantamagazine.org/computer-scientist-donald-knuth-cant-stop-telling-stories-20200416 |first=Susan |last=D'Agostino|author-link=Susan D'Agostino |work=[[Quanta Magazine]] |date=2020-04-16 |access-date=2020-04-19 }}</ref> | ||
In 1969, Knuth left his position at Princeton to join the [[Stanford University]] faculty,<ref name="Computer Science department timeline">{{cite web | title=Timeline | website=Computer Science @ Stanford - Spotlight at Stanford | date=2019-06-21 | url=https://exhibits.stanford.edu/cs/about/timeline | access-date=2024-01-08}}</ref> where he became [[Fletcher R. Jones|Fletcher Jones]] Professor of Computer Science in 1977. He became Professor of The Art of Computer Programming in 1990, and has been emeritus since 1993.<ref name="homepage">{{Cite web |url=https://cs.stanford.edu/~knuth/ |title=Home page |last=Knuth |first=Donald Ervin |publisher=[[Stanford University]] |access-date=2005-03-16 |archive-url=https://web.archive.org/web/20191127223728/https://cs.stanford.edu/~knuth/ |archive-date=2019-11-27 |url-status=live }}</ref><ref>{{cite web |title=Donald Knuth |url=https://profiles.stanford.edu/donald-knuth |work=Profiles |publisher=Stanford University |archive-url=https://web.archive.org/web/20160612181314/https://profiles.stanford.edu/donald-knuth |archive-date=2016-06-12 |url-status=dead |access-date=2020-08-24 }}</ref> | In 1969, Knuth left his position at Princeton to join the [[Stanford University]] faculty,<ref name="Computer Science department timeline">{{cite web | title=Timeline | website=Computer Science @ Stanford - Spotlight at Stanford | date=2019-06-21 | url=https://exhibits.stanford.edu/cs/about/timeline | access-date=2024-01-08}}</ref> where he became [[Fletcher R. Jones|Fletcher Jones]] Professor of Computer Science in 1977. He became Professor of The Art of Computer Programming in 1990, and has been emeritus since 1993.<ref name="homepage">{{Cite web |url=https://cs.stanford.edu/~knuth/ |title=Home page |last=Knuth |first=Donald Ervin |publisher=[[Stanford University]] |access-date=2005-03-16 |archive-url=https://web.archive.org/web/20191127223728/https://cs.stanford.edu/~knuth/ |archive-date=2019-11-27 |url-status=live }}</ref><ref>{{cite web |title=Donald Knuth |url=https://profiles.stanford.edu/donald-knuth |work=Profiles |publisher=Stanford University |archive-url=https://web.archive.org/web/20160612181314/https://profiles.stanford.edu/donald-knuth |archive-date=2016-06-12 |url-status=dead |access-date=2020-08-24 }}</ref> | ||
| Line 89: | Line 88: | ||
=== ''The Art of Computer Programming'' (''TAOCP'') === | === ''The Art of Computer Programming'' (''TAOCP'') === | ||
{{main |The Art of Computer Programming}} | {{main |The Art of Computer Programming{{!}}''The Art of Computer Programming''}} | ||
{{Blockquote | {{Blockquote | ||
|text="The best way to communicate from one human being to another is through story." | |text="The best way to communicate from one human being to another is through story." | ||
| Line 110: | Line 109: | ||
Knuth has delved into [[recreational mathematics]]. He contributed articles to the ''[[Journal of Recreational Mathematics]]'' beginning in the 1960s, and was acknowledged as a major contributor in [[Joseph Madachy]]'s ''Mathematics on Vacation''.<ref>Madachy, Joseph S.,''Mathematics on Vacation'', Thomas Nelson & Sons Ltd. 1966</ref> | Knuth has delved into [[recreational mathematics]]. He contributed articles to the ''[[Journal of Recreational Mathematics]]'' beginning in the 1960s, and was acknowledged as a major contributor in [[Joseph Madachy]]'s ''Mathematics on Vacation''.<ref>Madachy, Joseph S.,''Mathematics on Vacation'', Thomas Nelson & Sons Ltd. 1966</ref> | ||
Knuth also appears in a number of [[Numberphile]]<ref>{{cite web |title=Videos about Numbers and Stuff |url=https://www.numberphile.com/team/index.html |archive-url=https://web.archive.org/web/20181104201526/http://www.numberphile.com/team/index.html |archive-date=November 4, 2018 |url-status=dead |work=[[Numberphile]] |access-date=August 16, 2019}}</ref> and Computerphile videos on [[YouTube]], where he discusses topics from writing ''Surreal Numbers''<ref>{{Citation|last=Numberphile|title=Surreal Numbers (writing the first book) - Numberphile|date=2016-06-27|url=https://www.youtube.com/watch?v=mPn2AdMH7UQ| archive-url=https://ghostarchive.org/varchive/youtube/20211211/mPn2AdMH7UQ| archive-date=2021-12-11 | url-status=live|access-date=2019-07-19}}{{cbignore}}</ref> to why he does not use email.<ref>{{Citation|last=Computerphile|title=Why Don Knuth Doesn't Use Email - Computerphile|date=2015-08-21|url=https://www.youtube.com/watch?v=QS8qwMna8_o|access-date=2019-07-19|archive-url=https://web.archive.org/web/20180711015226/https://www.youtube.com/watch?v=QS8qwMna8_o|archive-date=July 11, 2018|url-status=live}}</ref> | Knuth also appears in a number of ''[[Numberphile]]''<ref>{{cite web |title=Videos about Numbers and Stuff |url=https://www.numberphile.com/team/index.html |archive-url=https://web.archive.org/web/20181104201526/http://www.numberphile.com/team/index.html |archive-date=November 4, 2018 |url-status=dead |work=[[Numberphile]] |access-date=August 16, 2019}}</ref> and ''Computerphile'' videos on [[YouTube]], where he discusses topics from writing ''Surreal Numbers''<ref>{{Citation|last=Numberphile|title=Surreal Numbers (writing the first book) - Numberphile|date=2016-06-27|url=https://www.youtube.com/watch?v=mPn2AdMH7UQ| archive-url=https://ghostarchive.org/varchive/youtube/20211211/mPn2AdMH7UQ| archive-date=2021-12-11 | url-status=live|access-date=2019-07-19}}{{cbignore}}</ref> to why he does not use email.<ref>{{Citation|last=Computerphile|title=Why Don Knuth Doesn't Use Email - Computerphile|date=2015-08-21|url=https://www.youtube.com/watch?v=QS8qwMna8_o|access-date=2019-07-19|archive-url=https://web.archive.org/web/20180711015226/https://www.youtube.com/watch?v=QS8qwMna8_o|archive-date=July 11, 2018|url-status=live}}</ref> | ||
Knuth had proposed the name "[[algorithmics]]" as a better name for the discipline of computer science.<ref>{{cite book |last1=Burkholder |first1=Leslie |title=Philosophy and the Computer |date=1992 |publisher=Taylor & Francis |isbn=9780429301629 |pages=}}</ref> | Knuth had proposed the name "[[algorithmics]]" as a better name for the discipline of computer science.<ref>{{cite book |last1=Burkholder |first1=Leslie |title=Philosophy and the Computer |date=1992 |publisher=Taylor & Francis |isbn=9780429301629 |pages=}}</ref> | ||
Knuth has made a substantial contribution to the study of the [[Stable matching problem]].<ref name="knuth">{{citation |last=Knuth|first=Donald E.|title=Mariages stables et leurs relations avec d'autres problèmes combinatoires|year=1976|url=https://www-cs-faculty.stanford.edu/~knuth/mariages-stables.pdf|location=Montréal, Quebec|publisher=Les Presses de l'Université de Montréal|language=French|isbn=0-8405-0342-3|mr=0488980|authorlink=Donald Knuth}}. See in particular Problem 6, pp. 87–94.</ref> | |||
===Works about his religious beliefs=== | ===Works about his religious beliefs=== | ||
In addition to his writings on computer science, Knuth, a [[Lutheranism|Lutheran]],{{Sfn | Platoni | 2006}} is also the author of ''3:16 Bible Texts Illuminated'',<ref>{{Cite book |last=Knuth |first=Donald Ervin |title=3:16 : Bible texts illuminated |year=1991 |place=Madison, [[Wisconsin|WI]] |publisher=A-R Eds |isbn=978-0-89579-252-5}}</ref> in which he examines the Bible by a process of [[systematic sampling]], namely an analysis of chapter 3, verse 16 of each book. | In addition to his writings on computer science, Knuth, a [[Lutheranism|Lutheran]],{{Sfn | Platoni | 2006}} is also the author of ''3:16 Bible Texts Illuminated'',<ref>{{Cite book |last=Knuth |first=Donald Ervin |title=3:16 : Bible texts illuminated |year=1991 |place=Madison, [[Wisconsin|WI]] |publisher=A-R Eds |isbn=978-0-89579-252-5}}</ref> in which he examines the Bible by a process of [[systematic sampling]], namely an analysis of chapter 3, verse 16 of each book. Each verse is accompanied by a rendering in calligraphic art, contributed by a group of calligraphers led by [[Hermann Zapf]]. Knuth was invited to give a set of lectures at MIT on the views on religion and computer science behind his 3:16 project, resulting in another book, ''[[Things a Computer Scientist Rarely Talks About]]'', where he published the lectures ''God and Computer Science''.<ref name="Knuth 2001 Rarely Talks">{{cite book | last=Knuth | first=Donald Ervin | title=Things a Computer Scientist Rarely Talks About | publisher=Center for the Study of Language and Information Publications | publication-place=Stanford, California | date=2001 | isbn=978-1-57586-326-9 }}</ref> | ||
===Opinion on software patents=== | ===Opinion on software patents=== | ||
Knuth strongly opposes granting [[software patent]]s to trivial solutions that should be obvious, but has expressed more nuanced views for nontrivial solutions such as the [[interior-point method]] of [[linear programming]].<ref>{{Cite journal |url=https://www.ams.org/notices/200203/fea-knuth.pdf |title=All Questions Answered |date=March 2002 |type=article |journal=Notices |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190430030346/http://www.ams.org/notices/200203/fea-knuth.pdf |archive-date=April 30, 2019 |url-status=live }}</ref> He has expressed his disagreement directly to both the [[United States Patent and Trademark Office]] and [[European Patent Organisation]].<ref>{{Cite web |url=http://www.groklaw.net/images/G308Knuth.pdf |last=Knuth |first=Donald Ervin | Knuth strongly opposes granting [[software patent]]s to trivial solutions that should be obvious, but has expressed more nuanced views for nontrivial solutions such as the [[interior-point method]] of [[linear programming]].<ref>{{Cite journal |url=https://www.ams.org/notices/200203/fea-knuth.pdf |title=All Questions Answered |date=March 2002 |type=article |journal=Notices of the AMS |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190430030346/http://www.ams.org/notices/200203/fea-knuth.pdf |archive-date=April 30, 2019 |url-status=live }}</ref> He has expressed his disagreement directly to both the [[United States Patent and Trademark Office]] and [[European Patent Organisation]].<ref>{{Cite web |url=http://www.groklaw.net/images/G308Knuth.pdf |last=Knuth |first=Donald Ervin |title=Against software patents |access-date=February 1, 2020 |archive-url=https://web.archive.org/web/20150924040943/http://www.groklaw.net/images/G308Knuth.pdf |archive-date=September 24, 2015 |url-status=usurped }} Letter to the patent offices in the USA and Europe.</ref><ref name="AlgorithmPatents">{{cite web | title=February 1994 letter to the Commissioner of Patents and Trademarks, Washington, DC | website=MIT CSAIL | url=https://groups.csail.mit.edu/mac/projects/lpf/Patents/knuth-to-pto.txt | access-date=2025-09-09}}</ref> | ||
==Programming== | ==Programming== | ||
===Digital typesetting=== | ===Digital typesetting=== | ||
In the 1970s, the publishers of [[TAOCP]] abandoned [[Monotype | In the 1970s, the publishers of [[TAOCP]] abandoned [[Monotype system|Monotype]] in favor of [[phototypesetting]]. Knuth became so frustrated with the inability of the latter system to approach the quality of the previous volumes, which were typeset using the older system, that he took time out to work on digital typesetting and created [[TeX]] and [[Metafont]].<ref>{{cite web |url=https://www.kyotoprize.org/wp/wp-content/uploads/2016/02/12kA_lct_EN.pdf |archive-url=https://web.archive.org/web/20180127194502/http://www.kyotoprize.org/wp/wp-content/uploads/2016/02/12kA_lct_EN.pdf |url-status=dead |archive-date=2018-01-27 |title=Digital Typography (Kyoto Prize Lecture, 1996) |last=Knuth |first=Donald Erwin |year=1997 }}</ref> | ||
===Literate programming=== | ===Literate programming=== | ||
| Line 135: | Line 136: | ||
==Personal life== | ==Personal life== | ||
Donald Knuth married Nancy Jill Carter on | Donald Knuth married Nancy Jill Carter on 24 June 1961, while he was a graduate student at the California Institute of Technology. They have two children: John Martin Knuth and Jennifer Sierra Knuth.<ref name="OConnerEtRobertson">{{cite web |url=http://www-history.mcs.st-andrews.ac.uk/Biographies/Knuth.html |title=Donald Ervin Knuth |publisher=[[University of St Andrews]] |first1=J. J. |last1=O'Connor |first2=E. F. |last2=Robertson |date=2015 |access-date=October 20, 2017 |archive-url=https://web.archive.org/web/20171005220701/http://www-history.mcs.st-andrews.ac.uk/Biographies/Knuth.html |archive-date=October 5, 2017 |url-status=live }}</ref> | ||
Knuth gives informal lectures a few times a year at [[Stanford University]], which he calls "Computer Musings". He was a visiting professor at the [[Oxford University Department of Computer Science]] in the United Kingdom until 2017 and an Honorary Fellow of [[Magdalen College, Oxford|Magdalen College]].<ref>{{Cite web |title=Professor Donald Knuth |url=http://www.magd.ox.ac.uk/whos-here/fellows-and-lecturers/fellows/knuthd |url-status=dead |archive-url=https://web.archive.org/web/20110104142353/http://www.magd.ox.ac.uk/whos-here/fellows-and-lecturers/fellows/knuthd |archive-date=January 4, 2011 |access-date=December 6, 2010 |publisher=Magdalen College |df=mdy-all}}</ref><ref>{{cite web |date=October 30, 2014 |title=Notices |url=https://www.ox.ac.uk/gazette/2014-2015/30october2014-no5075/notices/ |url-status=dead |archive-url=https://web.archive.org/web/20150515081159/http://www.ox.ac.uk/gazette/2014-2015/30october2014-no5075/notices/ |archive-date=May 15, 2015 |access-date=May 21, 2015 |work=[[Oxford University Gazette]]}}</ref> | Knuth gives informal lectures a few times a year at [[Stanford University]], which he calls "Computer Musings". He was a visiting professor at the [[Oxford University Department of Computer Science]] in the United Kingdom until 2017 and an Honorary Fellow of [[Magdalen College, Oxford|Magdalen College]].<ref>{{Cite web |title=Professor Donald Knuth |url=http://www.magd.ox.ac.uk/whos-here/fellows-and-lecturers/fellows/knuthd |url-status=dead |archive-url=https://web.archive.org/web/20110104142353/http://www.magd.ox.ac.uk/whos-here/fellows-and-lecturers/fellows/knuthd |archive-date=January 4, 2011 |access-date=December 6, 2010 |publisher=Magdalen College |df=mdy-all}}</ref><ref>{{cite web |date=October 30, 2014 |title=Notices |url=https://www.ox.ac.uk/gazette/2014-2015/30october2014-no5075/notices/ |url-status=dead |archive-url=https://web.archive.org/web/20150515081159/http://www.ox.ac.uk/gazette/2014-2015/30october2014-no5075/notices/ |archive-date=May 15, 2015 |access-date=May 21, 2015 |work=[[Oxford University Gazette]]}}</ref> | ||
| Line 141: | Line 142: | ||
Knuth is an [[organist]] and a [[composer]]. He and his father served as organists for Lutheran congregations. Knuth and his wife have a 16-rank organ in their home.<ref>{{cite web |title=The Organ of Don and Jill Knuth |url=https://www-cs-faculty.stanford.edu/~knuth/organ.html |access-date=11 January 2023 |via=Stanford.edu}}</ref> In 2016 he completed a piece for organ, ''Fantasia Apocalyptica'', which he calls a "translation of the Greek text of the [[Book of Revelation|Revelation of Saint John the Divine]] into music". It was premièred in [[Sweden]] on January 10, 2018.<ref>{{cite news |last=de Groot |first=Martin |date=November 3, 2018 |title=Arts and Culture: A polymath brings his genius to bear on a multimedia work for pipe organ |work=[[Waterloo Region Record]] |url=https://www.therecord.com/whatson-story/9003680-arts-and-culture-a-polymath-brings-his-genius-to-bear-on-a-multimedia-work-for-pipe-organ/}}</ref> | Knuth is an [[organist]] and a [[composer]]. He and his father served as organists for Lutheran congregations. Knuth and his wife have a 16-rank organ in their home.<ref>{{cite web |title=The Organ of Don and Jill Knuth |url=https://www-cs-faculty.stanford.edu/~knuth/organ.html |access-date=11 January 2023 |via=Stanford.edu}}</ref> In 2016 he completed a piece for organ, ''Fantasia Apocalyptica'', which he calls a "translation of the Greek text of the [[Book of Revelation|Revelation of Saint John the Divine]] into music". It was premièred in [[Sweden]] on January 10, 2018.<ref>{{cite news |last=de Groot |first=Martin |date=November 3, 2018 |title=Arts and Culture: A polymath brings his genius to bear on a multimedia work for pipe organ |work=[[Waterloo Region Record]] |url=https://www.therecord.com/whatson-story/9003680-arts-and-culture-a-polymath-brings-his-genius-to-bear-on-a-multimedia-work-for-pipe-organ/}}</ref> | ||
Knuth's [[Chinese name]] is [[Gao (surname)|Gao]] Dena ({{lang-zh|s=高德纳|t=高德納|p=Gāo Dénà}}).<ref>{{cite journal |issn=0896-3207 |journal=[[TUGboat]] |author-last=Reutenauer |author-first=Arthur |pages=68–72 |title=A brief history of TeX, volume II}}</ref><ref name="faq"/> He was [[Phono-semantic matching|given]] this name in 1977 by [[Frances Yao]] shortly before making a three-week trip to China.<ref name="faq">{{cite web |url=https://cs.stanford.edu/~knuth/faq.html |title=Frequently Asked Questions |last=Knuth |first=Donald Ervin |work=Home page |publisher=[[Stanford University]] |access-date=2010-11-02 |archive-url=https://web.archive.org/web/20190803223521/https://www.cs.stanford.edu/~knuth/faq.html |archive-date=August 3, 2019 |url-status=live }}</ref><ref name="The Art of Computer Programming"/> In the 1980 Chinese translation of Volume 1 of ''The Art of Computer Programming'' ({{lang-zh|s=计算机程序设计艺术|t=計算機程式設計藝術|p=Jìsuànjī chéngxù shèjì yìshù}}), Knuth explains that he embraced his Chinese name because he wanted to be known by the growing numbers of computer programmers in China at the time. In 1989, his Chinese name was placed atop the ''Journal of Computer Science and Technology''{{'s}} header, which Knuth says "makes me feel close to all Chinese people although I cannot speak your language".<ref name="The Art of Computer Programming">{{cite book |author-last=Knuth |author-first=Donald Ervin |trans-title=The Art of Computer Programming |translator1-last=Guan |translator1-first=JiWen |translator2-last=Su |translator2-first=Yunlin |title=计算机程序设计技巧 (Ji suan ji cheng xu she ji ji qiao) |publisher=Defense Industry Publishing Co. |date=1980 |location=Beijing |quote=I fondly hope that many Chinese computer programmers will learn to recognize my Chinese name Gao Dena, which was given to me by Francis Yao just before I visited your country in 1977. I still have very fond memories of that three-week visit, and I have been glad to see Gao Dena on the masthead of the ''Journal of Computer Science and Technology'' since 1989. This name makes me feel close to all Chinese people although I cannot speak your language.}}</ref> | Knuth's [[Chinese name]] is [[Gao (surname)|Gao]] Dena ({{lang-zh|s=高德纳|t=高德納|p=Gāo Dénà}}).<ref>{{cite journal |issn=0896-3207 |journal=[[TUGboat]] |author-last=Reutenauer |author-first=Arthur |pages=68–72 |title=A brief history of TeX, volume II}}</ref><ref name="faq"/> He was [[Phono-semantic matching|given]] this name in 1977 by [[Frances Yao]] shortly before making a three-week trip to China.<ref name="faq">{{cite web |url=https://cs.stanford.edu/~knuth/faq.html |title=Frequently Asked Questions |last=Knuth |first=Donald Ervin |work=Home page |publisher=[[Stanford University]] |access-date=2010-11-02 |archive-url=https://web.archive.org/web/20190803223521/https://www.cs.stanford.edu/~knuth/faq.html |archive-date=August 3, 2019 |url-status=live }}</ref><ref name="The Art of Computer Programming"/> In the 1980 Chinese translation of Volume 1 of ''The Art of Computer Programming'' ({{lang-zh|s=计算机程序设计艺术|t=計算機程式設計藝術|p=Jìsuànjī chéngxù shèjì yìshù}}), Knuth explains that he embraced his Chinese name because he wanted to be known by the growing numbers of computer programmers in China at the time. In 1989, his Chinese name was placed atop the ''Journal of Computer Science and Technology''{{'s}} header, which Knuth says "makes me feel close to all Chinese people although I cannot speak your language".<ref name="The Art of Computer Programming">{{cite book |author-last=Knuth |author-first=Donald Ervin |trans-title=The Art of Computer Programming |translator1-last=Guan |translator1-first=JiWen |translator2-last=Su |translator2-first=Yunlin |title=计算机程序设计技巧 (Ji suan ji cheng xu she ji ji qiao) |publisher=Defense Industry Publishing Co. |date=1980 |location=Beijing |quote=I fondly hope that many Chinese computer programmers will learn to recognize my Chinese name Gao Dena, which was given to me by Francis Yao just before I visited your country in 1977. I still have very fond memories of that three-week visit, and I have been glad to see Gao Dena on the masthead of the ''Journal of Computer Science and Technology'' since 1989. This name makes me feel close to all Chinese people although I cannot speak your language.}}</ref> | ||
| Line 165: | Line 165: | ||
In 1990, he was awarded the one-of-a-kind academic title ''Professor of The Art of Computer Programming''; the title has since been revised to ''Professor [[Emeritus]] of The Art of Computer Programming''. | In 1990, he was awarded the one-of-a-kind academic title ''Professor of The Art of Computer Programming''; the title has since been revised to ''Professor [[Emeritus]] of The Art of Computer Programming''. | ||
Knuth was elected to the [[National Academy of Sciences]] in 1975. He was also elected a member of the [[National Academy of Engineering]] in 1981 for organizing vast subject areas of computer science so that they are accessible to all segments of the computing community. In 1992, he became an associate of the [[French Academy of Sciences]]. Also that year, he retired from regular research and teaching at [[Stanford University]] in order to finish ''[[The Art of Computer Programming]]''. He was elected a [[List of Fellows of the Royal Society elected in 2003|Foreign Member of the Royal Society in 2003]].<ref name=formemrs/> | Knuth was elected to the [[National Academy of Sciences]] in 1975. He was also elected a member of the [[National Academy of Engineering]] in 1981 for organizing vast subject areas of computer science so that they are accessible to all segments of the computing community. In 1992, he became an associate of the [[French Academy of Sciences]]. Also that year, he retired from regular research and teaching at [[Stanford University]] in order to finish ''[[The Art of Computer Programming]]''. In 1996, he was awarded the degree of Doctor Honoris Causa in the field of Mathematical Sciences from the Faculty of Informatics of [[Masaryk University]] in [[Brno]].<ref> {{Cite web |url=https://www.muni.cz/en/about-us/awards/67 |title=Donald E. Knuth Computer scientist, United States of America |access-date=March 5, 2026}} </ref> | ||
He was elected a [[List of Fellows of the Royal Society elected in 2003|Foreign Member of the Royal Society in 2003]].<ref name=formemrs/> | |||
Knuth was elected as a Fellow (first class of Fellows) of the [[Society for Industrial and Applied Mathematics]] in 2009 for his outstanding contributions to mathematics.<ref>{{Cite web |url=https://www.siam.org/Prizes-Recognition/Fellows-Program/All-SIAM-Fellows/Class-of-2009 |title=Fellows |year=2009 |publisher=Siam |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190421024152/https://www.siam.org/Prizes-Recognition/Fellows-Program/All-SIAM-Fellows/Class-of-2009 |archive-date=April 21, 2019 |url-status=live }}</ref> He is a member of the [[Norwegian Academy of Science and Letters]].<ref>{{cite web|url=http://www.dnva.no/c26849/artikkel/vis.html?tid=40116 |title=Gruppe 1: Matematiske fag |publisher=[[Norwegian Academy of Science and Letters]] |language=no |access-date=October 7, 2010 |url-status=dead |archive-url=https://web.archive.org/web/20131110152102/http://www.dnva.no/c26849/artikkel/vis.html?tid=40116 |archive-date=November 10, 2013 |df=mdy }}</ref> In 2012, he became a fellow of the [[American Mathematical Society]]<ref>{{cite web |url=https://www.ams.org/cgi-bin/fellows/fellows.cgi |title=Fellows of the American Mathematical Society |access-date=December 14, 2022}}</ref> and a member of the [[American Philosophical Society]].<ref>{{Cite web|title=APS Member History|url=https://search.amphilsoc.org/memhist/search?creator=Donald+E.+Knuth&title=&subject=&subdiv=&mem=&year=&year-max=&dead=&keyword=&smode=advanced|access-date=2021-03-19|website=search.amphilsoc.org}}</ref> Other awards and honors include: | Knuth was elected as a Fellow (first class of Fellows) of the [[Society for Industrial and Applied Mathematics]] in 2009 for his outstanding contributions to mathematics.<ref>{{Cite web |url=https://www.siam.org/Prizes-Recognition/Fellows-Program/All-SIAM-Fellows/Class-of-2009 |title=Fellows |year=2009 |publisher=Siam |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190421024152/https://www.siam.org/Prizes-Recognition/Fellows-Program/All-SIAM-Fellows/Class-of-2009 |archive-date=April 21, 2019 |url-status=live }}</ref> He is a member of the [[Norwegian Academy of Science and Letters]].<ref>{{cite web|url=http://www.dnva.no/c26849/artikkel/vis.html?tid=40116 |title=Gruppe 1: Matematiske fag |publisher=[[Norwegian Academy of Science and Letters]] |language=no |access-date=October 7, 2010 |url-status=dead |archive-url=https://web.archive.org/web/20131110152102/http://www.dnva.no/c26849/artikkel/vis.html?tid=40116 |archive-date=November 10, 2013 |df=mdy }}</ref> In 2012, he became a fellow of the [[American Mathematical Society]]<ref>{{cite web |url=https://www.ams.org/cgi-bin/fellows/fellows.cgi |title=Fellows of the American Mathematical Society |access-date=December 14, 2022}}</ref> and a member of the [[American Philosophical Society]].<ref>{{Cite web|title=APS Member History|url=https://search.amphilsoc.org/memhist/search?creator=Donald+E.+Knuth&title=&subject=&subdiv=&mem=&year=&year-max=&dead=&keyword=&smode=advanced|access-date=2021-03-19|website=search.amphilsoc.org}}</ref> Other awards and honors include: | ||
| Line 198: | Line 199: | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4A: Combinatorial Algorithms, Part 1 |year=2011 |publisher=Addison-Wesley Professional |isbn=978-0-201-03804-0 |title-link=The Art of Computer Programming}} | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4A: Combinatorial Algorithms, Part 1 |year=2011 |publisher=Addison-Wesley Professional |isbn=978-0-201-03804-0 |title-link=The Art of Computer Programming}} | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4B: Combinatorial Algorithms, Part 2 |year=2022 |publisher=Addison-Wesley Professional |isbn=978-0-201-03806-4 |title-link=The Art of Computer Programming}} | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4B: Combinatorial Algorithms, Part 2 |year=2022 |publisher=Addison-Wesley Professional |isbn=978-0-201-03806-4 |title-link=The Art of Computer Programming}} | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=MMIX—A RISC Computer for the New Millennium |volume=1, Fascicle 1 |year=2005 |isbn=978-0-201-85392-6 |title-link=MMIX}} | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=MMIX—A RISC Computer for the New Millennium |volume=1, Fascicle 1 |year=2005 |isbn=978-0-201-85392-6 |title-link=MMIX |publisher=Pearson Education }} | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions |year=2008 |publisher=Addison-Wesley |isbn=978-0-321-53496-5}} | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions |year=2008 |publisher=Addison-Wesley |isbn=978-0-321-53496-5}} | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams |year=2009 |publisher=Addison-Wesley |isbn=978-0-321-58050-4}} | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=The Art of Computer Programming |volume=4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams |year=2009 |publisher=Addison-Wesley |isbn=978-0-321-58050-4}} | ||
| Line 222: | Line 223: | ||
Books of collected papers: | Books of collected papers: | ||
{{refbegin}} | {{refbegin}} | ||
# {{Cite book |first=Donald E. |last=Knuth | author-mask = 3 |title=Literate Programming |place=Stanford, [[California|CA]] |publisher=[[Stanford University Centers and Institutes#Center for the Study of Language and Information|Center for the Study of Language and Information]]—CSLI |series=Lecture Notes |year=1992 |isbn=978-0-937073-80-3 |issue=27|title-link=Literate Programming }}<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/lp.html |title=Literate Programming |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803223349/https://www.cs.stanford.edu/~knuth/lp.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Literate Programming |place=Stanford, [[California|CA]] |publisher=[[Stanford University Centers and Institutes#Center for the Study of Language and Information|Center for the Study of Language and Information]]—CSLI |series=Lecture Notes |year=1992 |isbn=978-0-937073-80-3 |issue=27 |title-link=Literate Programming}}<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/lp.html |title=Literate Programming |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803223349/https://www.cs.stanford.edu/~knuth/lp.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# {{Cite book |first=Donald E. |last=Knuth | author-mask = 3 |title=Selected Papers on Computer Science |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=1996 |isbn=978-1-881526-91-9 |issue=59}}<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/cs.html |title=Selected Papers on Computer Science |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803223853/https://www.cs.stanford.edu/~knuth/cs.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Selected Papers on Computer Science |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=1996 |isbn=978-1-881526-91-9 |issue=59}}<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/cs.html |title=Selected Papers on Computer Science |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803223853/https://www.cs.stanford.edu/~knuth/cs.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Digital Typography |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=1999 |isbn=978-1-57586-010-7 |issue=78 |url-access=registration |url=https://archive.org/details/digitaltypograph0000knut }}<ref>{{Cite journal |url=https://cs.stanford.edu/~knuth/dt.html |title=Digital Typography |volume=249 |issue=2 |pages=106–119 |last=Knuth |first=Donald Ervin |journal=Scientific American |bibcode=1983SciAm.249b.106B |year=1983 |doi=10.1038/scientificamerican0883-106 |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190505113549/https://cs.stanford.edu/~knuth/dt.html |archive-date=May 5, 2019 |url-status=live }}</ref> | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Digital Typography |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=1999 |isbn=978-1-57586-010-7 |issue=78 |url-access=registration |url=https://archive.org/details/digitaltypograph0000knut}}<ref>{{Cite journal |url=https://cs.stanford.edu/~knuth/dt.html |title=Digital Typography |volume=249 |issue=2 |pages=106–119 |last=Knuth |first=Donald Ervin |journal=Scientific American |bibcode=1983SciAm.249b.106B |year=1983 |doi=10.1038/scientificamerican0883-106 |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190505113549/https://cs.stanford.edu/~knuth/dt.html |archive-date=May 5, 2019 |url-status=live }}</ref> | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Selected Papers on Analysis of Algorithms |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=2000 |isbn=978-1-57586-212-5 |issue=102 |url-access=registration |url=https://archive.org/details/selectedpaperson0000knut }}<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/aa.html |title=Selected Papers on Analysis of Algorithms |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803223905/https://www.cs.stanford.edu/~knuth/aa.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Selected Papers on Analysis of Algorithms |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=2000 |isbn=978-1-57586-212-5 |issue=102 |url-access=registration |url=https://archive.org/details/selectedpaperson0000knut}}<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/aa.html |title=Selected Papers on Analysis of Algorithms |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803223905/https://www.cs.stanford.edu/~knuth/aa.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# {{Cite book |first=Donald E. |last=Knuth | author-mask = 3 |title=Selected Papers on Computer Languages |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=2003 |isbn=978-1-57586-381-8 |issue=139}}, {{isbn|1-57586-382-0}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/cl.html |title=Selected Papers on Computer Languages |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224057/https://www.cs.stanford.edu/~knuth/cl.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Selected Papers on Computer Languages |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=2003 |isbn=978-1-57586-381-8 |issue=139}}, {{isbn|1-57586-382-0}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/cl.html |title=Selected Papers on Computer Languages |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224057/https://www.cs.stanford.edu/~knuth/cl.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Selected Papers on Discrete Mathematics |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=2003 |isbn=978-1-57586-249-1 |issue=106 |url-access=registration |url=https://archive.org/details/selectedpaperson0000knut_d0j2 }}, {{isbn|1-57586-248-4}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/dm.html |title=Selected Papers on Discrete Mathematics |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224050/https://www.cs.stanford.edu/~knuth/dm.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # {{Cite book |first=Donald E. |last=Knuth |author-mask=3 |title=Selected Papers on Discrete Mathematics |place=Stanford, [[California|CA]] |publisher=Center for the Study of Language and Information—CSLI |series=Lecture Notes |year=2003 |isbn=978-1-57586-249-1 |issue=106 |url-access=registration |url=https://archive.org/details/selectedpaperson0000knut_d0j2}}, {{isbn|1-57586-248-4}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/dm.html |title=Selected Papers on Discrete Mathematics |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224050/https://www.cs.stanford.edu/~knuth/dm.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# Donald E. Knuth, Selected Papers on Design of Algorithms (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 191), 2010. {{isbn|1-57586-583-1}} (cloth), {{isbn|1-57586-582-3}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/da.html |title=Selected Papers on Design of Algorithms |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224327/https://www.cs.stanford.edu/~knuth/da.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # Donald E. Knuth, Selected Papers on Design of Algorithms (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 191), 2010. {{isbn|1-57586-583-1}} (cloth), {{isbn|1-57586-582-3}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/da.html |title=Selected Papers on Design of Algorithms |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224327/https://www.cs.stanford.edu/~knuth/da.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# Donald E. Knuth, Selected Papers on Fun and Games (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 192), 2011. {{isbn|978-1-57586-585-0}} (cloth), {{isbn|978-1-57586-584-3}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/fg.html |title=Selected Papers on Fun and Games |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224253/https://www.cs.stanford.edu/~knuth/fg.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # Donald E. Knuth, Selected Papers on Fun and Games (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 192), 2011. {{isbn|978-1-57586-585-0}} (cloth), {{isbn|978-1-57586-584-3}} (paperback)<ref>{{Cite web |url=https://cs.stanford.edu/~knuth/fg.html |title=Selected Papers on Fun and Games |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224253/https://www.cs.stanford.edu/~knuth/fg.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
| Line 235: | Line 236: | ||
Other books: | Other books: | ||
{{refbegin}} | {{refbegin}} | ||
# {{Cite book |last1=Graham |first1=Ronald L |author-link1=Ronald | # {{Cite book |last1=Graham |first1=Ronald L |author-link1=Ronald Graham |last2=Knuth |first2=Donald E. |last3=Patashnik |first3=Oren |author-link3=Oren Patashnik |title=Concrete mathematics: A foundation for computer science |edition=Second |publisher=Addison-Wesley |location=Reading, MA |year=1994 |isbn=978-0-201-55802-9 |mr=1397498 |title-link=Concrete Mathematics}} xiv+657 pp. | ||
# {{Cite book |last=Knuth |first=Donald Ervin |title=Surreal numbers: how two ex-students turned on to pure mathematics and found total happiness: a mathematical novelette |year=1974 |publisher=Addison-Wesley |isbn=978-0-201-03812-5}}<ref name=surreal>{{Cite web |url=https://cs.stanford.edu/~knuth/sn.html |title=Surreal numbers |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224012/https://www.cs.stanford.edu/~knuth/sn.html |archive-date=August 3, 2019 |url-status=live }}</ref> | # {{Cite book |last=Knuth |first=Donald Ervin |title=Surreal numbers: how two ex-students turned on to pure mathematics and found total happiness: a mathematical novelette |year=1974 |publisher=Addison-Wesley |isbn=978-0-201-03812-5}}<ref name=surreal>{{Cite web |url=https://cs.stanford.edu/~knuth/sn.html |title=Surreal numbers |last=Knuth |first=Donald Ervin |work=Home page |access-date=March 26, 2020 |archive-url=https://web.archive.org/web/20190803224012/https://www.cs.stanford.edu/~knuth/sn.html |archive-date=August 3, 2019 |url-status=live }}</ref> | ||
# Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing (New York, ACM Press) 1993. second paperback printing 2009. {{isbn|0-321-60632-9}} | # Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing (New York, ACM Press) 1993. second paperback printing 2009. {{isbn|0-321-60632-9}} | ||
| Line 253: | Line 254: | ||
* [[-yllion]] | * [[-yllion]] | ||
* [[Attribute grammar]] | * [[Attribute grammar]] | ||
* [[CC system]] | * [[CC system]] | ||
* [[Dancing | * [[Dancing links]] | ||
* [[Knuth–Bendix completion algorithm]] | * [[Knuth–Bendix completion algorithm]] | ||
* [[Knuth Prize]] | * [[Knuth Prize]] | ||
* [[Knuth's Algorithm X]] | * [[Knuth's Algorithm X]] | ||
* [[Knuth's Simpath algorithm]] | * [[Knuth's Simpath algorithm]] | ||
| Line 271: | Line 270: | ||
* [[Plactic monoid]] | * [[Plactic monoid]] | ||
* [[Quater-imaginary base]] | * [[Quater-imaginary base]] | ||
* [[Triangular number]] | * [[Triangular number]] | ||
* [[The Complexity of Songs]] | * [[The Complexity of Songs]] | ||
| Line 306: | Line 304: | ||
== Bibliography == | == Bibliography == | ||
{{refbegin}} | {{refbegin}} | ||
* {{cite web |url = https://cs.stanford.edu/~knuth/ |title=Home page |last=Knuth |first=Donald Ervin |publisher=[[Stanford University]] }} | * {{cite web |url=https://cs.stanford.edu/~knuth/ |title=Home page |last=Knuth |first=Donald Ervin |publisher=[[Stanford University]]}} | ||
* {{cite web |last=Knuth |first=Donald Ervin |title = The Art of Computer Programming (TAOCP) |url = https://cs.stanford.edu/~knuth/taocp.html |access-date=May 20, 2012}} | * {{cite web |last=Knuth |first=Donald Ervin |title=The Art of Computer Programming (TAOCP) |url=https://cs.stanford.edu/~knuth/taocp.html |access-date=May 20, 2012}} | ||
* {{cite journal |url=http://www.stanfordalumni.org/news/magazine/2006/mayjun/features/knuth.html |title=Love at First Byte |first1=Kara |last1=Platoni |last2=Archibald |first2=Timothy |journal=Stanford Magazine |date=May–June 2006 |ref={{Harvid|Platoni|2006}} |access-date=May 18, 2006 |archive-url=https://web.archive.org/web/20060925022700/http://www.stanfordalumni.org/news/magazine/2006/mayjun/features/knuth.html |archive-date=September 25, 2006 |url-status=dead }} | * {{cite journal |url=http://www.stanfordalumni.org/news/magazine/2006/mayjun/features/knuth.html |title=Love at First Byte |first1=Kara |last1=Platoni |last2=Archibald |first2=Timothy |journal=Stanford Magazine |date=May–June 2006 |ref={{Harvid|Platoni|2006}} |access-date=May 18, 2006 |archive-url=https://web.archive.org/web/20060925022700/http://www.stanfordalumni.org/news/magazine/2006/mayjun/features/knuth.html |archive-date=September 25, 2006 |url-status=dead}} | ||
{{refend}} | {{refend}} | ||
| Line 339: | Line 337: | ||
{{DEFAULTSORT:Knuth, Donald Ervin}} | {{DEFAULTSORT:Knuth, Donald Ervin}} | ||
[[Category:Donald Knuth| ]] | [[Category:Donald Knuth| ]] | ||
[[Category:1938 births]] | |||
[[Category:Living people]] | |||
[[Category:20th-century American computer scientists]] | |||
[[Category:20th-century American male composers]] | |||
[[Category:20th-century American mathematicians]] | |||
[[Category:20th-century American organists]] | |||
[[Category:21st-century American male composers]] | |||
[[Category:21st-century American mathematicians]] | |||
[[Category:21st-century American organists]] | |||
[[Category:21st-century American computer scientists]] | |||
[[Category:Academic staff of the University of Oslo]] | |||
[[Category:American computer programmers]] | |||
[[Category:American computer science educators]] | |||
[[Category:American computer scientists]] | [[Category:American computer scientists]] | ||
[[Category:American | [[Category:American Lutherans]] | ||
[[Category: | [[Category:American typographers and type designers]] | ||
[[Category:American fellows of the Royal Society]] | |||
[[Category:American people of German descent]] | [[Category:American people of German descent]] | ||
[[Category:American technology writers]] | [[Category:American technology writers]] | ||
[[Category: | [[Category:Burroughs Corporation people]] | ||
[[Category: | [[Category:California Institute of Technology alumni]] | ||
[[Category:California Institute of Technology faculty]] | |||
[[Category:Case Western Reserve University alumni]] | |||
[[Category:Combinatorialists]] | [[Category:Combinatorialists]] | ||
[[Category: | [[Category:Computer science writers]] | ||
[[Category: | [[Category:Donegall Lecturers of Mathematics at Trinity College Dublin]] | ||
[[Category:Fellows of the American Mathematical Society]] | [[Category:Fellows of the American Mathematical Society]] | ||
[[Category:Fellows of the Association for Computing Machinery]] | |||
[[Category:Fellows of the British Computer Society]] | [[Category:Fellows of the British Computer Society]] | ||
[[Category:Fellows of the Society for Industrial and Applied Mathematics]] | [[Category:Fellows of the Society for Industrial and Applied Mathematics]] | ||
[[Category: | [[Category:Free software programmers]] | ||
[[Category:Foreign members of the Royal Society]] | [[Category:Foreign members of the Royal Society]] | ||
[[Category:Foreign members of the Russian Academy of Sciences]] | [[Category:Foreign members of the Russian Academy of Sciences]] | ||
[[Category:Grace Murray Hopper Award laureates]] | |||
[[Category:Harvey Prize winners]] | |||
[[Category:Kyoto laureates in Advanced Technology]] | |||
[[Category:Mad (magazine) people]] | |||
[[Category:Mathematics popularizers]] | |||
[[Category:Members of the American Philosophical Society]] | |||
[[Category:Members of the Department of Computer Science, University of Oxford]] | |||
[[Category:Members of the French Academy of Sciences]] | [[Category:Members of the French Academy of Sciences]] | ||
[[Category:Members of the Norwegian Academy of Science and Letters]] | [[Category:Members of the Norwegian Academy of Science and Letters]] | ||
[[Category:Members of the Department of Computer Science | [[Category:Members of the United States National Academy of Engineering]] | ||
[[Category:Members of the United States National Academy of Sciences]] | |||
[[Category:National Medal of Science laureates]] | |||
[[Category:Programming language designers]] | |||
[[Category:Recipients of Franklin Medal]] | |||
[[Category:Scientists from California]] | |||
[[Category:Scientists from Milwaukee]] | |||
[[Category:Stanford University Department of Computer Science faculty]] | |||
[[Category:Stanford University School of Engineering faculty]] | [[Category:Stanford University School of Engineering faculty]] | ||
[[Category: | [[Category:Turing Award laureates]] | ||
[[Category: | [[Category:Writers from Milwaukee]] | ||
[[Category:Writers from Palo Alto, California]] | [[Category:Writers from Palo Alto, California]] | ||