Gap-MKtP Poisson Obstruction

A Poisson-Fourier Obstruction in Gap-MKtP Resolving P vs. NP

This project establishes a formal mathematical separation of computational complexity classes (the non-uniform $P \neq NP$ separation, asymptotically stated as $\text{EXP} \not\subseteq \text{NC}^1/\text{poly}$) via Hardness Magnification applied to the meta-computational promise problem of Levin's time-bounded Kolmogorov complexity ($\text{Gap-MKtP}$).

https://github.com/toandreyras/Gap-MKtP-Poisson-Obstruction/wiki/A-Poisson%E2%80%90Fourier-Obstruction-in-Gap%E2%80%90MKtP-Resolving-P-vs.-NP