Establishes a formal isomorphism across four major results in physics and computational complexity theory: Maxwell's Demon, Landauer's erasure principle, Planck's constant, and the P≠NP conjecture are shown to be four expressions of a single object — the Constraint Floor, the minimum irreducible cost of any order-maintenance process. Peₘax serves as the unified order parameter. At human scales, P≠NP is the binding constraint by ~10¹00 over the Landauer limit. NP-hardness of the EOP provides two independent reductions (MAX-k-COVERAGE + influence maximization). nₑff ≈ 55–75 bits.
Anthony W. Eckert (Fri,) studied this question.