concept
active
concept:dining-philosophers-problemDining Philosophers Problem
A classic concurrency benchmark problem used to test expressivity of parallel programming primitives; second main example for Parlog-Linda comparison.
Neighborhood — ranked by edge-count
Papers (1)
paper
- Linda in contextcites
Thinkers (2)
thinker
- G. A. RingwoodstudiesAuthor of the Parlog86 article in Communications of the ACM used as the main comparison point for concurrent logic programming.
- Edsger W. Dijkstraassociated_withOriginator of the dining philosophers problem, used as a concurrency benchmark.
Frameworks (1)
framework
- ParlogaboutA concurrent logic language featured prominently in recent ACM literature; used as a primary comparison point for Linda.
Claims (1)
claim
- Critique that Parlog's abstraction level is too high and restrictive.
Concepts (2)
concept
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- From Ringwood (1988), used by Carriero and Gelernter to frame the importance of the dining philosophers example.
- The Parlog86 solution to dining philosophers consists of 70 lines of code as presented in Ringwood (1988).finding0.723Quantitative observation used to support the claim that Parlog solution is complex.
- The problem of determining who has a right to participate in a decision-making process; applied to whether AI systems should deliberate.
- The risk that any indicator merely correlated with consciousness can be artificially implemented without the system actually being conscious
- The difficulty that broad FEP formulations technically apply to rocks maintaining thermodynamic equilibrium; avoided by the present thesis
- Philosophical problem underlying sentience assessment: how to determine consciousness in beings unlike ourselves.
- Birth control, species protection, spiritual health, etc., as listed in the preamble.