method
active
method:associative-write-operator[ ] associative write operator
Primitive operator that updates memory m with a new value v for keys k_i.
Neighborhood — ranked by edge-count
Papers (1)
paper
Concepts (1)
concept
- abstract memory map massociated_withThe central memory structure that maps n keys to a value.
Methods (2)
method
- [ ] associative read operatorrelated_toPrimitive operator that retrieves the value associated with keys k_i in memory m.
- The primitive operations can be expressed as a single statement m[k1,...,kn, v] for write and v = m[k1,...,kn, ?] for read, suggesting relational applicability.
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.
- Tuples are referenced by matching typed fields, akin to a relational database.
- Tuple retrieval by matching against a template, similar to relational database queries.
- Mappings A' = {m | ∀g∈A: gIm} and B' = {g | ∀m∈B: gIm} that form the basis of concept formation.
- The single primitive operation of looking up a value from a set of n keys.
- Property of denotative programming from Landin.
- Sentience criterion; capacity occurs even in gene regulatory networks and non-neural morphogenetic agents.
- Neural network architecture that learns compressed representations; SOHMs are functionally equivalent.