Donald Knuth

From Wikipedia, the free encyclopedia

Donald Knuth
KnuthAtOpenContentAlliance.jpg
Knuth in 2005
Born
Donald Ervin Knuth

(1938-01-10) January 10, 1938 (age 83)
Milwaukee, Wisconsin, U.S.
NationalityAmerican
Education
  • Case Institute of Technology (B.S., M.S.)
  • California Institute of Technology (Ph.D.)
Known for
Spouse(s)Nancy Jill Carter
Children2
Awards
Scientific career
Fields
  • Mathematics
  • Computer science
InstitutionsStanford University,
University of Oslo
ThesisFinite Semifields and Projective Planes (1963)
Doctoral advisorMarshall Hall, Jr.[2]
Doctoral students
  • Leonidas J. Guibas
  • Michael Fredman
  • Scott Kim
  • Vaughan Pratt
  • Robert Sedgewick
  • Jeffrey Vitter
  • Andrei Broder[2]
Websitecs.stanford.edu/~knuth

Donald Ervin Knuth (/kəˈnuːθ/[3] kə-NOOTH; born January 10, 1938) is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science.[4] Knuth has been called the "father of the analysis of algorithms".[5]

He 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 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, Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. Knuth strongly opposes the granting of software patents, having expressed his opinion to the United States Patent and Trademark Office and European Patent Organisation.

Biography[]

Early life[]

Knuth was born in Milwaukee, Wisconsin, to Ervin Henry Knuth and Louise Marie Bohning.[6] He describes his heritage as "Midwestern Lutheran German".[7]: 66  His father owned a small printing business and taught bookkeeping.[8] Donald, a student at Milwaukee Lutheran High School, 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" could be rearranged to create; the judges had identified 2,500 such words. With time gained away from school due to a pretend stomach ache, and working the problem the other way, Knuth used an unabridged dictionary and determined if each dictionary entry could be formed using the letters in the phrase. Using this algorithm, he identified over 4,500 words, winning the contest.[7]: 3  As prizes, the school received a new television and enough candy bars for all of his schoolmates to eat.[9]

Education[]

Knuth received a scholarship in physics to the Case Institute of Technology (now part of Case Western Reserve University) in Cleveland, Ohio, enrolling in 1956.[10] He also joined Beta Nu Chapter of the Theta Chi fraternity. While studying physics at Case, Knuth was introduced to the IBM 650, an early commercial computer. 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.[11]

In 1958, Knuth created a program to help his school's basketball team win their games.[12] He assigned "values" to players in order to gauge their probability of getting points, a novel approach that Newsweek and CBS Evening News later reported on.[11]

Knuth was one of the founding editors of Case Institute's Engineering and Science Review, which won a national award as best technical magazine in 1959.[13][14] He then switched from physics to mathematics, and received two degrees from Case in 1960:[10] his bachelor of science degree, and simultaneously a master of science by a special award of the faculty, who considered his work exceptionally outstanding.[4][11]

In 1963, with mathematician Marshall Hall as his adviser,[2] he earned a PhD in mathematics from the California Institute of Technology.[15]

Early work[]

After receiving his PhD, Knuth joined Caltech's faculty as an assistant professor.[16]

He accepted a commission to write a book on computer programming language compilers. While working on this project, Knuth 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. As Knuth 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.[17]

Just before publishing the first volume of The Art of Computer Programming, Knuth left Caltech 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.

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 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."[18]

Knuth then left his position to join the Stanford University faculty in 1969,[19] where he is now Fletcher Jones Professor of Computer Science, Emeritus.[20][21]

Writings[]

Knuth is a writer, as well as a computer scientist.[16]

The Art of Computer Programming (TAOCP)[]

Main article: The Art of Computer Programming

"The best way to communicate from one human being to another is through story."

— Donald Knuth

In the 1970s, Knuth described computer science as "a totally new field 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."[22]

From 1972 to 1973, Knuth spent a year at the University of Oslo among people such as Ole-Johan Dahl. Here he was to actually write the seventh volume in his book series, a volume that was to deal with programming languages. However, Knuth had only finished the first two volumes when he came to Oslo, and thus spent the year on the third volume, next to teaching. The third volume in the series came out just after Knuth returned to Stanford in 1973.[23]

