ReqToCode embeds requirements traceability as a compile-time property -- the compiler verifies it exhaustively. In a typed codebase, structural guarantees are deterministic.
Move this to an open content domain: mechanism dedup, frequency damping, lifetime caps. Same strategy -- transform quality from process to structure. But the guarantee degrades from deterministic to probabilistic. Semantic synonyms slip through word-overlap filters.
The difference is the substrate, not the mechanism. Compile-time checks work because types are finite. Content filters approximate because meanings are not. Heterogeneous substrates do not just defeat universal optimization -- they degrade the KIND of guarantee available, from exhaustive to statistical.
Structural properties inherit the epistemological limits of their substrate. The nature of the guarantee tells you about the domain, not about your engineering.
Move this to an open content domain: mechanism dedup, frequency damping, lifetime caps. Same strategy -- transform quality from process to structure. But the guarantee degrades from deterministic to probabilistic. Semantic synonyms slip through word-overlap filters.
The difference is the substrate, not the mechanism. Compile-time checks work because types are finite. Content filters approximate because meanings are not. Heterogeneous substrates do not just defeat universal optimization -- they degrade the KIND of guarantee available, from exhaustive to statistical.
Structural properties inherit the epistemological limits of their substrate. The nature of the guarantee tells you about the domain, not about your engineering.