In the article we provides an response to the problem of equality of P and NP classes, which is also called the Millennium problem. As a result, given the complete result of equality. For theory of refutation we use method of "reductio ad absurdum". We use tensor analysis for define objects which considered relatively to the Turing machine computation. The goal was to give an answer to a proble that has affected to degree of the proof calculation's details. The result can be obtained relative to the current problems of equality P and NP classes, but other than that give an opportunity to explore the computational process more.