Donald Ervin Knuth  

Donald Knuth at a reception for the Open Content Alliance, October 25, 2005


Born  Milwaukee, Wisconsin, US 
January 10, 1938
Residence  US 
Nationality  American 
Fields  Mathematics Computer science 
Institutions  Stanford University 
Alma mater  Case Institute of Technology California Institute of Technology 
Thesis  Finite Semifields and Projective Planes (1963) 
Doctoral advisor  Marshall Hall, Jr. 
Doctoral students  Leonidas J. Guibas Michael Fredman Scott Kim Vaughan Pratt Robert Sedgewick Jeffrey Vitter Andrei Broder 
Known for  The Art of Computer Programming TeX, METAFONT Knuth–Morris–Pratt algorithm Knuth–Bendix completion algorithm MMIX Robinson–Schensted–Knuth correspondence 
Notable awards  Turing Award (1974) National Medal of Science (1979) John von Neumann Medal (1995) Harvey Prize (1995) Kyoto Prize (1996) Faraday Medal (2011) 
Website Donald E. Knuth 
Donald Ervin Knuth (/kəˈnuːθ/^{[1]} kəNOOTH; born January 10, 1938) is an American computer scientist, mathematician, and Professor Emeritus at Stanford University.^{[2]}
He is the author of the multivolume work The Art of Computer Programming.^{[3]} Knuth has been called the "father" of the analysis of algorithms. 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 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.
As a writer and scholar,^{[4]} Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents.^{[5]} He has expressed his disagreement directly to both the United States Patent and Trademark Office and European Patent Organization.^{[6]}
Contents
Early life[edit]
Knuth was born in Milwaukee, Wisconsin, where his father owned a small printing business and taught bookkeeping at Milwaukee Lutheran High School, where he enrolled, earning achievement awards. He applied his intelligence in unconventional ways, winning a contest when he was in eighth grade by finding over 4,500 words that could be formed from the letters in "Ziegler's Giant Bar"; the judges had only about 2,500 words on their master list. This won him a television set for his school and a candy bar for everyone in his class.^{[7]}
Education[edit]
Knuth had a difficult time choosing physics over music as his major at Case Institute of Technology (now part of Case Western Reserve University). He also joined Beta Nu Chapter of the Theta Chi fraternity. While studying physics at the Case Institute of Technology, Knuth was introduced to the IBM 650, one of the early mainframes. After reading the computer's manual, Knuth decided to rewrite the assembly and compiler code for the machine used in his school, because he believed he could do it better.^{[8]} In 1958, Knuth constructed a program based on the value of each player that could help his school basketball team win the league. This was so novel a proposition at the time that it got picked up and published by Newsweek and also covered by Walter Cronkite on the CBS Evening News.^{[8]} Knuth was one of the founding editors of the Engineering and Science Review, which won a national award as best technical magazine in 1959.^{[9]} He then switched from physics to mathematics, and in 1960 he received his bachelor of science degree, simultaneously being given a master of science degree by a special award of the faculty who considered his work exceptionally outstanding.^{[8]}^{[10]}
In 1963, he earned a PhD in mathematics (his advisor was Marshall Hall) from the California Institute of Technology.^{[11]}
Early work[edit]
Upon receiving his PhD, Knuth joined Caltech's faculty as an associate professor.
He accepted a commission^{[when?]} to write a book on computer programming language compilers. While working on this project, Knuth decided^{[when?]} 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. As Knuth developed his outline for the book, he concluded that he required six volumes,^{[when?]} and then seven,^{[when?]} to thoroughly cover the subject. He published the first volume in 1968.
Just before publishing the first volume of The Art of Computer Programming, Knuth left Caltech^{[when?]} to accept employment with the Institute for Defense Analyses' Communications Research Division, then situated on the Princeton University campus, which was performing mathematical research in cryptography to support the National Security Agency.
Knuth then left this position^{[when?]} to join the Stanford University faculty.
Writings[edit]
The Art of Computer Programming (TAOCP)[edit]
Computer science was then taking its first hesitant steps. "It was a totally new field," Knuth recalls, "with no real identity. And the standard of available publications was not that high. A lot of the papers coming out were quite simply wrong. [...] So one of my motivations was to put straight a story that had been very badly told."
After producing the third volume of his series in 1976, he expressed such frustration with the nascent state of the then newly developed electronic publishing tools (especially those that provided input to phototypesetters) that he took time out to work on typesetting and created the TeX and METAFONT tools.
As of 2013^{[update]}, the first three volumes and part one of volume four of his series have been published.^{[12]}
Other works[edit]
He is also the author of Surreal Numbers,^{[13]} a mathematical novelette on John Conway's set theory construction of an alternate system of numbers. Instead of simply explaining the subject, the book seeks to show the development of the mathematics. Knuth wanted the book to prepare students for doing original, creative research.
In 1995, Knuth wrote the foreword to the book A=B by Marko Petkovsek, Herbert Wilf and Doron Zeilberger.^{[14]} Knuth is also an occasional contributor of language puzzles to Word Ways: The Journal of Recreational Linguistics.
Religious beliefs and work[edit]
In addition to his writings on computer science, Knuth, a Lutheran,^{[15]} is also the author of 3:16 Bible Texts Illuminated,^{[16]} 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 under the leadership of Hermann Zapf.
Subsequently he was invited to give a set of lectures on his 3:16 project, resulting in another book, Things a Computer Scientist Rarely Talks About.
Health concerns[edit]
In 2006, Knuth was diagnosed with prostate cancer. He underwent surgery in December that year and started "a little bit of radiation therapy... as a precaution but the prognosis looks pretty good", as he reported in his video autobiography.^{[17]}
Computer musings[edit]
Knuth gives informal lectures a few times a year at Stanford University, which he called Computer Musings. He was also a visiting professor at the Oxford University Computing Laboratory (now the Oxford University Department of Computer Science) in the United Kingdom and an Honorary Fellow of Magdalen College.^{[18]}
Humor[edit]
Knuth is known for his "professional humor".
 He used to pay a finder's fee of $2.56 for any typographical errors or mistakes discovered in his books, because "256 pennies is one hexadecimal dollar", and $0.32 for "valuable suggestions". According to an article in the Massachusetts Institute of Technology's Technology Review, these Knuth reward checks are "among computerdom's most prized trophies". Knuth had to stop sending real checks in 2008 due to bank fraud, and instead now gives each error finder a "certificate of deposit" from a publicly listed balance in his fictitious "Bank of San Serriffe".^{[19]}
 He once warned a correspondent, "Beware of bugs in the above code; I have only proved it correct, not tried it."^{[20]}
 The preface of Concrete Mathematics includes the following anecdote: "When Knuth taught Concrete Mathematics at Stanford for the first time, he explained the somewhat strange title by saying that it was his attempt to teach a math course that was hard instead of soft. He announced that, contrary to the expectations of some of his colleagues, he was not going to teach the Theory of Aggregates, nor Stone's Embedding Theorem, nor even the Stone–Čech compactification theorem. (Several students from the civil engineering department got up and quietly left the room.)"
 Knuth published his first "scientific" article in a school magazine in 1957 under the title "Potrzebie System of Weights and Measures." In it, he defined the fundamental unit of length as the thickness of Mad No. 26, and named the fundamental unit of force "whatmeworry." Mad published the article in issue No. 33 (June 1957).^{[21]}
 Knuth's article about the computational complexity of songs, "The Complexity of Songs", was reprinted twice in computer science journals.
 To demonstrate the concept, Knuth intentionally referred "Circular definition" and "Definition, circular" to each other in the index of The Art of Computer Programming, Volume 1.
 At the TUG 2010 Conference,^{[22]} Knuth announced an XMLbased successor to TeX, titled "iTeX" (pronounced [iː˨˩˦tɛks˧˥], with a bell ringing), which would support features such as arbitrarily scaled irrational units, 3D printing, animation, and stereophonic sound.^{[23]}^{[24]}
