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 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.