Donald Knuth

Edit 0 57 …
Home * People * Donald Knuth
don.gif
Donald Ervin Knuth,
a renowned computer scientist, mathematician, writer, scholar, and Professor Emeritus at Stanford University, California, United States [1]. He is the author of the multi-volume work The Art of Computer Programming, and been called the "father" of the analysis of algorithms - in 1975 he analyzed Alpha-Beta along with Ronald W. Moore, first formulating its Node Types [2]. Beside his fundamental contributions to several branches of computer science and mathematics, Knuth is the creator of the TeX computer typesetting system.
Donald Knuth [3]

Quotes

McCarthy

Quote by John McCarthy from Human-Level AI is harder than it seemed in 1955 [4]:
Chess programs catch some of the human chess playing abilities but rely on the limited effective branching of the chess move tree. The ideas that work for chess are inadequate for go. Alpha-beta pruning characterizes human play, but it wasn't noticed by early chess programmers - Turing, Shannon, Pasta and Ulam, and Bernstein. We humans are not very good at identifying the heuristics we ourselves use. Approximations to alpha-beta used by Samuel, Newell and Simon, McCarthy. Proved equivalent to minimax by Hart and Levin, independently by Brudno. Knuth gives details.

Knuth

Selected quotes by Donald Knuth [5]
  • A mathematical formula should never be "owned" by anybody! Mathematics belong to God. [6]
  • Beware of bugs in the above code; I have only proved it correct, not tried it. [7]
  • We should forget about small efficiencies, say about 97% of the time: premature optimization is the root of all evil. [8]

Alpha-Beta

Alpha-Beta F2 and Iterative Solution [9]

See also


Selected Publications

[10][11]

1960 ...

  • Donald Knuth (1960). An Imaginary Number System. Communications of the ACM, Vol. 3, No. 4
  • Donald Knuth (1962). The calculation of Easter. Communications of the ACM, Vol. 5, No. 4
  • Donald Knuth (1964). backus normal form vs. Backus Naur form. Communications of the ACM, Vol. 7, No. 12 [12]
  • Donald Knuth (1968 ...). The Art of Computer Programming (TAOCP) [13]
    Volume 1 - Fundamental Algorithms (1968)
    Volume 2 - Seminumerical Algorithms (1969)
    Volume 3 - Sorting and Searching (1973)
    Volume 4A - Combinatorial Algorithms, Part 1 (2011)
    • New material for Volume 4 will first appear in beta-test form as fascicles
    • Volume 4 Fascicle 0, Introduction to Combinatorial Algorithms and Boolean Functions (2008)
    • Volume 4 Fascicle 1, Bitwise Tricks & Techniques; Binary Decision Diagrams (2009)
    • Volume 4 Fascicle 2, Generating All Tuples and Permutations (2005)
    • Volume 4 Fascicle 3, Generating All Combinations and Partitions (2005)
    • Volume 4 Fascicle 4, Generating All Trees; History of Combinatorial Generation (2006)
    Volume 5 - Syntactic Algorithms, planned (estimated in 2020).

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...


External Links

Donald Knuth

Ershov Archive

Interviews

Topics

Videos


References

  1. ^ Computer Musings by Professor Donald E. Knuth | Stanford University Online
  2. ^ Donald Knuth, Ronald W. Moore (1975). An analysis of alpha-beta pruning. Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000). Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-3
  3. ^ Don Knuth's Home Page
  4. ^ John McCarthy Human-Level AI is harder than it seemed in 1955
  5. ^ Donald Knuth - Wikiquote
  6. ^ Donald Knuth (1999). Digital Typography. CSLI lecture notes series 78
  7. ^ Knuth: Frequently Asked Questions - What's the exact citation of your oft-cited comment about bugs?
  8. ^ Donald Knuth (1974). Structured Programming with go to Statements. ACM Computing Surveys, Vol. 6, No. 4, pdf
  9. ^ Donald Knuth, Ronald W. Moore (1975). An Analysis of Alpha-Beta Pruning. Artificial Intelligence, Vol. 6, No. 4, pp 293–326. Reprinted in Donald Knuth (2000). Selected Papers on Analysis of Algorithms. CSLI lecture notes series 102, ISBN 1-57586-212-3, pdf
  10. ^ Preprints of Recent Papers including dancing links
  11. ^ dblp: Donald E. Knuth
  12. ^ Backus–Naur Form from Wikipedia
  13. ^ The Art of Computer Programming from Wikipedia
  14. ^ Re: Perft(15) estimate after averaging 800 MC samples by Daniel Shawul, CCC, November 21, 2013 » Perft
  15. ^ Surreal number from Wikipedia
  16. ^ John H. Conway (1976). On Numbers and Games. Academic Press
  17. ^ Knuth–Morris–Pratt algorithm from Wikipedia
  18. ^ TeX from Wikipedia
  19. ^ Literate programming from Wikipedia

What links here?

Page Date Edited
More Links
ACM May 7, 2017
Alan Turing Feb 8, 2017
Algorithms May 5, 2017
Alpha-Beta Jan 28, 2018
Arts Nov 5, 2017
Backtracking Dec 16, 2017
Barbara Liskov Oct 30, 2014
Bill Gosper Aug 20, 2014
BitScan Sep 10, 2017
C Feb 19, 2018
David Eppstein Oct 10, 2013
Donald Knuth Aug 29, 2016
Flipping Mirroring and Rotating Oct 14, 2016
Games Feb 20, 2018
General Setwise Operations Feb 25, 2018
Hash Table Jan 1, 2018
Hashing Dictionaries Mar 1, 2014
Iteration May 5, 2017
Iterative Search Oct 20, 2016
John H. Conway Apr 6, 2017
Knuth Papers Jul 9, 2008
Kohei Noshita Aug 21, 2014
Languages Nov 26, 2017
Martin Gardner May 10, 2017
Mathematician Apr 9, 2018
Node Jul 20, 2015
Node Types Oct 22, 2017
Optimization Feb 28, 2018
People Feb 28, 2018
Population Count Sep 3, 2017
Programming Dec 16, 2017
Pseudorandom number generator May 11, 2017
Queue Apr 4, 2017
Quote McCarthy Sep 10, 2013
Recursion Nov 18, 2017
Richard K. Guy Jan 11, 2014
Search Feb 1, 2018
Search Tree Dec 23, 2016
Stack Nov 18, 2016
Stanford University Dec 7, 2017

Up one level