concept
active
concept:memo-triesMemo Tries
Data structure generalizing Pair and Stream via indexable containers; demonstrates denotational design on memo structures
Neighborhood — ranked by edge-count
Communities (1)
community
- Functional Reactive Programmingmembers_of
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.
- The central topic, treated as a dynamic, agential process rather than static storage.
- Ackley's concept of computing systems that dynamically compensate for indeterministic substrates, analogous to biological control structures
- Traditional parallel programming model requiring explicit point-to-point communication; Linda generalizes this via tuple spaces.
- Task of checking a model's intentions; found by Lindsey (2026) to peak at ~1/2 depth.
- A response containing multiple distinct attempts to answer the prompt, used as primary metric for ESR
- Secondary metric: percentage of responses containing multiple attempts, separating surface from actual self-correction
- Segments of reasoning separated by \n\n tokens used as the unit of analysis in ReflCtrl
- Units of cultural information; cited as an analogy for bioelectric control hijacking.