Structural Closure of the P vs NP Program A Four-Paper Reduction to Process Irreversibility

This project presents a four-paper structural analysis of the P versus NP problem. Rather than attempting a direct resolution, the work systematically examines and closes all known structural approaches to the problem. Across four papers, we show that: 1. All static structural methods are exhausted (Paper I), 2. Non-uniform polynomial advice collapses under deterministic isolation (Paper II), 3. Temporal and infinite-depth verification provides no additional power (Paper III), 4. The P vs NP question reduces to a single non-structural obstruction: process irreversibility (Paper IV). The project does not claim to resolve the P vs NP problem. Instead, it isolates the problem to a sharp and irreducible core, thereby closing the classical structural program in complexity theory. What remains is not a missing technique, but a missing principle governing irreversible computation.