Donald Knuth

From Wikipedia, the free encyclopedia

Jump to: navigation, search
Donald Ervin Knuth
Donald Knuth at a reception for the Open Content Alliance, October 25, 2005
Donald Knuth at a reception for the Open Content Alliance, October 25, 2005
Born January 10, 1938 (1938-01-10) (age 71)
Milwaukee, Wisconsin, U.S.
Residence U.S.
Nationality United States
Fields Computer science
Institutions Stanford University
Alma mater Case Institute of Technology
California Institute of Technology
Doctoral advisor Marshall Hall, Jr.
Doctoral students Leonidas J. Guibas
Scott Kim
Vaughan Pratt
Robert Sedgewick
Jeffrey Vitter
Bernard Marcel Mont-Reynaud
Known for The Art of Computer Programming
TeX, METAFONT
Knuth–Morris–Pratt algorithm
Knuth-Bendix completion algorithm
MMIX
Notable awards John von Neumann Medal (1995)
Turing Award (1974)
Kyoto Prize (1996)
Religious stance Lutheran

Donald Ervin Knuth (pronounced /knuːθ/[1]) (born January 10, 1938) is a renowned computer scientist and Professor Emeritus of the Art of Computer Programming[2] at Stanford University.

Author of the seminal multi-volume work The Art of Computer Programming ("TAOCP"),[3] Knuth has been called the "father" of the analysis of algorithms, contributing to the development of, and systematizing formal mathematical techniques for, the rigorous analysis of the computational complexity of algorithms, and in the process popularizing 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.

A prolific writer and scholar,[4] Knuth created the WEB/CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MMIX instruction set architecture.

Contents

[edit] Education and academic work

Knuth was born in Milwaukee, Wisconsin, where his father owned a small printing business and taught bookkeeping at Milwaukee Lutheran High School, which he attended. He was an excellent student, 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." This won him a television set for his school and a candy bar for everyone in his class.

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 then switched from physics to mathematics, and in 1960 he received his bachelor of science degree, simultaneously receiving his master of science degree by a special award of the faculty who considered his work outstanding. At Case, he managed the basketball team and applied his talents by constructing a formula for the value of each player. This novel approach was covered by Newsweek and by Walter Cronkite on the CBS television network.[5]

While doing graduate studies, Knuth worked as a consultant, writing compilers for different computers. In 1963, he earned a Ph.D. in mathematics (advisor: Marshall Hall) from the California Institute of Technology, where he became a professor and began work on The Art of Computer Programming, originally planned to be a single book, and then planned as a six, and then seven-volume series. In 1968, he published the first volume. That same year, he joined the faculty of Stanford University, having turned down a job offer from the National Security Agency (NSA).

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. 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 (esp. those which provided input to phototypesetters) that he took time out to work on typesetting and created the TeX and METAFONT tools.

In recognition of Knuth's contributions to the field of computer science, 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.

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. As of 2004, the first three volumes of his series have been re-issued, and Knuth is currently working on volume four, excerpts of which are released periodically on his website. Meanwhile, Knuth gives informal lectures a few times a year at Stanford University, which he calls Computer Musings. He is also a visiting professor at the Oxford University Computing Laboratory in the United Kingdom.

In addition to his writings on computer science, Knuth, a devout Lutheran,[6] is also the author of 3:16 Bible Texts Illuminated (1991), ISBN 0-89579-252-4, in which he attempts to examine the Bible by a process of stratified 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.

He is also the author of Surreal Numbers (1974) ISBN 0-201-03812-9, 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.

On January 1, 1990, Knuth announced to his colleagues that he would no longer have an e-mail address, so that he might concentrate on his work.[7]

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.[citation needed]

[edit] Awards

[edit] Knuth’s humor

Knuth is known for his "professional humor".