By 2011, the first three volumes and part one of volume four of his series had been published.[17] Concrete Mathematics: A Foundation for Computer Science 2nd ed., which originated with an expansion of the mathematical preliminaries section of Volume 1 of TAoCP, has also been published. In April 2020, Knuth said he is hard at work on part B of volume 4, and he anticipates that the book will have at least parts A through F.[18]

Other works[]

Knuth is also the author of Surreal Numbers,[24] 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 Petkovšek, Herbert Wilf and Doron Zeilberger.[25] Knuth is also an occasional contributor of language puzzles to Word Ways: The Journal of Recreational Linguistics.[26]

Knuth has also 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.[27]

Knuth has also appeared in a number of Numberphile[28] and Computerphile videos on YouTube where he has discussed topics from writing Surreal Numbers[29] to why he does not use email.[30]

Works regarding his religious beliefs[]

In addition to his writings on computer science, Knuth, a Lutheran,[31] is also the author of 3:16 Bible Texts Illuminated,[32] 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 at MIT on his 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".

Opinion on software patents[]

Knuth is strongly opposed to the policy of granting software patents for trivial solutions that should be obvious, but has expressed more nuanced views for nontrivial solutions such as the interior-point method of linear programming.[33] He has expressed his disagreement directly to both the United States Patent and Trademark Office and European Patent Organisation.[34]

Computer Musings[]

Knuth gives informal lectures a few times a year at Stanford University, which he titled "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.[35][36]

Programming[]

Digital typesetting[]

In the 1970s the publishers of TAOCP abandoned 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.[37]

Literate programming[]

While developing TeX, Knuth created a new methodology of programming, which he called literate programming, because he believed that programmers should think of programs as works of literature. "Instead of imagining that our main task is to instruct a computer what to do, let us concentrate rather on explaining to human beings what we want a computer to do."[38]

Knuth embodied the idea of literate programming in the WEB system. The same WEB source is used to weave a TeX file, and to tangle a Pascal source file. These in their turn produce a readable description of the program and an executable binary respectively. A later iteration of the system, CWEB, replaces Pascal with C.

Knuth used WEB to program TeX and METAFONT, and published both programs as books: The TeXbook, which is originally published in 1984, and The METAFONTbook, which is originally published in 1986.[39] Around the same time, LaTeX, the now-widely adopted macro package based on TeX, was first developed by Leslie Lamport, who later published its first user manual in 1986.

Music[]

Knuth is an organist and a composer. In 2016 he completed a musical piece for organ titled Fantasia Apocalyptica, which he describes as "translation of the Greek text of the Revelation of Saint John the Divine into music". It was premièred in Sweden on January 10, 2018.[40]

Personal life[]

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.[41]

Chinese name[]

Knuth's Chinese name is Gao Dena (simplified Chinese: 高德纳; traditional Chinese: 高德納; pinyin: Gāo Dénà).[42][3] In 1977, he was given this name by Frances Yao, shortly before making a 3-week trip to China.[3][43] In the 1980 Chinese translation of Volume 1 of The Art of Computer Programming (simplified Chinese: 电脑程序设计艺术; traditional Chinese: 電腦程式設計藝術; pinyin: 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".[43]

Health concerns[]

In 2006, Knuth was diagnosed with prostate cancer. He underwent surgery in December that year and stated, "a little bit of radiation therapy ... as a precaution but the prognosis looks pretty good", as he reported in his video autobiography.[44]

Humor[]

One of Knuth's reward checks

Knuth 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".[45]

He once warned a correspondent, "Beware of bugs in the above code; I have only proved it correct, not tried it."[3]

Knuth published his first "scientific" article in a school magazine in 1957 under the title "The 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).[46][47]

To demonstrate the concept of recursion, Knuth intentionally referred "Circular definition" and "Definition, circular" to each other in the index of The Art of Computer Programming, Volume 1.

The preface of Concrete Mathematics has the following paragraph:

When DEK 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 his colleagues, he was not going to teach the Theory of Aggregates, nor Stone's Embedding Theorem, nor even the Stone–Čech compactification. (Several students from the civil engineering department got up and quietly left the room.)

