I attended this on Thursday. Knuth started with a problem about rectangles inside rectangles (https://imgur.com/faWRt2q — it's going to be an exercise in 188.8.131.52 of TAOCP when that's published, currently in the draft version of Pre-Fascicle 5C). He worked through some small cases, made a conjecture, showed a problem submitted to the Monthly, and lots of cool stuff with generating functions. The lecture was also peppered with jokes and cool stories, including a fascinating conjecture by Bill Gosper, who has a long history of coming up with these Ramanujan-like identities. He also showed a wonderful conjecture (involving queens on an infinite chessboard) that he thinks may never be proved, and showed a snippet of his CWEB program for the problem.
Knuth is turning 80 in about a month, and his talks seem to get better every year. (Though last year's lecture (https://www.youtube.com/watch?v=DjZB9HvddQk) on Hamiltonian Paths in Antiquity, which among other things covers Sanskrit poems that satisfy a “knight's tour” constraint, holds a special place in my heart — been planning to elaborate on it.)
Another important thing to mention is that Knuth has a great sense of humor.
Jealous of those that attended. Glad to see the recordings are easy to reach. I didn't realize they were in YouTube. So, I encourage everyone to see the article I missed, since it looks there.
To see Knuth work methodically through this seemingly trivial problem and get something out of it was enlightening.
> You know, people think that mathematicians have been working for hundreds of years and now there's tens of thousands or hundreds of thousands of mathematicians all spending every day working on problems so how could you possibly still find a simple down-to-earth problem that hasn't already been studied, you know, way too much? And the answer is: those problems aren't rare at all, they keep coming up several times a year, and this is an example where even this very basic problem of rectangle into rectangles has all kinds of, sort of, stones not yet turned.
And the other thing you mentioned is one of the reasons it's always a pleasure for me to see Knuth's talks or read his work — he is one of the mathematicians (like Euler and unlike Gauss) who make it seem simple: we get the impression that we could do it too, if we spent enough time on it, that things are within reach for us, just barely. This is so inspiring. And then of course when you step back and look at his body of work, it's staggering! (Something like this talk may account for about half a page of Knuth's published output, and he has thousands of them…) That's additionally inspiring.
I agree with what others have said. I think he just has 50 things going through his mind at any one moment, and the part of his brain that is controlling his speech just isn't always sure which of those 50 things it should be sharing at that moment.
I think any of us would be fortunate to be half as brilliant as he is. And the best part is, it is so obvious that he is one of the most humble and likeable people on the planet. Always generous, patient, and never arrogant. I personally would travel a great distance just to have lunch with the man, if ever given the opportunity.
A prime example in this video is the person who keeps interrupting him to tell him he had missed a line in his diagram. To be honest, my first reaction (after the guy had repeated it for like the 4th time or something) I was a little perturbed, and wished the guy would just shut up and let Don continue. But what was Don's reaction? After he finally understood what the guy was saying, he saw the error, corrected his mistake, and thanked the guy for "saving him 20 minutes".
Thank you Don Knuth! Not only are you brilliant, humble, hard-working and kind, you are a gentleman's gentleman, and the the world needs more men like you!
We're trained to absorb ideas at the pace of film and TV, which are super tightly scripted and edited. By comparison, regular speech has the density of a feather. Thank goodness for that ability to adjust the speed!
I just wish the algorithms used to speed up playback on Youtube, in browsers, etc were given a little more love. They sound really poor compared to the time stretching available in professional audio tools (or even something like Overcast). It's not even a quality vs perf tradeoff — high quality granular resynthesis is pretty darn cheap, computationally. Alas, I often need to listen strictly at 2x, since the artifacts from non-integer multiples are too distracting to me. Too bad speed adjustment is such a niche feature.
How do you pronounce your last name?
I believe at some point I heard someone pronounce it correctly in a video lecture, and I thought the same thing "surely that can't be the correct pronunciation". Alas I did some searching and found the FAQ on his Stanford page and was proven wrong.
- You may have misinterpreted the talk. There's already a proof (even for the closed form of the leading coefficient), by someone (I have the name written down somewhere but it's in the video). You might enjoy submitting a solution to the AMM problem instead (which only asks for the rate of growth, but if you have a fuller proof I'm sure that's good).