Hacker Times
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
microtherion
on March 2, 2011
|
parent
|
context
|
favorite
| on:
Edsger W.Dijkstra - How do we tell truths that mig...
The difference being that, once you set aside Dijkstra's glib aphorisms, there may not BE a 1940 to talk about.
xiongchiamiov
on March 3, 2011
|
next
[–]
Dijkstra's algorithm? Postfix notation? A slew of other algorithmic things I don't even understand?
philwelch
on March 3, 2011
|
prev
[–]
You're talking about the inventor of the shortest-path algorithm and the semaphore.
microtherion
on March 6, 2011
|
parent
[–]
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()).
Consider applying for YC's Summer 2026 batch! Applications are open till May 4
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
