m (→P=NP) |
m (→Links) |
||
Line 63: | Line 63: | ||
* [http://alumni.stanford.edu/get/page/magazine/article/?article_id=33888 Love at First Byte]. | * [http://alumni.stanford.edu/get/page/magazine/article/?article_id=33888 Love at First Byte]. | ||
* [http://conservancy.umn.edu/handle/107413 Oral history interview]. | * [http://conservancy.umn.edu/handle/107413 Oral history interview]. | ||
+ | * [http://bhavana.org.in/the-dawn-of-rigour-in-the-art-of-programming/ The Dawn of Rigour in the Art of Programming]. | ||
=== Funny === | === Funny === |
Contents |
Donald E. Knuth (), Professor Emeritus of The Art of Computer Programming at Stanford University.
Father of The Art of Computer Programming and $\mathrm{\TeX}$ as two achievements only in a myriad (including MMIX for TAOCP or METAFONT for $\mathrm{\TeX}$), a purist, a craftsman of the intellect, a literal computer scientist, supreme coder and a mind-bogglingly productive author, geekiness turned academic, he has been aptly nicknamed "the Euler of computer science" [1].
I met him for the first (and so far only) time on 26, May (2009), in Oxford, at the occasion of a seminar he was giving (on priority sampling). He signed my volume 2 of TAOCP.
Allegedly, according to geekchic (copied here for backup as the link occasionally went broken):
|
|
I've watched Silver Streak. It's a strange movie to have as a favorite, but it's certainly worth an evening.
An interesting footnote in volume 4's pre-fascicle 6A:
and then again in [2] (32):
No. I suspect that P=NP because a polytime algorithm might exist without being comprehensible (even more so than Super-K). Existence is far different from embodiment. Robertson and Seymour showed that polytime algorithms for some graph problems exist, yet are probably unknowable.