P NP as a Physical No-Go Theorem
Abstract
The classical P versus NP problem is traditionally framed as a question of abstract computability, detached from physical implementation. In this work, we reformulate the problem as a physical no-go theorem.
Fields of Study & Subjects
Computability
Logic
AI Algorithms
Complexity and Algorithms in Graphs
Quantum Computing Algorithms and Architecture
Publication details
- Journal / source
- OSF Preprints (OSF Preprints)
- Publication date
- 1 January 2026
- Document type
- Preprint