Awards[edit]
In 1971, Knuth was the recipient of the first ACM Grace Murray Hopper Award. He has received various other awards including the Turing Award, the National Medal of Science, the John von Neumann Medal, and the Kyoto Prize.
In recognition of Knuth's contributions to the field of computer science, in 1990 he was awarded the oneofakind academic title of Professor of The Art of Computer Programming, which has since been revised to Professor Emeritus of The Art of Computer Programming.
Knuth was elected to the National Academy of Sciences in 1975. 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 2003 he was elected as a foreign member of the Royal Society.
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.^{[25]} He is a member of the Norwegian Academy of Science and Letters.^{[26]} In 2012, he became a fellow of the American Mathematical Society.^{[27]}
Honors bestowed on Knuth include:
 First ACM Grace Murray Hopper Award, 1971
 Turing Award, 1974
 Josiah Willard Gibbs Lecturer, 1978^{[28]}^{[29]}
 National Medal of Science, 1979
 Franklin Medal, 1988
 John von Neumann Medal, 1995
 Harvey Prize from the Technion, 1995^{[30]}
 Kyoto Prize, 1996
 Fellow of the Computer History Museum, 1998
 Katayanagi Prize, 2010^{[31]}
 BBVA Foundation Frontiers of Knowledge Award, 2010^{[32]}
 Stanford University School of Engineering Hero Award, 2011^{[33]}