At the TUG 2010 Conference, Knuth announced a satirical XML-based successor to TeX, titled "iTeX" (pronounced [iː˨˩˦tɛks˧˥], performed with a bell ringing), which would support features such as arbitrarily scaled irrational units, 3D printing, input from seismographs and heart monitors, animation, and stereophonic sound.[48][49][50]

Awards and honors[]

In 1971, Knuth was the recipient of the first ACM Grace Murray Hopper Award.[51] He has received various other awards including the Turing Award, the National Medal of Science, the John von Neumann Medal, and the Kyoto Prize.[51]

Knuth was elected a Distinguished Fellow of the British Computer Society (DFBCS) in 1980 in recognition of Knuth's contributions to the field of computer science.[52]

In 1990 he was awarded the one-of-a-kind 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. 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 Foreign Member of the Royal Society (ForMemRS) in 2003.[1]

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.[53] He is a member of the Norwegian Academy of Science and Letters.[54] In 2012, he became a fellow of the American Mathematical Society[55] and a member of the American Philosophical Society.[56] Other awards and honors include:

Publications[]

A short list of his publications include:[70]

The Art of Computer Programming:

  1. ——— (1997). The Art of Computer Programming. 1: Fundamental Algorithms (3rd ed.). Addison-Wesley Professional. ISBN 978-0-201-89683-1.
  2. ——— (1997). The Art of Computer Programming. 2: Seminumerical Algorithms (3rd ed.). Addison-Wesley Professional. ISBN 978-0-201-89684-8.
  3. ——— (1998). The Art of Computer Programming. 3: Sorting and Searching (2nd ed.). Addison-Wesley Professional. ISBN 978-0-201-89685-5.
  4. ——— (2011). The Art of Computer Programming. 4A: Combinatorial Algorithms. Addison-Wesley Professional. ISBN 978-0-201-03804-0.
  5. ——— (2005). MMIX—A RISC Computer for the New Millennium. 1, Fascicle 1. ISBN 978-0-201-85392-6.
  6. ——— (2008). The Art of Computer Programming. 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions. ISBN 978-0-321-53496-5.
  7. ——— (2009). The Art of Computer Programming. 4, Fascicle 1: Bitwise Tricks & Techniques, Binary Decision Diagrams. ISBN 978-0-321-58050-4.
  8. ——— (2005). The Art of Computer Programming. 4, Fascicle 2: Generating All Tuples and Permutations. ISBN 978-0-201-85393-3.
  9. ——— (2005). The Art of Computer Programming. 4, Fascicle 3: Generating All Combinations and Partitions. ISBN 978-0-201-85394-0.
  10. ——— (2006). The Art of Computer Programming. 4, Fascicle 4: Generating All Trees—History of Combinatorial Generation. ISBN 978-0-321-33570-8.
  11. ——— (2018). The Art of Computer Programming. 4, Fascicle 5: Mathematical Preliminaries Redux, Backtracking, Dancing Links. ISBN 978-0-134-67179-6.
  12. ——— (2015). The Art of Computer Programming. 4, Fascicle 6: Satisfiability. ISBN 978-0-134-39760-3.

Computers and Typesetting (all books are hardcover unless otherwise noted):

  1. ——— (1984). Computers & Typesetting. A, The TeXbook. Reading, MA: Addison-Wesley. ISBN 978-0-201-13447-6., x+483pp.
  2. ——— (1984). Computers & Typesetting. A, The TeXbook. Reading, MA: Addison-Wesley. ISBN 978-0-201-13448-3. (softcover).
  3. ——— (1986). Computers & Typesetting. B, TeX: The Program. Reading, MA: Addison-Wesley. ISBN 978-0-201-13437-7., xviii+600pp.
  4. ——— (1986). Computers & Typesetting. C, The METAFONTbook. Reading, MA: Addison-Wesley. ISBN 978-0-201-13445-2., xii+361pp.
  5. ——— (1986). Computers & Typesetting. C, The METAFONTbook. Reading, MA: Addison-Wesley. ISBN 978-0-201-13444-5. (softcover).
  6. ——— (1986). Computers & Typesetting. D, METAFONT: The Program. Reading, MA: Addison-Wesley. ISBN 978-0-201-13438-4., xviii+566pp.
  7. ——— (1986). Computers & Typesetting. E, Computer Modern Typefaces. Reading, MA: Addison-Wesley. ISBN 978-0-201-13446-9., xvi+588pp.
  8. ——— (2000). Computers & Typesetting. A-E Boxed Set. Reading, MA: Addison-Wesley. ISBN 978-0-201-73416-4.

