Comment on The Art of Computer Programming by Donald E. KnuthparentComments−kps2moI think there's a proof that he can at best asymptotically approach volume 7.−wolfi12mobut what distraction could it be now? There seems to be nothing to be done for TeX−kps2moThe way I see it: Volume 7 is compilation. Since many optimization techniques are NP-complete, Knuth will have to take a break from writing TAOCP to settle whether or not P=NP.−flir2moThree months, tops.
Comments
I think there's a proof that he can at best asymptotically approach volume 7.
but what distraction could it be now? There seems to be nothing to be done for TeX
The way I see it: Volume 7 is compilation. Since many optimization techniques are NP-complete, Knuth will have to take a break from writing TAOCP to settle whether or not P=NP.
Three months, tops.