Where Exactly Does NP Emerge? A Structural Re-Reading of Cook’s Original Formulation

This paper revisits Cook's original formulation of the P versus NP problem and asks a question that is logically prior to the traditional P versus NP conjecture: where exactly does NP emerge as a distinct computational class? The analysis reconstructs Cook's definition as a progression from deterministic polynomial computation to deterministic polynomial relations and finally to existentially quantified relations. It is argued that the transition from R(x,y) to ∃yR(x,y) introduces an additional finite parameter and an existential quantifier, but does not explicitly introduce a new computational mechanism. The paper further examines the dependence of complexity classifications on representation, size measures, and parameter interpretation. In this framework, NP is analyzed not as a primitive computational ontology but as an interpretative extension of deterministic polynomial verification. The goal is not to establish either P = NP or P ≠ NP, but to investigate the conceptual foundations of Cook's original construction and the assumptions required for NP to be regarded as a genuinely distinct computational class.