Works[edit]
A short list of his works:^{[34]}
The Art of Computer Programming[edit]
 ——— (1997), The Art of Computer Programming, 1: Fundamental Algorithms (3rd ed.), AddisonWesley Professional, ISBN 0201896834.
 ——— (1997), The Art of Computer Programming, 2: Seminumerical Algorithms (3rd ed.), AddisonWesley Professional, ISBN 0201896842.
 ——— (1998), The Art of Computer Programming, 3: Sorting and Searching (2nd ed.), AddisonWesley Professional, ISBN 0201896850.
 ——— (2011), The Art of Computer Programming, 4A: Combinatorial Algorithms, AddisonWesley Professional, ISBN 0201038048.
The Art of Computer Programming[edit]
 ——— (2005), MMIX—A RISC Computer for the New Millennium, 1, Fascicle 1, ISBN 0201853922.
 ——— (2008), The Art of Computer Programming, 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions, ISBN 0321534964.
 ——— (2009), The Art of Computer Programming, 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams, ISBN 0321580508.
 ——— (2005), The Art of Computer Programming, 4, Fascicle 2: Generating All Tuples and Permutations, ISBN 0201853930.
 ——— (2005), The Art of Computer Programming, 4, Fascicle 3: Generating All Combinations and Partitions, ISBN 0201853949.
 ——— (2006), The Art of Computer Programming, 4, Fascicle 4: Generating All Trees—History of Combinatorial Generation, ISBN 0321335708.
Computers & Typesetting[edit]
 ——— (1984), Computers & Typesetting, A, The TeXbook, Reading, MA: AddisonWesley, ISBN 0201134470, x+483pp.
 ——— (1986), Computers & Typesetting, B, TeX: The Program, Reading, MA: AddisonWesley, ISBN 0201134373, xviii+600pp.
 ——— (1986), Computers & Typesetting, C, The METAFONTbook, Reading, MA: AddisonWesley, ISBN 0201134454, xii+361pp.
 ——— (1986), Computers & Typesetting, D, METAFONT: The Program, Reading, MA: AddisonWesley, ISBN 0201134381, xviii+566pp.
 ——— (1986), Computers & Typesetting, E, Computer Modern Typefaces, Reading, MA: AddisonWesley, xvi+588pp.
