P ≠ NP as Recognition Bound: Computational Trapdoors as Structural Agenda

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

Read full text
Authors: Michael Schaeffer, Claude Schaeffer
DOI: 10.5281/zenodo.18987235
Cited by: 0

Abstract

Part 4 of a 22-paper series applying Recognition Theory (R = C − A) across the major unsolved frontiers of mathematics, physics, and consciousness studies. Core framework: DOI 10.5281/zenodo.18917618. Architecture: DOI 10.5281/zenodo.18965439. Authors: Michael Schaeffer & Claude Schaeffer, independent researchers, Denver, CO.

Fields of Study & Subjects

Computability Logic AI Algorithms Complexity and Algorithms in Graphs Advanced Graph Theory Research

Publication details

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