[ ] associative read operator

Primitive operator that retrieves the value associated with keys k_i in memory m.

Neighborhood — ranked by edge-count

paper

concept

abstract memory map m
associated_with
The central memory structure that maps n keys to a value.

method

[ ] associative write operator
related_to
Primitive operator that updates memory m with a new value v for keys k_i.
unification of read and write into a single statement
extends
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.

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.

associative addressingconcept0.768
Tuples are referenced by matching typed fields, akin to a relational database.
associative matchingconcept0.716
Tuple retrieval by matching against a template, similar to relational database queries.
Closure Operatorsconcept0.710
Operators X → X'' on subsets of objects or attributes, satisfying extensivity, monotonicity and idempotence.
Associative Learningconcept0.709
Sentience criterion; capacity occurs even in gene regulatory networks and non-neural morphogenetic agents.
Autoencoderconcept0.705
Neural network architecture that learns compressed representations; SOHMs are functionally equivalent.
n-way Associative Lookupconcept0.704
The single primitive operation of looking up a value from a set of n keys.
Sparse Autoencoderframework0.701
Interpretability framework used to decompose layer-40 activations into sparse feature sets for studying emotional alignment and persistence
whether many (maybe even all) useful organisations of information and behaviour in a dynamic language might be constructed from a single primitive operation: n-way associative lookupquestion0.698
The central research question explored, by way of examples, throughout the paper.