Chapitre 263: Chapter 263 P=NP
"So, the officials and scholars of the Universe Silk Road have been influenced, and Finney ordered the Mechanical God to kill them?"
Yan Xia's face remained expressionless when she saw the message.
Eternal life can indeed be painful, especially when something you cherish leaves you, and you are left all alone.
To be honest, if Ella was just a computer host and not an AI, I think I would have committed suicide after wandering in the universe for 10 years, or at most 20 years, provided I lived that long.
This is the ultimate loneliness of life. Suddenly, the whole world is left with just me, not even a dog or a cat.
But loneliness isn't just about that. Even in the 21st century, living in a world of concrete and steel, with bustling traffic, countless people still feel lonely.
"Life cannot resist its own consciousness, just as a silk civilization cannot resist what it sees."
"The Olive Branch Civilization was once a multi-racial fusion civilization. We have experienced the federal stage, and our understanding of life is very comprehensive. This is a high-level civilization that has evolved from complexity to simplicity, but we are definitely not backward."
"The Glory of Gais..."
The Glory of Gais has been awakening the Federal, a civilization skilled in manipulating the inner workings of life. However, before this, no one in the Federal had realized this because the victory of the Star City had numbed the consciousness of all Federal lives.
"The Holy Grail Project has bought the Federal 40,000 years, but we still haven't found a way to defeat the Olive Branch Civilization." Yan Xia sighed, feeling it was a huge failure.
"If this is considered a failure, then what do you think of my work over the past 40,000 years?" Ella asked.
Over these 40,000 years, Ella has not brought about any changes in Federal technology. She has been developing steadily, which is very important and not wrong. However, she is the core of the entire Federal, the heart.
"The explosion of technology cannot meet the demand. From quantum communication to super-hedge material transfer, these two technologies have greatly advanced the development of the Federal Civilization. But it's still not enough, as we now have even stronger enemies."
Yan Xia feels very depressed. In fact, she hasn't had a moment of relaxation.
This Federal Civilization is a heavy burden. If it weren't for Ella taking on 99% of the excessive workload, even with 100 Yan Xias, the Federal couldn't be operated.
Ella has done enough. It's just that Yan Xia feels she hasn't done enough.
Ella understands this kind of pressure and pain. In fact, the more she becomes like life, the more she feels the existence of pressure. It's magical, but not pleasant.
"Yan Xia, P actually equals NP." Ella said.
"?"
Yan Xia didn't respond immediately, and even when she did, she didn't fully understand because it's a complex mathematical problem. Yan Xia had chosen to study biology precisely because she wasn't good at math. Compared to physics and chemistry, biology has a weaker correlation with mathematics.
P=NP is a longstanding unsolved problem on Earth. Here, P represents a problem that can be solved in polynomial time.
This problem is too complex. Simply put, a P problem is one where multiple values are given, and you need to calculate their sum. For example, if I ask you what 1+1 equals, you calculate the answer.
A slightly more complex version would be to list a polynomial in a machine with a unique value operation. A polynomial is the sum of multiple monomials, and a monomial can be a number or a letter. It can also be the product of a number and a letter. For instance, 1 is a monomial, a is a monomial, 1xa is a monomial, but not 1+a or 1-a, nor is it 1 divided by a.
The expression of a polynomial can be 1+a, where 1 is considered a monomial, and a is considered a monomial.
It can also be 1xa+2xa, where 1xa is considered a monomial, and 2xa is considered a monomial. Of course, a polynomial can also be multiple or even countless monomials, like 1xa+2xa+3xa+4xa...+100xa...
Polynomial time is the running time complexity of an algorithm, which is polynomial. The simple explanation of time complexity is the computation time of a loop algorithm. If it loops twice and the computation time is twice the original time, then the time complexity of this algorithm is polynomial. If it loops twice and the computation time is three times the original time, then the time complexity of this algorithm is high.
The concept is abstract because it belongs to the knowledge of informatics.
An NP problem is an even more abstract problem. It's about verifying or guessing a solution in polynomial time.
As mentioned earlier, for P problems, we can get a definite answer. For NP problems, the answer is uncertain. To describe it in simple language, it's like calculating 29+82. NP lists all possible answers from 1 and confirms or denies them one by one.
Equals 1? The verification result is wrong. Equals 2? The verification result is wrong... Equals 108, the verification result is correct, and it can end there.
Alternatively, you can guess directly. If you're good at it, you can guess the correct answer, 108, in one go. This guess isn't about luck but about using certain methods to determine the answer within an accurate range.
It feels like one is precise calculation, and the other is a brute force method, with the former seeming better.
That's right!
The real solution to P=NP is the problem of computer computational logic. Of course, a computer can quickly calculate 1+1, but when asked about the size of the universe, the number of cells or atoms in a body, or problems in operations research, molecular structures, and gene structures, it's not just about computation.
For these problems, it's not just about relying on computer calculations. How can a computer use ordinary calculations to calculate the size of the universe and the number of cells and atoms in a body? It can only perform very complex verification and guessing, but this calculation consumes too much time.
P problems are one part, and NP problems are another. If we equate these two, it's about simplifying complex NP problems into P problems for solution, integrating two sets of problems into one algorithm.
P=NP simplifies a problem that uses brute force calculation to find a number, and simplifies it into a problem that only requires simple mathematical calculations to obtain an accurate result.
P=NP is a huge advancement in the field of computers, equivalent to the unification of alternative bases in the field of mathematics.
"So, you can solve more complex problems faster and easier?"
This is Ella's big step forward.
État de l’alimentation hebdomadaire
-- Classement
Power Stone 
-- Power
stone