On Minimal Algorithmic Structure and Pseudo–Deterministic Time Algorithms

This work introduces a structural framework for understanding deterministic computation through the lens of minimal algorithmic form. All effective procedures can be generated from three fundamental control processes—sequencing, branching, and iteration. Within this finitely generated space, we define a pseudo–deterministic time algorithm (pseudo–DTA) as a structurally minimal representative of all algorithms solving a given decision problem. Rather than searching for faster algorithms in an unbounded design space, this perspective shifts attention to the intrinsic structure of computation: if a minimal form already requires exponential worst‑case time, then no structurally more complex algorithm built from the same control basis can asymptotically improve upon it. This yields a variational viewpoint on algorithmic lower bounds, analogous to minimal‑action principles in physics. The paper formulates the notion of minimal structure, establishes a general structural lower‑bound principle, and outlines its implications for NP‑complete problems. The goal is not to resolve 𝑃 ≠ 𝑁 𝑃 , but to provide a conceptual foundation that reframes lower‑bound questions in terms of the geometry and minimality of algorithmic structure.