Proof that P can maybe = NP via theoretical Quantum Information Preprocessors A computer science and mathematics thought experiment paper Proving that a theoretical AI system could theoretically solve problems over polynomial time using Relational Algebra, Set Theory, Relativistic Physics, Quantum Computing theory, Exponentiation expression, and propositional logic. Download and read here
Download as PDF [914KB] INTRODUCTION What is it to know? What is to to feel? To feel the gnaw of mortality instinctively in the gut, from the pineal gland gliding all the waydown. The struggle for meaning in it all, a finality, some meaning to burden with truth, and some truth to burden with meaning. Truth….