Toward P vs. NP: Comparative Analysis of Term Rewriting System (TRS) Search Engines
Comparative Architecture, Formal Mechanics, and Complexity Boundaries of Biological, One-Tag, Double-Tag, and Two-Pile / NP-Side Search Engines
A formal evaluation of four search-engine paradigms developed within the Term Rewriting System (TRS) research program for the Subset Sum Problem and its Exact-Cardinality extension (ECSS). Examines suffix-sum activation pruning (biological_search_engine.py), exact suffix reachable sets (tag_search_engine.py), correlated two-coordinate residue/metric merging under Common-Key Safety (Δi(x) = (τi(x), κi(x))), and decoupled Stage-1 candidate filtering paired with an independent O(n) NP-side verifier (V(I, w) = 1), alongside the four Clay Mathematics Institute (CMI) compliance obligations and the open uniform state-bound frontier (Lemma E).