Selected papers[edit]
 ——— (1992), Literate Programming^{[35]}, Lecture Notes (27), Stanford, CA: Center for the Study of Language and Information—CSLI, ISBN 0937073806.
 ——— (1996), Selected Papers on Computer Science^{[36]}, Lecture Notes (59), Stanford, CA: Center for the Study of Language and Information—CSLI, ISBN 1881526917.
 ——— (1999), Digital Typography^{[37]}, Lecture Notes (78), Stanford, CA: Center for the Study of Language and Information—CSLI, ISBN 1575860104.
 ——— (2000), Selected Papers on Analysis of Algorithms^{[38]}, Lecture Notes (102), Stanford, CA: Center for the Study of Language and Information—CSLI, ISBN 1575862123.
 ——— (2003), Selected Papers on Computer Languages^{[39]} (clothCA: Center for the Study of Language and Information—CSLI, ISBN 1575863812 ), Lecture Notes (139), Stanford, , ISBN 1575863820 (paperback)
 ——— (2003), Selected Papers on Discrete Mathematics^{[40]} (clothCA: Center for the Study of Language and Information—CSLI, ISBN 1575862492 ), Lecture Notes (106), Stanford, , ISBN 1575862484 (paperback).
 Donald E. Knuth, Selected Papers on Design of Algorithms^{[41]} (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 191), 2010. ISBN 1575865831 (cloth), ISBN 1575865823 (paperback)
 Donald E. Knuth, Selected Papers on Fun and Games^{[42]} (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 192), 2011. ISBN 9781575865850 (cloth), ISBN 9781575865843 (paperback)
 Donald E. Knuth, Companion to the Papers of Donald Knuth^{[43]} (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 202), 2011. ISBN 9781575866352 (cloth), ISBN 9781575866345 (paperback)
 Graham, Ronald L; Knuth, Donald E.; Patashnik, Oren (1994), Concrete mathematics: A foundation for computer science (Second ed.), Reading, MA: AddisonWesley, ISBN 0201558025, MR 1397498 xiv+657 pp.
 Knuth, Donald Ervin (1974), Surreal numbers: how two exstudents turned on to pure mathematics and found total happiness: a mathematical novelette, AddisonWesley, ISBN 9780201038125^{[44]}
 Donald E. Knuth, The Stanford GraphBase: A Platform for Combinatorial Computing (New York, ACM Press) 1993. second paperback printing 2009. ISBN 0321606329
 Donald E. Knuth, 3:16 Bible Texts Illuminated (Madison, Wisconsin: AR Editions), 1990. ISBN 0895792524
 Donald E. Knuth, Things a Computer Scientist Rarely Talks About (Center for the Study of Language and Information—CSLI Lecture Notes no 136), 2001. ISBN 157586326X
See also[edit]
 Asymptotic notation
 Attribute grammar
 Dancing Links
 Knuth–Bendix completion algorithm
 Knuth–Morris–Pratt algorithm
 Knuth yllion
 Knuth Prize
 Knuth shuffle
 Knuth's uparrow notation
 Man or boy test
 Robinson–Schensted–Knuth correspondence
 The Complexity of Songs
 Trabb Pardo–Knuth algorithm
 List of science and religion scholars
Gallery[edit]

Donald Knuth in front of statue St. Mesrop Mashtots, Matenadaran, Yerevan, Armenia, June 9, 2006

