Back دونالد كينوث Arabic Donald Knuth AST Donald Knut AZ دانلد کنوت AZB Дональд Эрвін Кнут BE Доналд Кнут Bulgarian ডোনাল্ড কানুথ Bengali/Bangla Donald Knuth BS Donald Knuth Catalan Donald Ervin Knuth Czech
Donald Knuth | |
|---|---|
.jpg) Knuth in 2011 | |
| Born | Donald Ervin Knuth January 10, 1938 Milwaukee, Wisconsin, U.S. |
| Education | |
| Known for | |
| Spouse | Nancy Jill Carter |
| Children | 2 |
| Awards | See list
|
| Scientific career | |
| Fields | |
| Institutions | Stanford University University of Oslo |
| Thesis | Finite Semifields and Projective Planes (1963) |
| Doctoral advisor | Marshall Hall, Jr.[2] |
| Doctoral students | |
| Website | cs |
Donald Ervin Knuth (/kəˈnuːθ/[3] kə-NOOTH; 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, informally considered the Nobel Prize of computer science.[4] Knuth has been called the "father of the analysis of algorithms".[5]
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 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. He strongly opposes the granting of software patents, and has expressed his opinion to the United States Patent and Trademark Office and European Patent Organisation.
- ^ "Professor Donald Knuth ForMemRS". London: Royal Society. Archived from the original on November 17, 2015.
- ^ a b Donald Knuth at the Mathematics Genealogy Project
- ^ Cite error: The named reference
faqwas invoked but never defined (see the help page). - ^ Cite error: The named reference
Turing Awardwas invoked but never defined (see the help page). - ^ Karp, Richard M. (February 1986). "Combinatorics, Complexity, and Randomness". Communications of the ACM. 29 (2): 98–109. doi:10.1145/5657.5658.