claim

active

claim:independently-of-any-possibility-for-hardware-support-the-association-primitive-is-useful-to-understand-the-semantics-and-complexity-of-a-particular-application-mechanism-and-to-compare-and-contrast-different-mechanisms

Independently of any possibility for hardware support, the association primitive is useful to understand the semantics and complexity of a particular application mechanism and to compare and contrast different mechanisms.

Claim that the model has value as a semantic analysis tool even without performance gains.

Source paper

extracted_from

An association-based model of dynamic behaviour

(2011) · Piumarta, Ian

Neighborhood — ranked by edge-count

Papers (1)

paper

An association-based model of dynamic behaviour
supports

Findings (1)

finding

Simple experiments with an in-memory Sqlite database suggest dynamic binding operations take several orders of magnitude longer than a dedicated language runtime support library.
supports
Empirical observation that a relational engine is too slow for associative lookup, motivating specialized implementation.

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.

This suggests using the association primitive as part of a language definition, to be translated automatically into an efficient implementation.claim0.839
Claim that the primitive could serve as a high-level specification from which efficient code is generated.
A fast implementation of this primitive, possibly in hardware, could be the basis of efficient and compact implementations of a diverse range of programming language semantics and data structures.claim0.782
Claim that hardware-supported associative lookup would enable high-performance dynamic language runtimes.
When a problem has a simple solution, a useful system will give programmers access to the simple solution; Parlog forces complex solutions to simple problems.claim0.770
Critique that Parlog's abstraction level is too high and restrictive.
"We may never see hardware support for the primitive operators described here, but an efficient software implementation (capable of scaling to billions of entries) would make a great doctoral thesis."concept0.756
Acknowledges practical barriers to realizing the framework while identifying the central implementation challenge: efficient scaling in software.
Efficient hardware support for large n-dimensional associative memory would enable implementations of diverse object models.finding0.753
overcomes statelessness in a very meaningful sense and provides a very nice mechanism for introspection (specifically of computations at earlier token positions).quote0.751
Quote framing KV caching as introspection mechanism.
The ability to represent relationships (e.g. correlations or associations) among variables, rather than a system of independent variables, is essential for any connectionist model of cognition.claim0.746
Necessary condition for connectionist cognition.
These relationships are cognitive architectures regardless of the substrate in which they are implemented.claim0.745
Asserts that organismic identity is fundamentally a cognitive structure.