n-way Associative Lookup

The single primitive operation of looking up a value from a set of n keys.

Neighborhood — ranked by edge-count

Papers (1)

paper

An association-based model of dynamic behaviour
introduces

Communities (1)

community

Associative Lookup
members_of

Methods (1)

method

application read/write functions r and w
implements
Higher-level semantic operations that map the primitive memory operations to application-level semantics.

Concepts (4)

concept

Ian Piumarta
studies
Author of the paper proposing n-way associative lookup as a unifying primitive for dynamic language semantics.
abstract memory map m
associated_with
The central memory structure that maps n keys to a value.
Keys as Meta-Taxonomic Dimensions
extends
Each key position n creates an independent taxonomic dimension; additional key positions enable multi-dimensional delegation and namespace constraints.
garbage collection in n-way associative memory
associated_with
The difficulty of deleting values when any key in an n-tuple becomes unreachable, especially as n grows beyond 2.

Related by similarity (8)

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.

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 lookup.claim0.817
The central thesis of the paper, that associative lookup is a universal building block for dynamic system semantics.
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.802
The central research question explored, by way of examples, throughout the paper.
Can efficient hardware support scale n-way associative lookup to practical language systems?question0.786
Central open question: whether hardware acceleration of the associative primitive could enable efficient implementations across diverse programming paradigms.
associative matchingconcept0.780
Tuple retrieval by matching against a template, similar to relational database queries.
Primitive Mechanism: n-way Associative Memorymethod0.767
The foundational memory model: a map m associating keys k_i with values v, supporting two operators: associative read and associative write.
associative addressingconcept0.744
Tuples are referenced by matching typed fields, akin to a relational database.
Associative Memoryconcept0.743
Memory system that stores patterns in connection weights and recalls them from partial or noisy cues; property of Hopfield networks and evolved networks
Associative Learningconcept0.737
Sentience criterion; capacity occurs even in gene regulatory networks and non-neural morphogenetic agents.