Archives
All the articles I've archived.
20262
June2
An Original Problem: Minimum Swap Distance for Pattern Elimination
Find the minimum number of arbitrary swaps needed to remove every occurrence of a pattern T, using occurrence blocks, DAG DP, and convex optimization.
Judgment Is Not a Moat, but a Water Source
Updated:As AI makes prediction and action cheap, what remains scarce is not a static capability but a loop that continually regenerates context, judgment, and accountability.