concept
active
concept:data-structures

data structures

Conventional programming constructs like variables, arrays; claimed unnecessary for Elephant programs.

Neighborhood — ranked by edge-count

Concepts (2)

concept
  • Data structures stored as collections of tuples in tuple space, accessible to many processes.
  • The actual computational operations a model performs, which the paper argues need not mirror representational structure

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.

  • A structuring technique where each element of a result is computed by a separate process that turns into a data element; enables fine-grained parallelism.
  • Deep Structureconcept0.815
  • The central question of whether representational geometry implies corresponding computational structure
  • Tree structureconcept0.810
    A hierarchical branching structure with single-parent nodes, which Alexander rejected for urban design.
  • structured dataconcept0.808
    Training data with inherent geometric or relational structure, which induces geometric organization in model internals.
  • semantic structureconcept0.805
    The meaningful organization of concepts in a model's representation space, claimed to be better captured by manifolds than by SAEs.
  • Global Structureconcept0.797
    The large-scale organizational pattern of a system whose preservation defines wholeness-preserving transformations
  • Latent Structuresconcept0.797
    Hidden or underdeveloped structures existing 'between the lines' of a configuration that can be enhanced and developed through harmony-seeking computation.