Elena & Fabrice's Web
m |
(My question to Donald Knuth) |
||
| (10 intermediate revisions by 2 users not shown) | |||
| Line 5: | Line 5: | ||
'''Donald E. Knuth''' ([[Image:gaoduhnah.gif]]), Professor Emeritus of [http://www-cs-faculty.stanford.edu/~uno/taocp.html The Art of Computer Programming] at [http://www.stanford.edu/ Stanford University]. | '''Donald E. Knuth''' ([[Image:gaoduhnah.gif]]), Professor Emeritus of [http://www-cs-faculty.stanford.edu/~uno/taocp.html The Art of Computer Programming] at [http://www.stanford.edu/ Stanford University]. | ||
| − | Father of The Art of Computer Programming and {{TeX}} as two achievements only in a myriad (including MMIX for TAOCP or METAFONT for {{TeX}}), a purist, a craftsman of the intellect, a | + | Father of The Art of Computer Programming and {{TeX}} as two achievements only in a myriad (including MMIX for TAOCP or METAFONT for {{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" [http://www.softpanorama.org/People/Knuth/index.shtml]. |
| − | + | {{pet}}I met him for the first time on {{thisday|26|May|2009}}, in Oxford, at the occasion of a seminar he was giving (on priority sampling). He signed my volume 2 of TAOCP. I also met him remotely this time on {{thisday|1|March|2023}} for an "All Questions Answered" session and had the chance to [https://www.youtube.com/watch?v=wXHkMGsZQYw&t=4378s&ab_channel=SWITTEC ask him] about his distance from quantum computation. His response that because it has "computation" in it does not mean that it is accessible to him, that he will not going to stop trying but will not give it a lot of time, suggests that he simply regards it as beyond his scope. | |
== His favourites == | == His favourites == | ||
| Line 14: | Line 14: | ||
---- | ---- | ||
| − | + | {{multicol}} | |
* What is your programming language of choice? | * What is your programming language of choice? | ||
: CWEB | : CWEB | ||
| Line 29: | Line 29: | ||
* What sports do you enjoy? | * What sports do you enjoy? | ||
: BASEBALL | : BASEBALL | ||
| + | {{multicol-break}} | ||
* What kind of car do you drive? | * What kind of car do you drive? | ||
: VOLVO | : VOLVO | ||
| Line 41: | Line 42: | ||
* What is your favorite food? | * What is your favorite food? | ||
: CHOCOLATE | : CHOCOLATE | ||
| + | {{multicol-end}} | ||
---- | ---- | ||
| − | I've | + | {{pet}} I've watched [http://www.imdb.com/title/tt0075223/ Silver Streak]. It's a strange movie to have as a favorite, but it's certainly worth an evening. |
| + | |||
| + | == P=NP == | ||
| + | |||
| + | An interesting footnote in volume 4's pre-fascicle 6A: | ||
| + | |||
| + | <center><wz tip="Existence is different from embodiment.">[[File:knuth-footnotePNP.jpg|link=]]</wz></center> | ||
| + | |||
| + | and then again in [https://www-cs-faculty.stanford.edu/~knuth/bhaavanaa280.txt] (32): | ||
| + | {{quote|text=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.}} | ||
== Links == | == Links == | ||
| − | * http://www-cs-faculty.stanford.edu/~uno | + | * [http://www-cs-faculty.stanford.edu/~uno Homepage]. |
| + | * [https://twitter.com/realDonaldKnuth @realDonaldKnuth] with one post so far. | ||
* [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 === | ||
Latest revision as of 20:54, 1 March 2023
Contents |
Donald Knuth
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 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. I also met him remotely this time on 1 March (2023) for an "All Questions Answered" session and had the chance to ask him about his distance from quantum computation. His response that because it has "computation" in it does not mean that it is accessible to him, that he will not going to stop trying but will not give it a lot of time, suggests that he simply regards it as beyond his scope.
His favourites
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.
P=NP
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.
Links
- Homepage.
- @realDonaldKnuth with one post so far.
- Love at First Byte.
- Oral history interview.
- The Dawn of Rigour in the Art of Programming.
Funny
- A funny satire (acid).
- A funny commemoration (nice).
- xkcd.com/163, 342 and 816.