claim
active
claim:we-propose-that-many-and-maybe-even-all-interesting-organisations-of-information-and-behaviour-might-be-built-from-a-single-primitive-operation-n-way-associative-lookupWe propose that many, and maybe even all, interesting organisations of information and behaviour might be built from a single primitive operation: n-way associative lookup.
The central thesis of the paper, that associative lookup is a universal building block for dynamic system semantics.
Neighborhood — ranked by edge-count
Papers (1)
paper
- An association-based model of dynamic behaviourmentionssupports
Questions (1)
question
- The central research question explored, by way of examples, throughout the paper.
Claims (1)
claim
- Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.
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.
- Encapsulates Piumarta's core unifying thesis about the generality and power of the associative primitive.
- The single primitive operation of looking up a value from a set of n keys.
- Certain kinds of information structures actively facilitate their own transformation and remapping, exhibiting minimal agency.hypothesis0.784Speculative hypothesis that memories themselves are agents.
- The foundational memory model: a map m associating keys k_i with values v, supporting two operators: associative read and associative write.
- Central claim from connectionist models: complex coordination emerges without centralized control or external teacher.
- Can efficient hardware support scale n-way associative lookup to practical language systems?question0.759Central open question: whether hardware acceleration of the associative primitive could enable efficient implementations across diverse programming paradigms.
- Extends ethical concern based on the collective nature of selves.