Dining philosophers problem

Metadata

• Slug: 00537-dining-philosophers-problem
• Type: THOUGHT_EXPERIMENT
• Tags: paradox
• Sources: 1

Axioms

• Assume the rules of the domain apply uniformly.
• Assume the observer’s criteria remain fixed.
• Assume classification boundaries stay consistent.
• Assume the model describes the real case.
• Assume repeated steps do not change the outcome.
• Assume no hidden variables are introduced midstream.

Contradictions

• Two reasonable lines of inference yield opposite conclusions
• A global rule conflicts with a local judgment
• A stable resolution appears to violate a starting premise
• Changing the framing reverses the outcome
• Intuition and formalism diverge at the same step

Prompts

• Which assumption is doing the most hidden work?
• What changes if you relax the smallest constraint?
• Does the paradox dissolve or relocate when reframed?
• What is conserved, and what is sacrificed?

Notes

Sources

• https://en.wikipedia.org/wiki/Dining_philosophers_problem

Overview

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.

Tension

• Two reasonable lines of inference yield opposite conclusions.
• A global rule conflicts with a local judgment.
• A stable resolution appears to violate a starting premise.
• Changing the framing reverses the outcome.
• Intuition and formalism diverge at the same step.

Why It Matters

This entry tests how a stable rule-set can yield unstable conclusions under certain assumptions.

Prompts

• Which assumption is doing the most hidden work?
• What changes if you relax the smallest constraint?
• Does the paradox dissolve or relocate when reframed?
• What is conserved, and what is sacrificed?