29 Sep
2024
29 Sep
'24
8:18 a.m.
It might amuse you, or maybe you don't care, but when I was a grad student
I gave my Pascal students the traveling saleman problem. I told them how
hard it was (NP-hard) and said if you can find a solution that works in
polynomial time, I'll dedicate my life to you to get you a Nobel Prize.
I was too green to know about Turing awards.
I had a math guy in the class who called me up, land lines, at 3am on a
Sunday morning (Saturday night so he was working on this instead of going
out to have fun). Screamed at me that he had it. He didn't.
Still fun to get the kids thinking. Seems like Kernighan and Lin thought
harder.
On Sun, Sep 29, 2024 at 11:30:42AM +1000, Rob Pike wrote:
I didn't realize Kernighan and Lin was CSTR
number 1. Cool. That's an
important paper.
-rob
On Sun, Sep 29, 2024 at 9:38???AM Warren Toomey via TUHS <tuhs(a)tuhs.org>
wrote:
> All, I got this e-mail and thought many of you would appreciate the link.
>
> Cheers, Warren
>
> ----- Forwarded message from Poul-Henning Kamp -----
>
> I stumbled over this:
>
> https://www.telecomarchive.com/lettermemo.html
>
> is the TUHS crew aware of that resource ?
>
> ----- End forwarded message -----
>
--
---
Larry McVoy Retired to fishing http://www.mcvoy.com/lm/boat