1. P Equals NP
- Author
-
Paper's Author
- Subjects
computation ,computational complexity ,p vs np ,p versus np ,complexity - Abstract
This paper is on a brief interpretation of class P and NP in infinite Hamming cube consisting all the instances of any language in P or NP as well as all the instances of a Turing machine’s tape per configuration. It is shown that P and NP are more comparable when defined in Hamming space; while, this results P = NP.
- Published
- 2022
- Full Text
- View/download PDF