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

The difference being that, once you set aside Dijkstra's glib aphorisms, there may not BE a 1940 to talk about.


Dijkstra's algorithm? Postfix notation? A slew of other algorithmic things I don't even understand?


You're talking about the inventor of the shortest-path algorithm and the semaphore.


Obviously, mutual exclusion is widely used. I'm not so sure that semaphores as such are used as widely (and certainly not with functions named P() and V()).




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

Search: