Is P equal to NP? Answer and Method to solve puzzles with God's algorithm

Abstract

The complexity of any type of problem can be from the easiest to the infinitely complex, there are problems where there are shortcuts with God's algorithms and they can be solved in polynomial time, and there are problems where with God's algorithms there are no shortcuts and no are solved in polynomial time, if a non-deterministic Turing machine finds solutions to problems in polynomial time this means that a deterministic Turing machine with God's algorithm can also find solutions to the same problems in polynomial time, when we have a problem we will solve it with God's algorithm, we can have 1, 2 or more God's algorithms that solve the same problem with the same number of steps. As a result, we use God's algorithm, and we observe how many steps this problem is solved in. It can be many steps or few steps, and we make the decision if it is worth spending time to solve that problem. The author presented the results that it is impossible to solve the problem in fewer steps than the number of steps of God's algorithm.