One of Knuth’s reward checks
  • 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”. (His bounty for errata in 3:16 Bible Texts Illuminated, is, however, $3.16). 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 such checks in 2008 due to bank fraud, and instead now gives each error finder a publicly listed balance in his fictitious "Bank of San Serriffe".[8][9]
  • Version numbers of his TeX software approach the transcendental number π, in that versions increment in the style 3, 3.1, 3.14. 3.141, and so on. Version numbers of Metafont approach the important number e similarly.
  • He once warned a correspondent, “Beware of bugs in the above code; I have only proved it correct, not tried it.”[1]
  • All appendices in the Computers and Typesetting series have titles that begin with the letter identifying the appendix.
  • TAOCP v3 (Second Edition) has the index entry “Royalties, use of, 407”. Page 407 has no explicit mention of royalties, but however does contain a diagram of an “organ-pipe arrangement” in Figure 2. Apparently the purchase of the pipe organ in his home was financed by royalties from TAOCP.[10] (In the first edition of the work, the relevant page is 405.)
  • 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" [ Aggregate functions or Aggregate (composite) ], 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.)” (Concrete and aggregates are important topics in civil engineering.)
  • 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 magazine #26, and named the fundamental unit of force “whatmeworry.” MAD magazine bought the article and published it in the #33, June 1957 issue.
  • Knuth's first “mathematical” article was a short paper submitted to a “science talent search” contest for high-school seniors in 1955, and published in 1960, in which he discussed number systems where the radix was negative. He further generalized this to number systems where the radix was a complex number. In particular, he defined the quater-imaginary base system, which uses the imaginary number 2i as the base, having the unusual feature that every complex number can be represented with the digits 0, 1, 2, and 3, without a sign.
  • Knuth’s article about the computational complexity of songs, "The Complexity of Songs", was reprinted twice in computer science journals.

[edit] Works

A short list of his works[11]:

  1. Volume 1: Fundamental Algorithms (3rd edition), 1997. Addison-Wesley Professional, ISBN 0-201-89683-4
  2. Volume 2: Seminumerical Algorithms (3rd Edition), 1997. Addison-Wesley Professional, ISBN 0-201-89684-2
  3. Volume 3: Sorting and Searching (2nd Edition), 1998. Addison-Wesley Professional, ISBN 0-201-89685-0
  4. Volume 4: Combinatorial Algorithms, in preparation
  • Donald E. Knuth, The Art of Computer Programming, fascicles:
  1. Volume 1, Fascicle 1: MMIX — A RISC Computer for the New Millennium, 2005. ISBN 0-201-85392-2
  2. Volume 4, Fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions. 2008. ISBN 0-321-53496-4
  3. Volume 4, Fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams. 2009. ISBN 0-321-58050-8
  4. Volume 4, Fascicle 2: Generating All Tuples and Permutations, 2005. ISBN 0-201-85393-0
  5. Volume 4, Fascicle 3: Generating All Combinations and Partitions, 2005. ISBN 0-201-85394-9
  6. Volume 4, Fascicle 4: Generating All Trees -- History of Combinatorial Generation, 2006. ISBN 0-321-33570-8
  1. Donald E. Knuth, Literate Programming (Center for the Study of Language and Information — Lecture Notes), 1992. ISBN 0-937073-80-6
  2. Donald E. Knuth, Selected Papers on Computer Science (Stanford, California: Center for the Study of Language and Information — CSLI Lecture Notes, no. 59), 1996. ISBN 1-881526-91-7
  3. Donald E. Knuth, Digital Typography (Stanford, California: Center for the Study of Language and Information — CSLI Lecture Notes, no. 78), 1999. ISBN 1-57586-010-4
  4. Donald E. Knuth, Selected Papers on Analysis of Algorithms (Stanford, California: Center for the Study of Language and Information — CSLI Lecture Notes, no. 102), 2000. ISBN 1-57586-212-3
  5. Donald E. Knuth, Selected Papers on Computer Languages (Stanford, California: Center for the Study of Language and Information — CSLI Lecture Notes, no. 139), 2003. ISBN 1-57586-381-2 (cloth), ISBN 1-57586-382-0 (paperback)
  6. Donald E. Knuth, Selected Papers on Discrete Mathematics (Stanford, California: Center for the Study of Language and Information — CSLI Lecture Notes, no. 106), 2003. ISBN 1-57586-249-2 (cloth), ISBN 1-57586-248-4 (paperback)
  7. Donald E. Knuth, Selected Papers on Design of Algorithms (publication planned after Vol 4 Fasc 1)
  8. Donald E. Knuth, Selected Papers on Fun and Games (publication planned after Vol 4 Fasc 1)

