claim
active
claim:forcing-complex-solutions-to-simple-problems-indicates-a-language-has-chosen-the-wrong-abstraction-level-for-its-primitivesForcing complex solutions to simple problems indicates a language has chosen the wrong abstraction level for its primitives.
General principle illustrated by the dining philosophers comparison.
Source paper
extracted_from(1989) · Carriero, Nicholas · Gelernter, David
Neighborhood — ranked by edge-count
Findings (1)
finding
- Quantitative observation used to support the claim that Parlog solution is complex.
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.
- Parlog's merge process for client-server is unnecessarily complex; Linda's tuple operations remain flexible across problem variants.
- Critique that Parlog's abstraction level is too high and restrictive.
- Articulates why a one-layer transformer with MLP is the appropriate starting target for mechanistic interpretability
- Simplicity as depth has been replaced by a mechanical idea of simplicity as the geometrically banal.claim0.755Alexander critiques modern architecture's misunderstanding of simplicity.
- From Turner (1982), cited to represent the functional programming community's view and then refuted.
- A programming language is low level when its programs require attention to the irrelevant.concept0.752Epigraph by Alan Perlis motivating the search for abstract conceptual models in Fruit's design philosophy.
- CIMC's distinctive position distinguishing itself from eliminativist and deflationary responses to the Hard Problem