concept
active
concept:latent-structuresLatent Structures
Hidden or underdeveloped structures existing 'between the lines' of a configuration that can be enhanced and developed through harmony-seeking computation.
Neighborhood — ranked by edge-count
Frameworks (1)
framework
- A new form of computation that finds harmonious configurations by strengthening latent structures in a system while preserving the existing wholeness, applicable to buildings, towns, ecology, and natural systems.
Claims (1)
claim
- Alexander's assertion that the mathematical kernel of harmony-seeking computation lies in recognizing and making explicit structures that are already present in latent form.
Concepts (1)
concept
- Wholenessassociated_withAlexander's core concept rejecting the idea that a whole consists of parts; instead, a whole makes its parts (called 'centers').
Chapters (1)
chapter
- Chapter 14: Deep FeelingintroducesThe chapter presenting the argument that deep feeling is the core of living process, illustrated with examples from architecture, painting, and design.
Findings (1)
finding
- Example of harmony-seeking computation in artistic creation where painter recognizes and develops inherent latent centers.
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.
- Statistical regularities stored in pretrained models.
- Entities that become visible as centers in a configuration (e.g., rectangles of white space around a dot) that were not present before.
- Reasoning approach using learnable hidden embeddings.
- Conventional programming constructs like variables, arrays; claimed unnecessary for Elephant programs.
- Methods that use latent reasoning; lack task generalization and are difficult to train with autoregressive parallelization.
- Configurational entities existing implicitly in a structure; guide perception and generation of next morphogenetic step; exemplified in St Mark's square cycles.
- The central question of whether representational geometry implies corresponding computational structure