Why P vs NP Is Equally Hard for AI and Computers
Why P vs NP may resist increasingly powerful AI and computation: the deeper challenge may be discovering structural principles that eliminate exponential search rather than merely searching faster.
Tag
Geometric Algorithms
3 Posts
P vs NP: A 25-Year Journey from an Old Idea to a New Struggle
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.
P vs. NP: From the 2006 Geometric Seed to a Hierarchical Proof Framework
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.