Fua vs Hoe

Philosophy don’t make nest for sweet little pigeon.

Also, and, of course, Arie Theunissen:

Similar posts

Last updated 09/02/2012

This post pre-dates my organ-grinding days, and may be imported from elsewhere.

Dining philosophers problem (1): In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra as a student exam exercise, presented in terms of computers competing for access to tape drive peripherals.

Kaleboel (4307):


Your email address will not be published. Required fields are marked *