Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese
Arabic Bulgarian Chinese Croatian Czech Danish Dutch English Estonian Finnish French German Greek Hebrew Hindi Hungarian Icelandic Indonesian Italian Japanese Korean Latvian Lithuanian Malagasy Norwegian Persian Polish Portuguese Romanian Russian Serbian Slovak Slovenian Spanish Swedish Thai Turkish Vietnamese

definition - Donald_Knuth

definition of Wikipedia

   Advertizing ▼


Donald Knuth

Donald Ervin Knuth

Donald Knuth at a reception for the Open Content Alliance, October 25, 2005
Born (1938-01-10) January 10, 1938 (age 74)
Milwaukee, Wisconsin, U.S.
Residence U.S.
Nationality American
Fields Mathematics
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
Michael Fredman
Scott Kim
Vaughan Pratt
Robert Sedgewick
Jeffrey Vitter
Andrei Broder
Known for The Art of Computer Programming
Knuth–Morris–Pratt algorithm
Knuth–Bendix completion algorithm
Notable awards Turing Award (1974)
John von Neumann Medal (1995)
Harvey Prize (1995)
Kyoto Prize (1996)

Donald Ervin Knuth (play /kəˈnθ/[1] kə-NOOTH; born January 10, 1938) is a computer scientist and Professor Emeritus at Stanford University.[2]

He is the author of the seminal multi-volume 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/CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures.


  Early life

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


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.[6] 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.[6] Knuth was one of the founding editors of the Engineering and Science Review which won a national award as best technical magazine in 1959.[7] 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.[6]

In 1963, he earned a Ph.D. in mathematics (advisor: Marshall Hall) from the California Institute of Technology,[8] and began to work there as associate professor and began work on The Art of Computer Programming. He had initially accepted a commission to write a book on compilers which would later become the multi-volume The Art of Computer Programming. This work was 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).[citation needed]


  The Art of Computer Programming (TAOCP)

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 2012, the first three volumes and part 1 of volume four of his series have been published.[9]

  Other works

He is also the author of Surreal Numbers,[10] 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.

  Religious beliefs and work

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

  Health concerns

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

  Computer Musings

Knuth gave 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 in the United Kingdom and an Honorary Fellow of Magdalen College.[14]


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".[15]
  • He once warned a correspondent, "Beware of bugs in the above code; I have only proved it correct, not tried it."[16]
  • 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 #26, and named the fundamental unit of force "whatmeworry." Mad published the article in issue #33 (June 1957).
  • 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, Knuth announced an XML-based 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.[17][18]


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 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.

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.[19] He is a member of the Norwegian Academy of Science and Letters.[20]

Honors bestowed on Knuth include:


