Proof that P can maybe = NP via theoretical Quantum Information Preprocessors [First Draft]

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