A State-Transition Proof of P ≠ NP
Year: 2026
Type: article
Abstract: Version 2.0 We establish that P ̸ = NP by demonstrating that the complexity classesrepresent mutually exclusive informational categories. We define P as a NullTransition State (T0) and NP as a State-Transition Event (T≥1). Withina discrete logical system, a static coordinate (0) and a dynamic vector (1) arecategorically distinct; therefore, P cannot map onto NP. This proof utilizes thefundamental definitions of verification, discovery, and the emergence of time
Author: Brown, Nicolas Antony
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7142860453
FWCI:
Cites:
Cited by:
Related to: