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 personal research journey from the first P vs NP exploration in 2001, through the 2006 Elsevier setback and a long pause, to a renewed AI-assisted investigation in 2026.
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 2026 formal expansion of Hemant Pandey’s 2006 P vs. NP manuscript, returning to its geometric seed—Hamiltonian paths, convex polygons and topology—and identifying the proof obligations needed to turn that intuition into a rigorous polynomial-time result.