A short list of his works:[25]

  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 4A: Combinatorial Algorithms, Part 1, 2011. Addison-Wesley Professional, ISBN 0-201-03804-8
  5. Volume 4: Combinatorial Algorithms (remainder), 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
  • Donald E. Knuth, Computers & Typesetting:[26]
  1. Volume A, The TeXbook (Reading, Massachusetts: Addison-Wesley, 1984), x+483pp. ISBN 0-201-13447-0
  2. Volume B, TeX: The Program (Reading, Massachusetts: Addison-Wesley, 1986), xviii+600pp. ISBN 0-201-13437-3
  3. Volume C, The METAFONTbook (Reading, Massachusetts: Addison-Wesley, 1986), xii+361pp. ISBN 0-201-13445-4
  4. Volume D, METAFONT: The Program (Reading, Massachusetts: Addison-Wesley, 1986), xviii+566pp. ISBN 0-201-13438-1
  5. Volume E, Computer Modern Typefaces (Reading, Massachusetts: Addison-Wesley, 1986), xvi+588pp.
  1. Donald E. Knuth, Literate Programming[28] (Stanford, California: Center for the Study of Language and Information — CSLI Lecture Notes, no. 27), 1992. ISBN 0-937073-80-6
  2. Donald E. Knuth, Selected Papers on Computer Science[29] (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[30] (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[31] (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[32] (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[33] (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[34] (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)
  8. Donald E. Knuth, Selected Papers on Fun and Games[35] (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)
  9. Donald E. Knuth, Companion to the Papers of Donald Knuth[36] (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)

  See also


  1. ^ Knuth, Don. "Knuth: Frequently Asked Questions". Don Knuth's home page. Stanford University. http://www-cs-faculty.stanford.edu/~knuth/faq.html. Retrieved 2010-11-02. "How do you pronounce your last name? Ka-NOOTH." 
  2. ^ Donald Knuth's Homepage at Stanford.
  3. ^ The Art of Computer Programming (Stanford University).
  4. ^ Knuth's CV
  5. ^ Dennis Elliott Shasha; Cathy A. Lazere (1998). Out of their minds: the lives and discoveries of 15 great computer scientists. Springer. p. 90. ISBN 978-0-387-98269-4. http://books.google.com/?id=-0tDZX3z-8UC&pg=PA90. 
  6. ^ a b c Thomas Koshy (2004). Discrete mathematics with applications. Academic Press. p. 244. ISBN 978-0-12-421180-3. http://books.google.com/books?id=90KApidK5NwC&pg=PA244. Retrieved 30 July 2011. 
  7. ^ History of Beta Nu Chapter
  8. ^ Finite Semifields and Projective Planes – Donald Knuth's Ph.D. dissertation
  9. ^ Knuth, Donald E.. "The Art of Computer Programming (TAOCP)". http://www-cs-faculty.stanford.edu/~knuth/taocp.html. Retrieved 2012-05-20. 
  10. ^ Knuth, Donald (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. 
  11. ^ Love at First Byte. Stanford Magazine, May/June 2006.
  12. ^ Knuth, Donald (1991). 3:16 : Bible texts illuminated. A-R Eds.. ISBN 978-0-89579-252-5. 
  13. ^ "Donald Knuth: 85 - Coping with cancer". Web of Stories. April 2006. http://www.webofstories.com/people/donald.knuth/85. Retrieved May 2, 2012. 
  14. ^ "Professor Donald Knuth". Magdalen College. http://www.magd.ox.ac.uk/whos-here/fellows-and-lecturers/fellows/knuthd. Retrieved 2010-12-06. 
  15. ^ "Rewriting the Bible in 0's and 1's" in the Technology Review of the Massachusetts Institute of Technology
  16. ^ Knuth, Don. "Knuth: Frequently Asked Questions". Don Knuth's home page. Stanford University. http://www-cs-faculty.stanford.edu/~knuth/faq.html. Retrieved 2010-11-02. 
  17. ^ A video recording, uploaded with Knuth's permission is available at River Valley TV
  18. ^ Knuth, Donald (2010). "An Earthshaking Announcement". TUGboat 31 (2): 121–124. ISSN 0896-3207  http://tug.org/TUGboat/tb31-2/tb98knut.pdf
  19. ^ http://fellows.siam.org/index.php?sort=year&value=2009
  20. ^ "Gruppe 1: Matematiske fag" (in Norwegian). Norwegian Academy of Science and Letters. http://www.dnva.no/c26849/artikkel/vis.html?tid=40116. Retrieved 7 October 2010. 
  21. ^ http://www.admin.technion.ac.il/harvey/1995-2.html
  22. ^ http://www.cs.cmu.edu/~katayanagi/
  23. ^ http://www.fbbva.es/TLFU/tlfu/ing/microsites/premios/fronteras/galardonados/2010/informacion.jsp
  24. ^ Andrew Myers (June 1, 2001). "Stanford's Don Knuth, a pioneering hero of computer programming". Stanford Report. http://news.stanford.edu/news/2011/june/knuth-engineering-hero-060111.html. Retrieved June 27, 2011. 
  25. ^ A complete list is also available: "Books" at Stanford site
  26. ^ A complete list is also available: "Books" at Stanford site
  27. ^ "Selected Papers" at Stanford site
  28. ^ "Literate Programming"
  29. ^ "Selected Papers on Computer Science"
  30. ^ "Digital Typography"
  31. ^ "Selected Papers on Analysis of Algorithms"
  32. ^ "Selected Papers on Computer Languages"
  33. ^ "Selected Papers on Discrete Mathematics"
  34. ^ "Selected Papers on Design of Algorithms"
  35. ^ "Selected Papers on Fun and Games"
  36. ^ "Companion to the Papers of Donald Knuth"

  External links



All translations of Donald_Knuth

sensagent's content

  • definitions
  • synonyms
  • antonyms
  • encyclopedia

Dictionary and translator for handheld

⇨ New : sensagent is now available on your handheld

   Advertising ▼

sensagent's office

Shortkey or widget. Free.

Windows Shortkey: sensagent. Free.

Vista Widget : sensagent. Free.

Webmaster Solution


A windows (pop-into) of information (full-content of Sensagent) triggered by double-clicking any word on your webpage. Give contextual explanation and translation from your sites !

Try here  or   get the code


With a SensagentBox, visitors to your site can access reliable information on over 5 million pages provided by Sensagent.com. Choose the design that fits your site.

Business solution

Improve your site content

Add new content to your site from Sensagent by XML.

Crawl products or adds

Get XML access to reach the best products.

Index images and define metadata

Get XML access to fix the meaning of your metadata.

Please, email us to describe your idea.


The English word games are:
○   Anagrams
○   Wildcard, crossword
○   Lettris
○   Boggle.


Lettris is a curious tetris-clone game where all the bricks have the same square shape but different content. Each square carries a letter. To make squares disappear and save space for other squares you have to assemble English words (left, right, up, down) from the falling squares.


Boggle gives you 3 minutes to find as many words (3 letters or more) as you can in a grid of 16 letters. You can also try the grid of 16 letters. Letters must be adjacent and longer words score better. See if you can get into the grid Hall of Fame !

English dictionary
Main references

Most English definitions are provided by WordNet .
English thesaurus is mainly derived from The Integral Dictionary (TID).
English Encyclopedia is licensed by Wikipedia (GNU).


The wordgames anagrams, crossword, Lettris and Boggle are provided by Memodata.
The web service Alexandria is granted from Memodata for the Ebay search.
The SensagentBox are offered by sensAgent.


Change the target language to find translations.
Tips: browse the semantic fields (see From ideas to words) in two languages to learn more.

last searches on the dictionary :

4361 online visitors

computed in 0.078s

   Advertising ▼

I would like to report:
section :
a spelling or a grammatical mistake
an offensive content(racist, pornographic, injurious, etc.)
a copyright violation
an error
a missing statement
please precise:



Company informations

My account



   Advertising ▼