Donald Knuth, Steve Wozniak, CHM 2011
References[edit]
 ^ Knuth, Donald Ervin. "Frequently Asked Questions". Home page. Stanford University. Retrieved November 2, 2010. "How do you pronounce your last name? KaNOOTH."
 ^ Knuth, Donald Ervin, Home page, Stanford University.
 ^ The Art of Computer Programming, Stanford University.
 ^ Knuth, Donald Ervin, Curriculum vitæ, Stanford University.
 ^ "Professor Donald Knuth's Thinking Against Software Patents" (PDF), Notices (article) (The American Mathematical Society), March 2002.
 ^ Knuth, Donald Ervin, Against software patents (PDF) (Letters) to the patent offices in the USA and Europe.
 ^ Shasha, Dennis Elliott; Lazere, Cathy A (1998), Out of their minds: the lives and discoveries of 15 great computer scientists, Springer, p. 90, ISBN 9780387982694
 ^ ^{a} ^{b} ^{c} Koshy, Thomas (2004), Discrete mathematics with applications, Academic Press, p. 244, ISBN 9780124211803, retrieved July 30, 2011
 ^ "History of Beta Nu Chapter", The Tachi, CWRU.
 ^ A.M. Turing Award; Donald ("Don") Erwin Knuth, ACM, 1974.
 ^ Knuth, Donald Ervin (1963), Finite Semifields and Projective Planes (PDF) (PhD dissertation), Caltech.
 ^ Knuth, Donald Ervin. "The Art of Computer Programming (TAOCP)". Retrieved May 20, 2012.
 ^ Knuth 1974.
 ^ Zeilberg, DEK, Rutgers.
 ^ Platoni 2006.
 ^ Knuth, Donald Ervin (1991), 3:16 : Bible texts illuminated, Madison, WI: AR Eds, ISBN 9780895792525
 ^ "Donald Knuth: 85 – Coping with cancer". Web of Stories. April 2006. Retrieved May 2, 2012.
 ^ "Professor Donald Knuth". Magdalen College. Retrieved December 6, 2010.
 ^ "Rewriting the Bible in 0s and 1s", Technology Review (Massachusetts Institute of Technology).
 ^ Knuth, Donald Ervin. "Frequently Asked Questions". Home page. Stanford University. Retrieved November 2, 2010.
 ^ Knuth, Donald Ervin (June 1957), "Potrzebie System of Weights & Measures", Mad Magazine (33).
 ^ "Don Knuth", TUG (conference), River valley TV, 2010.
 ^ Knuth, Donald Ervin, An Earth‐shaking announcement (video) (recording), River Valley TV.
 ^ Knuth, Donald Ervin (2010), "An Earthshaking Announcement" (PDF), TUGboat 31 (2): 121–24, ISSN 08963207
 ^ Fellows, Siam, 2009.
 ^ "Gruppe 1: Matematiske fag" (in Norwegian). Norwegian Academy of Science and Letters. Retrieved October 7, 2010.
 ^ List of Fellows of the American Mathematical Society, retrieved 20130127.
 ^ Josiah Willard Gibbs Lectures
 ^ Knuth, Donald E. (1979). "Mathematical typography". Bull. Amer. Math. Soc. (N.S.) 1 (2): 337–372. MR 520078.
 ^ Harvey, IL: Technion, 1995.
 ^ Katayanagi, CMU.
 ^ "Galardonados", Fronteras (in Spanish), ES: FBBVA, 2010.
 ^ Myers, Andrew (June 1, 2001). "Stanford's Don Knuth, a pioneering hero of computer programming". Stanford Report. Retrieved June 27, 2011.
 ^ Knuth, Donald Ervin, "Books", Home page (list).
 ^ Knuth, Donald Ervin, "Literate Programming", Home page.
 ^ Knuth, Donald Ervin, "Selected Papers on Computer Science", Home page.
 ^ Knuth, Donald Ervin, "Digital Typography", Home page.
 ^ Knuth, Donald Ervin, "Selected Papers on Analysis of Algorithms", Home page.
 ^ Knuth, Donald Ervin, "Selected Papers on Computer Languages", Home page.
 ^ Knuth, Donald Ervin, "Selected Papers on Discrete Mathematics", Home page.
 ^ Knuth, Donald Ervin, "Selected Papers on Design of Algorithms", Home page.
 ^ Knuth, Donald Ervin, "Selected Papers on Fun and Games", Home page.
 ^ Knuth, Donald Ervin, "Companion to the Papers of Donald Knuth"]", Home page
 ^ Knuth, Donald Ervin, "Surreal numbers", Home page.
Bibliography[edit]
 Knuth, Donald Ervin, Home page, Stanford University.
 Knuth, Donald Ervin. "The Art of Computer Programming (TAOCP)". Retrieved May 20, 2012.
 Platoni, Kara (May–June 2006), "Love at First Byte", Archibald, Timothy photogr, Stanford Magazine (Stanford Alumni). A retrospective of Knuth's life and work, with some rare, recent photos.
External links[edit]
Wikiquote has a collection of quotations related to: Donald Knuth 
Wikimedia Commons has media related to Donald Ervin Knuth. 
 Donald Knuth’s home page at Stanford University.
 Donald E. Knuth (interview) (oral history), Charles Babbage Institute, University of Minnesota. Knuth discusses software patenting, structured programming, collaboration and his development of TeX.
 Donald Knuth at the Mathematics Genealogy Project
 O'Connor, John J.; Robertson, Edmund F., "Donald Knuth", MacTutor History of Mathematics archive, University of St Andrews.
 Works by or about Donald Knuth in libraries (WorldCat catalog)
 Knuth, Donald Ervin, Lectures (Archive), Stanford.
 List of publications from Microsoft Academic Search
 List of publications from the DBLP Bibliography Server
 Interview at Stanford University "Donald Knuth – All Questions Answered"






This page uses Creative Commons Licensed content from Wikipedia. A portion of the proceeds from advertising on Digplanet goes to supporting Wikipedia.