Imagine P=NP: Verifiable Tasks Solved by Compute, Security in Tatters

gleech · x · 2026-11-21

A shared thought experiment: in a world where P=NP, any easily verifiable task could be accomplished with compute alone, giant gaps would open in all security systems, and machines could autonomously solve the biggest open math problems—an analogy for compute, verifiability, and AI safety.

Original post →

More from AGI Musings

AGI Musings channel →