Registry · Remark III.R45 conjectural not_applicable

III.R45 — The Complete P vs NP Landscape

Four categories of computation: (i) τ-admissible TTM (P_adm=NP_adm, proved), (ii) physical E₁→E₂ (P=NP, τ-effective), (iii) τ-native abstract E₃ (P=NP, τ-effective), (iv) ZFC-abstract (P≠NP ruled out, P=NP open/independent). Three P=NP, one asymmetric. The boundary is earned algebraic vs proliferating axiomatic infinity.

Book III Part 9 Ch. 80

Dependency Graph

Depends on (6)

Lean Formalization

Module:

Symbol: