1 paper · 1 filter
Ben Goertzel
We present a proof architecture for \(P \neq NP\) based on an upper--lower clash in polytime-capped conditional description length. We construct an efficiently samplable family of…