Traditional approaches to the P vs N P problem rely on combinatorial models of complexity, whichlack a natural continuous metric for analyzing lower bounds. In this paper, we propose a rigorous iso-morphism between the discrete state space of a Turing Machine and a continuous Hilbert Space spannedby the prime numbers (HP ). The framework developed provides a physical obstruction to polynomialinversion, independent of the choice of logical basis.
Michael Kelly (Mon,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: