P Equals NP

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 comparablewhen defined in Hamming space; while, this results P = NP.