nx_evo_cf.nx

nx_evo_cf.nx -- EVOLUTIONARY SYNTHESIS rung: CONTROL-FLOW GENOMES under example fitness (X-AUT-006O) -- discover ALGORITHMS (piecewise functions), not just polynomials, from examples. 006N (nx_evo_pbe) discovered POLYNOMIAL f(x) from examples but its op set cannot express a piecewise function like abs/relu (a kink is not polynomial). This rung gives the genome GENERAL control-flow primitives -- a linear-GP register machine with PREDICATED execution: NEGATE (0-acc), SUB-X, a SIGN-PREDICATE (skip the NEXT instruction when acc>=0, i.e. the next instr runs IFF acc<0), and NOP. None is target-specific; the search must COMPOSE [predicate, negate] to get abs, etc. Evolved under the 006N example-based fitness + HELD-OUT generalization check. nx_evo_cf <champion_basename> <target_id> <seed> target: 0=abs 1=relu 2=x*x op set: 0 +n,1 *n,2 -n,3 +x,4 *x,5 ^2,6 negate,7 PREDICATE(skip next if acc>=0), 8 nop,9 -x. train on x in {-3,-2,-1,1,2,3}; held-out {-5,-4,4,5}. -> champion materialized with REAL control flow: op7+next emits `if acc<0 { next }`. no-false-green: abs/relu need the conditional -> a polynomial genome can at best OVERFIT the training points and FAIL held-out (caught); the GENERALIZING (4/4) solution is the control-flow one, and the champion COMPILES+RUNS with a real if-branch. Sovereign, no gcc/.sh. HONEST: predicated linear-GP (one forward sign-predicate), integer fitness; loops-from-examples (gcd/fib) are the next rung. license_tier: ORIGINAL