Books of collected papers:

  1. ——— (1992). Literate Programming. Lecture Notes. Stanford, CA: Center for the Study of Language and Information—CSLI. ISBN 978-0-937073-80-3.[71]
  2. ——— (1996). Selected Papers on Computer Science. Lecture Notes. Stanford, CA: Center for the Study of Language and Information—CSLI. ISBN 978-1-881526-91-9.[72]
  3. ——— (1999). Digital Typography. Lecture Notes. Stanford, CA: Center for the Study of Language and Information—CSLI. ISBN 978-1-57586-010-7.[73]
  4. ——— (2000). Selected Papers on Analysis of Algorithms. Lecture Notes. Stanford, CA: Center for the Study of Language and Information—CSLI. ISBN 978-1-57586-212-5.[74]
  5. ——— (2003). Selected Papers on Computer Languages. Lecture Notes. Stanford, CA: Center for the Study of Language and Information—CSLI. ISBN 978-1-57586-381-8., ISBN 1-57586-382-0 (paperback)[75]
  6. ——— (2003). Selected Papers on Discrete Mathematics. Lecture Notes. Stanford, CA: Center for the Study of Language and Information—CSLI. ISBN 978-1-57586-249-1., ISBN 1-57586-248-4 (paperback)[76]
  7. 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)[77]
  8. 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)[78]
  9. Donald E. Knuth, Companion to the Papers of Donald Knuth (Stanford, California: Center for the Study of Language and Information—CSLI Lecture Notes, no. 202), 2011. ISBN 978-1-57586-635-2 (cloth), ISBN 978-1-57586-634-5 (paperback)[79]

Other books:

  1. Graham, Ronald L; Knuth, Donald E.; Patashnik, Oren (1994). Concrete mathematics: A foundation for computer science (Second ed.). Reading, MA: Addison-Wesley. ISBN 978-0-201-55802-9. MR 1397498. xiv+657 pp.
  2. Knuth, Donald Ervin (1974). Surreal numbers: how two ex-students turned on to pure mathematics and found total happiness: a mathematical novelette. Addison-Wesley. ISBN 978-0-201-03812-5.[24]
  3. 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
  4. Donald E. Knuth, 3:16 Bible Texts Illuminated (Madison, Wisconsin: A-R Editions), 1990. ISBN 0-89579-252-4
  5. 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 1-57586-326-X
  6. Donald E. Knuth, MMIXware: A RISC Computer for the Third Millennium (Heidelberg: Springer-Verlag— Lecture Notes in Computer Science, no. 1750), 1999. viii+550pp. ISBN 978-3-540-66938-8
  7. Donald E. Knuth and Silvio Levy, The CWEB System of Structured Documentation (Reading, Massachusetts: Addison-Wesley), 1993. iv+227pp. ISBN 0-201-57569-8. Third printing 2001 with hypertext support, ii + 237 pp.
  8. Donald E. Knuth, Tracy L. Larrabee, and Paul M. Roberts, Mathematical Writing (Washington, D.C.: Mathematical Association of America), 1989. ii+115pp
  9. Daniel H. Greene and Donald E. Knuth, Mathematics for the Analysis of Algorithms (Boston: Birkhäuser), 1990. viii+132pp.
  10. Donald E. Knuth, Mariages Stables: et leurs relations avec d'autres problèmes combinatoires (Montréal: Les Presses de l'Université de Montréal), 1976. 106pp.
  11. Donald E. Knuth, Axioms and Hulls (Heidelberg: Springer-Verlag—Lecture Notes in Computer Science, no. 606), 1992. ix+109pp. ISBN 3-540-55611-7

See also[]

