method
active
method:application-read-write-functions-r-and-wapplication read/write functions r and w
Higher-level semantic operations that map the primitive memory operations to application-level semantics.
Neighborhood — ranked by edge-count
Concepts (4)
concept
- n-way Associative LookupimplementsThe single primitive operation of looking up a value from a set of n keys.
- dictionary (two-key associations)associated_withUsing two keys (k1, k2) to identify segmented memory: k1 as object/segment, k2 as slot/field.
- flat address space modelassociated_withSimple memory where a single key k directly addresses a value, ignoring advanced primitive properties.
- The application write operation can be extended with key transformations analogous to r, though direct insertion is often preferred.
Methods (1)
method
- When a lookup returns ε, transform keys using β functions and retry lookup, enabling delegation.
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.
- Assignment and contents functions for state manipulation in Algol 50, from McCarthy 1963.
- The practical, working aspect of a building; reinterpreted as the dynamic harmony of moving centers.
- Prior framework for synergizing reasoning and acting in LLM agents, foundational to agent harness concept
- Primitive operator that updates memory m with a new value v for keys k_i.
- Pattern defining standard structure for application modules that the backplane can launch and manage uniformly.
- Primitive operator that retrieves the value associated with keys k_i in memory m.
- Publication series in which the work appeared.
- Extended subjective reward function proposed in this paper combining happiness with pain-belief signal