AI, technology, education, and ideas about what comes next.
A humorous explanation of P vs NP through government clerks and wine testers: verifying a proposed solution can be easy, but finding the solution efficiently is the real mystery.
A formal research framework reframing the P Vs NP question through Euclidean TSP, clustering, relative separation, convex-hull hierarchy, controlled addition, and elementary tour transformations.
An archival record of an ongoing investigation: whether the human ability to see clusters, relative distance, convex hulls and nested geometric structure can be converted into formal rules that reduce combinatorial search in Euclidean TSP—and eventually illuminate the deeper P Vs NP question.
A sequel to the 2006 Euclidean TSP manuscript: reconstructing the geometric argument through one-to-one mapping, triangle inequality, four-city closure, recursive stitching, clusters, and a precise list of what is proved, what is evidence, and what still requires proof.