Chapter 57: The Computation Layer

This chapter opens the P vs NP block by establishing that the question “Can search be efficient?” is native to the enrichment level E₂—and meaningless below it. At E₀, objects have relations but no processes: there are no agents, no steps, no execution. At E₁, dynamics exist but no self-referential codes: a rock falling under gravity is not computing. The qualitative leap to E₂ occurs when objects contain their own decoders—when data carries the instructions for reading itself. We formalise this leap as the Code–Execution–Code cycle, define the E₂ computational agent and operational closure, and show that life is the physical instantiation of this cycle running on E₁ hardware. The chapter closes by demonstrating that every ingredient of the P vs NP problem—agents, steps, efficiency—presupposes E₂ structure. The question is not hard to answer at lower levels; it is vacuous there.