The Constraint Floor Isomorphism: Maxwell's Demon, Landauer's Principle, Planck's Constant, and P≠NP as Four Expressions of One Kill Condition

Read full text Summarise with VIRAT
Authors: Anthony W. Eckert
Cited by: 0

Summary

No summary yet. VIRAT can read this paper and write a plain-language summary of its aim, methods, key findings and limitations.

Summarise with VIRAT Free to try with your Science Catalogs account.

Abstract

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_max serves as the unified order parameter. At human scales, P≠NP is the binding constraint by ~10^100 over the Landauer limit. NP-hardness of the EOP provides two independent reductions (MAX-k-COVERAGE + influence maximization). n_eff ≈ 55–75 bits.

Fields of Study & Subjects

Computability Logic AI Algorithms Complexity and Algorithms in Graphs Advanced Thermodynamics and Statistical Mechanics

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
27 March 2026
Language
EN
Document type
Preprint