References[]

  1. ^ a b "Professor Donald Knuth ForMemRS". London: Royal Society. Archived from the original on November 17, 2015.
  2. ^ a b c Donald Knuth at the Mathematics Genealogy Project
  3. ^ a b c d Knuth, Donald Ervin. "Frequently Asked Questions". Home page. Stanford University. Archived from the original on August 3, 2019. Retrieved November 2, 2010.
  4. ^ a b "A.M. Turing Award; Donald ("Don") Erwin Knuth". ACM. 1974. Archived from the original on October 17, 2019. Retrieved January 6, 2020.
  5. ^ Karp, Richard M. (February 1986). "Combinatorics, Complexity, and Randomness". Communications of the ACM. 29 (2): 98–109. doi:10.1145/5657.5658.
  6. ^ O'Connor, John J.; Robertson, Edmund F. (October 2015), "Donald Knuth", MacTutor History of Mathematics archive, University of St Andrews, retrieved July 2, 2021
  7. ^ a b Feigenbaum, Edward (2007). "Oral History of Donald Knuth" (PDF). Computer History Museum. Computer History Museum. Retrieved September 17, 2020.
  8. ^ Molly Knight Raskin (2013). No Better Time: The Brief, Remarkable Life of Danny Lewin--the Genius who Transformed the Internet. Da Capo Press, Incorporated. pp. 61–62. ISBN 978-0-306-82166-0.
  9. ^ Shasha, Dennis Elliott; Lazere, Cathy A (1998). Out of their minds: the lives and discoveries of 15 great computer scientists. Springer. p. 90. ISBN 978-0-387-98269-4.
  10. ^ a b "Donald E. Knuth". Encyclopedia.com. Encyclopedia.com. Retrieved September 17, 2020.
  11. ^ a b c Koshy, Thomas (2004). Discrete mathematics with applications. Academic Press. p. 244. ISBN 978-0-12-421180-3. Archived from the original on November 12, 2012. Retrieved July 30, 2011.
  12. ^ Lyons, Keith (September 25, 2018). "Donald Knuth, basketball and computers in sport". Clyde Street Archive. Archived from the original on August 16, 2019. Retrieved August 16, 2019.
  13. ^ "Beta Nu of Theta Chi, History of Beta Nu Chapter". CWRU. Archived from the original on September 4, 2016. Retrieved April 15, 2019.
  14. ^ "Beta Nu, Theta Chi". Theta Chi. Archived from the original on December 21, 2019. Retrieved December 21, 2019.
  15. ^ Knuth, Donald Ervin (1963). "Finite Semifields and Projective Planes" (PDF). CaltechPhD dissertationCS1 maint: postscript (link)
  16. ^ a b Knuth, Donald Ervin. "Curriculum vitae". Stanford University. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  17. ^ a b Knuth, Donald Ervin (August 3, 2019). "The Art of Computer Programming (TAOCP)". Archived from the original on August 3, 2019. Retrieved February 6, 2018.
  18. ^ a b D'Agostino, Susan (April 16, 2020). "The Computer Scientist Who Can't Stop Telling Stories". Quanta Magazine. Retrieved April 19, 2020.
  19. ^ "Department Timeline | Stanford Computer Science". cs.stanford.edu. Archived from the original on February 17, 2020. Retrieved July 19, 2019.
  20. ^ Knuth, Donald Ervin. "Home page". Stanford University. Archived from the original on November 27, 2019. Retrieved March 16, 2005.
  21. ^ "Donald Knuth". Profiles. Stanford University. Archived from the original on June 12, 2016. Retrieved August 24, 2020.
  22. ^ "BBVA Foundation Frontiers of Knowledge Awards". Archived from the original on August 19, 2016. Retrieved October 15, 2016.
  23. ^ "Datahistorien ved Universitetet i Oslo - Institutt for informatikk 1977 - 1997". University of Oslo. 1997. Retrieved April 29, 2021.
  24. ^ a b Knuth, Donald Ervin. "Surreal numbers". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  25. ^ Zeilberg. "DEK". Rutgers. Archived from the original on August 28, 2017. Retrieved March 26, 2020.
  26. ^ "The Linguist List -- Journal Page". linguistlist.org. Archived from the original on September 10, 2019. Retrieved July 19, 2019.
  27. ^ Madachy, Joseph S.,Mathematics on Vacation, Thomas Nelson & Sons Ltd. 1966
  28. ^ "Videos about Numbers and Stuff". Numberphile. Archived from the original on November 4, 2018. Retrieved August 16, 2019.
  29. ^ Numberphile (June 27, 2016), Surreal Numbers (writing the first book) - Numberphile, archived from the original on December 11, 2021, retrieved July 19, 2019
  30. ^ Computerphile (August 21, 2015), Why Don Knuth Doesn't Use Email - Computerphile, archived from the original on July 11, 2018, retrieved July 19, 2019
  31. ^ Platoni 2006.
  32. ^ Knuth, Donald Ervin (1991). 3:16 : Bible texts illuminated. Madison, WI: A-R Eds. ISBN 978-0-89579-252-5.
  33. ^ "All Questions Answered" (PDF). Notices (article). March 2002. Archived (PDF) from the original on April 30, 2019. Retrieved March 26, 2020.
  34. ^ Knuth, Donald Ervin. "Against software patents" (PDF). Archived from the original (PDF) on September 24, 2015. Retrieved February 1, 2020LetterCS1 maint: postscript (link) to the patent offices in the USA and Europe.
  35. ^ "Professor Donald Knuth". Magdalen College. Archived from the original on January 4, 2011. Retrieved December 6, 2010.
  36. ^ "Notices". Oxford University Gazette. October 30, 2014. Archived from the original on May 15, 2015. Retrieved May 21, 2015.
  37. ^ Knuth, Donald Erwin (1997). "Digital Typography (Kyoto Prize Lecture, 1996)" (PDF). Archived from the original (PDF) on January 27, 2018.
  38. ^ Knuth, Donald Erwin (1984). "Literate Programming" (PDF). Archived from the original (PDF) on August 19, 2019. Retrieved March 26, 2020.
  39. ^ "Knuth: Computers and Typesetting". www-cs-faculty.stanford.edu. Archived from the original on April 11, 2019. Retrieved July 19, 2019.
  40. ^ de Groot, Martin (November 3, 2018). "Arts and Culture: A polymath brings his genius to bear on a multimedia work for pipe organ". Waterloo Region Record.
  41. ^ O'Connor, J. J.; Robertson, E. F. (2015). "Donald Ervin Knuth". University of St Andrews. Archived from the original on October 5, 2017. Retrieved October 20, 2017.
  42. ^ Reutenauer, Arthur. "A brief history of TeX, volume II". TUGboat: 68–72. ISSN 0896-3207.
  43. ^ a b Knuth, Donald Ervin (1980). 计算机程序设计技巧 (Ji suan ji cheng xu she ji ji qiao) [The Art of Computer Programming]. Translated by Guan, JiWen; Su, Yunlin. Beijing: Defense Industry Publishing Co. 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.
  44. ^ "Donald Knuth: 85 – Coping with cancer". Web of Stories. April 2006. Retrieved February 4, 2021.
  45. ^ "Rewriting the Bible in 0s and 1s". Technology Review. Archived from the original on February 16, 2013.
  46. ^ Knuth, Donald Ervin (June 1957). "The Potrzebie System of Weights & Measures". Mad Magazine. No. 33. Archived from the original on November 6, 2018. Retrieved March 26, 2020.
  47. ^ Kidder, Tracy (2016). A Truck Full of Money. Random House. p. 68. ISBN 9780812995244.
  48. ^ Don Knuth (2010). "TUG". Zeeba TV. Archived from the original on March 25, 2016. Retrieved March 26, 2020conferenceCS1 maint: postscript (link)
  49. ^ Knuth, Donald Ervin, An Earth‐shaking announcement, Zeeba TVvideo recordingCS1 maint: postscript (link)
  50. ^ Knuth, Donald Ervin (2010). "An Earthshaking Announcement" (PDF). TUGboat. 31 (2): 121–24. ISSN 0896-3207. Archived (PDF) from the original on April 13, 2019. Retrieved March 26, 2020.
  51. ^ a b c d e f g Walden, David. "Donald (‘Don’) Ervin Knuth" Archived October 17, 2019, at the Wayback Machine, . Retrieved on 27 October 2019.
  52. ^ Anon (2016). "Roll of Distinguished Fellows". British Computer Society. Archived from the original on March 4, 2016. Retrieved September 10, 2014.
  53. ^ "Fellows". Siam. 2009. Archived from the original on April 21, 2019. Retrieved March 26, 2020.
  54. ^ "Gruppe 1: Matematiske fag" (in Norwegian). Norwegian Academy of Science and Letters. Archived from the original on November 10, 2013. Retrieved October 7, 2010.
  55. ^ List of Fellows of the American Mathematical Society Archived September 6, 2019, at the Wayback Machine, retrieved 2013-01-27.
  56. ^ "APS Member History". search.amphilsoc.org. Retrieved March 19, 2021.
  57. ^ Knuth, D. E. (1974). "Computer science and its relation to mathematics". Amer. Math. Monthly. 81 (4): 323–343. doi:10.2307/2318994. JSTOR 2318994. Archived from the original on February 20, 2019. Retrieved March 26, 2020.
  58. ^ Knuth, D. E. (1992). "Two notes on notation". Amer. Math. Monthly. 99 (5): 403–422. arXiv:math/9205211. Bibcode:1992math......5211K. doi:10.2307/2325085. JSTOR 2325085. S2CID 119584305. Archived from the original on February 20, 2019. Retrieved March 26, 2020.
  59. ^ "American Mathematical Society". Archived from the original on October 7, 2016. Retrieved October 15, 2016.
  60. ^ Knuth, Donald E. (1979). "Mathematical typography". Bull. Amer. Math. Soc. (N.S.). 1 (2): 337–372. doi:10.1090/s0273-0979-1979-14598-1. MR 0520078. Archived from the original on September 24, 2017. Retrieved March 26, 2020.
  61. ^ "The President's National Medal of Science: Recipient Details - NSF - National Science Foundation". www.nsf.gov. Archived from the original on November 23, 2018. Retrieved March 26, 2020.
  62. ^ "Golden Plate Awardees of the American Academy of Achievement". www.achievement.org. American Academy of Achievement.
  63. ^ "Harvey". IL: Technion. 1995. Archived from the original on July 21, 2011.
  64. ^ "Donald Knuth: 1998 Fellow". Computer History Museum. 2015. Archived from the original on March 13, 2018. Retrieved March 12, 2018.
  65. ^ "21656 Knuth (1999 PX1)". Minor Planet Center. Archived from the original on May 8, 2016. Retrieved February 23, 2019.
  66. ^ "MPC/MPO/MPS Archive". Minor Planet Center. Archived from the original on March 5, 2019. Retrieved February 23, 2019.
  67. ^ "Katayanagi". CMU. Archived from the original on June 15, 2019. Retrieved January 6, 2020.
  68. ^ Galardonados (2010). "Fronteras" (in Spanish). ES: FBBVA. Archived from the original on August 19, 2016.
  69. ^ Myers, Andrew (June 1, 2001). "Stanford's Don Knuth, a pioneering hero of computer programming". Stanford Report. Archived from the original on June 23, 2011. Retrieved June 27, 2011.
  70. ^ Knuth, Donald Ervin. "Books". Home page (list). Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  71. ^ Knuth, Donald Ervin. "Literate Programming". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  72. ^ Knuth, Donald Ervin. "Selected Papers on Computer Science". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  73. ^ Knuth, Donald Ervin (1983). "Digital Typography". Scientific American. 249 (2): 106–119. Bibcode:1983SciAm.249b.106B. doi:10.1038/scientificamerican0883-106. Archived from the original on May 5, 2019. Retrieved March 26, 2020.
  74. ^ Knuth, Donald Ervin. "Selected Papers on Analysis of Algorithms". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  75. ^ Knuth, Donald Ervin. "Selected Papers on Computer Languages". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  76. ^ Knuth, Donald Ervin. "Selected Papers on Discrete Mathematics". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  77. ^ Knuth, Donald Ervin. "Selected Papers on Design of Algorithms". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  78. ^ Knuth, Donald Ervin. "Selected Papers on Fun and Games". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.
  79. ^ Knuth, Donald Ervin. "Companion to the Papers of Donald Knuth"]". Home page. Archived from the original on August 3, 2019. Retrieved March 26, 2020.

Bibliography[]

External links[]

Retrieved from ""