Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

This is why I keep coming back to HN. You read an interesting article, a little proud you understand half of it, read a question that already makes you feel like the stupidest person in the room, then read a clarifying answer by someone who probably got a Knuth reward check for correcting an errata in the art of computer programming.


Knuth judged that it wasn't an erratum, since the bound he included was correct and he never claimed it was optimal. :-/


Did he decide to include your better bound in future editions?


Yes. I believe proving the strict bound is one of the exercises now.


Thanks, not often we see Knuth erratas. :)


<pedant>You never see "erratas", since "errata" is already the plural (of "erratum").</pedant>


The ensemble of errata of multiple books are erratas… probably.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: