Hacker News Comments on
Stanford Lecture: Donald Knuth—"(3/2)-ary Trees" (2014)
stanfordonline
·
Youtube
·
131
HN points
·
1
HN comments
- This course is unranked · view top recommended courses
Hacker News Stories and Comments
All the comments and stories posted to Hacker News that reference this video.You might also like Knuth's (3/2)-ary Trees: https://www.youtube.com/watch?v=P4AaGQIo0HY
⬐ hacknatLove this man.⬐ tcarey83I think I might be stupid. I did not understand any of that. Am I missings something?⬐ ecesenaI'm just at minute 15 for now, however I can recommend you this link [1] to start with binary trees. The picture also explains why the coefficient of z^3 is 5.⬐ brudgersKnuth tries to inspire anyone who doesn't settle for muttering "Oh well, maybe I can find a video of a squirrel on water skis". And his material is challenging enough that eventually everyone faces the question:What am I going to do about it?
⬐ taericI know I'm stupid in this regard.My largest takeaway was just the joy of looking at the results of mathematical constructs for patterns. Not just symbolically manipulating expressions, but also simply listing the results and seeing what could be found.
That is, many of the techniques he showed involved simply recognizing patterns in output. Then, exploring the equations symbolically to see if he could explain these ideas.
Though, again, limited intelligence on my end. :)
⬐ deckar01You probably just need a few prerequisites. Even if you did study data structures, algorithms, and combinatorics previously, you would need to have your head wrapped around the subjects to fully understand this lecture.I would also keep in mind that Donald Knuth probably spent more than an hour before understanding the topic.
Something that I think anyone can take away from this lecture is a story of discovering new mathematical relationships. He starts with a function that correlates to a logical problem, changes the inputs in an new (strange) way, then studies the output to form a theory that connects to the original problem.
The key was recognizing old results in a new problem.
⬐ brudgersI would also keep in mind that Donald Knuth probably spent more than......fifty years writing a 1comprehensive 12 chapter book on compilers. The reason: things like this are relevant to its scope
⬐ cowsandmilk> Something that I think anyone can take away from this lecture is a story of discovering new mathematical relationships. He starts with a function that correlates to a logical problem, changes the inputs in an new (strange) way, then studies the output to form a theory that connects to the original problem.This type of mathematical exploration seems to be the story of his life. See Quarter-imaginary base for him doing the same thing in high school.
⬐ jdnierAt one point in the video he suggests (with a laugh) the name imagin-ary to go along with binary, ternary, n-ary, etc.