[edit] Interviews and lectures

 This article's external links may not follow Wikipedia's content policies or guidelines. Please improve this article by removing excessive or inappropriate external links.

[edit] See also

[edit] References

  1. ^ a b "Frequently Asked Questions" at Stanford site. Gives the pronunciation of his name as "Ka-NOOTH".
  2. ^ http://www-cs-faculty.stanford.edu/~knuth/.
  3. ^ http://www-cs-faculty.stanford.edu/~uno/taocp.html.
  4. ^ Knuth's CV
  5. ^ Kenneth H. Rosen, Discrete Mathematics and Its Applications 4th Ed., McGraw-Hill. 1999. p.82
  6. ^ Love at First Byte. Stanford Magazine, May/June 2006.
  7. ^ Knuth, Donald Knuth versus Email last changed on 2005-09-23, Retrieved on 2008-12-29.
  8. ^ “Rewriting the Bible in 0’s and 1’s” in the Technology Review of the Massachusetts Institute of Technology
  9. ^ Sparkes, Matthew (2008-10-31). "Knuth launches The Bank of San Serriffe" (html). PC Pro. http://www.pcpro.co.uk/blogs/2008/10/31/knuth-launches-the-bank-of-san-serriffe/. Retrieved on 2008-10-31. 
  10. ^ “Pipe Organ” at Stanford site
  11. ^ A complete list is also available: "Books" at Stanford site
  12. ^ "Selected Papers" at Stanford site

[edit] External links

Sister project Wikiquote has a collection of quotations related to: Donald Knuth


v • d • e
A. M. Turing Award laureates

Perlis (1966) · Wilkes (1967) · Hamming (1968) · Minsky (1969) · Wilkinson (1970) · McCarthy (1971) · Dijkstra (1972) · Bachman (1973) · Knuth (1974) · Newell / Simon (1975) · Rabin / Scott (1976) · Backus (1977) · Floyd (1978) · Iverson (1979) · Hoare (1980) · Codd (1981) · Cook (1982) · Thompson / Ritchie (1983) · Wirth (1984) · Karp (1985) · Hopcroft / Tarjan (1986) · Cocke (1987) · Sutherland (1988) · Kahan (1989) · Corbató (1990) · Milner (1991) · Lampson (1992) · Hartmanis / Stearns (1993) · Feigenbaum / Reddy (1994) · Blum (1995) · Pnueli (1996) · Engelbart (1997) · Gray (1998) · Brooks (1999) · Yao (2000) · Ole-Johan Dahl / Kristen Nygaard (2001) · Ron Rivest / Adi Shamir / Leonard Adleman (2002) · Alan Kay (2003) · Vint Cerf / Bob Kahn (2004) · Peter Naur (2005) · Frances E. Allen (2006) · Edmund M. Clarke / E. Allen Emerson / Joseph Sifakis (2007) · Barbara Liskov (2008)
v • d • e
National Medal of Science laureates
 
Mathematical, statistical, and computer sciences
1960s
1970s
1980s
1990s
2000s
Persondata
NAME Knuth, Donald Ervin
ALTERNATIVE NAMES
SHORT DESCRIPTION Computer science
DATE OF BIRTH January 10, 1938 (1938-01-10) (age 71)
PLACE OF BIRTH Milwaukee, Wisconsin, U.S.
DATE OF DEATH
PLACE OF DEATH
Retrieved from "http://en.wikipedia.org/wiki/Donald_Knuth"
Personal tools