Mathematical Resolution of P vs NP through Informational Noise Subtraction and Linear O(n) Mapping

Zenodo (CERN European Organization for Nuclear Research) 2026 Preprint Open access

Read full text
Authors: Alessandro Monti
DOI: 10.5281/zenodo.18148868
Cited by: 0

Abstract

This paper presents a formal resolution of the P vs NP Millennium Prize Problem. By introducing the 'Noise Subtraction' operator (S), it demonstrates that NP-complexity is a result of entropy within the information manifold. The proof shows that any NP problem can be reduced to linear time O(n) by distilling the logical skeleton from its informational noise.

Fields of Study & Subjects

Computability Logic AI Algorithms Statistical Mechanics and Entropy Advanced Algebra and Logic

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
5 January 2026
Document type
Preprint