Naming, Structure & Recursive Composition

Primes about the computational and linguistic machinery that organizes information, including naming conventions, hierarchical addressing, parsing hidden structure from sequences, recursion, higher-order functions, and how a compiled category or fixed kernel locks in a shape.

8 primes in this family — primes that sit near one another in abstraction space (k-means over structural-signature embeddings). Each is shown with its short description.

• Category Retrieval Lock In — A category label that made routine retrieval cheap obstructs novel re-use, because the retrieval infrastructure has compiled the label in place of the property list.
• Convolution — Each output is a sliding, weighted local mixture of an input produced by one fixed kernel.
• Hierarchical Address — A single string whose substring structure encodes a path through a tree, so the identifier simultaneously names an entity and locates it within a containment hierarchy.
• Higher Order Function — Treating a rule itself as a first-class object that other rules consume or produce.
• Naming Convention — Names or identifiers are minted not freely but by explicit generative rules a community commits to, buying predictability, parseability, and collision-avoidance.
• Parsing — Recover hidden hierarchical structure from a flat sequence using a grammar.
• Preimage — The set of all inputs that map to a given output under some mapping.
• Recursion — Breaks processes into self-similar steps.