III.R22 — Computation Cannot Live Below E₂

P vs NP presupposes an agent performing a search — requires (a) self-referential codes, (b) execution cycles, (c) efficiency measure. None exist at E₀ or E₁. P vs NP is not hard below E₂ — it is meaningless.