The purpose of this paper is to introduce an unknown method for finding a real possible x value of any degree polynomial equation and to show how this can be applied to make computers which are at least x1000 （one th...The purpose of this paper is to introduce an unknown method for finding a real possible x value of any degree polynomial equation and to show how this can be applied to make computers which are at least x1000 （one thousand times） faster than today＇s existing highest speed computers. Since one of the Milennium Prize Problems offered by Claymath asks about whether P （Deterministic Polynomial） is equal to NP （Non-Deterministic Polynomial） （what that means informally is that whether we can design a computer which can quickly solve a certain complicated problem can also verify the solution quickly （and vice versa）. Fortunately, the answer to P vs. NP problem based on my findings in certain algebraic algorythms is yes although there have been many people who claimed the answer is no. What that means is that humans can make machines that work very fast and close to human intelligence in the identification of, say, certain proteins and amino acids, in case my theory is proven to be a fact. This paper is therefore an initial stage of planting the first seeds of the process, in terms of describing how exactly this can happen, theoretically of course, since everything in Science begins with a theory based on the outcome of a hypothesis.展开更多
文摘The purpose of this paper is to introduce an unknown method for finding a real possible x value of any degree polynomial equation and to show how this can be applied to make computers which are at least x1000 （one thousand times） faster than today＇s existing highest speed computers. Since one of the Milennium Prize Problems offered by Claymath asks about whether P （Deterministic Polynomial） is equal to NP （Non-Deterministic Polynomial） （what that means informally is that whether we can design a computer which can quickly solve a certain complicated problem can also verify the solution quickly （and vice versa）. Fortunately, the answer to P vs. NP problem based on my findings in certain algebraic algorythms is yes although there have been many people who claimed the answer is no. What that means is that humans can make machines that work very fast and close to human intelligence in the identification of, say, certain proteins and amino acids, in case my theory is proven to be a fact. This paper is therefore an initial stage of planting the first seeds of the process, in terms of describing how exactly this can happen, theoretically of course, since everything in Science begins with a theory based on the outcome of a hypothesis.
