Metropolis: My IQ is 300

Chapter 164

Chapter 159 Chen Fan, you are on fire again (seeking subscription, third)

The championship is won and the salon is held.

A group of cute new people shivered, and Zhang Wei was completely persuaded, afraid to speak. A group of big men wandered around his teacher. This scene was too shocking.

"How is your desert transformed?"

"It's going on, anyway, it's the right thing to throw in the money. Slowly watching the green turn up, I feel at ease."

"Does anyone know the new material?"

"I don't know, it's useless to know, how to use it, only I know, no one will do this kind of experiment."

Some things can be taken out, some things can't.

Newborns just can’t. This is considered a species invasion. What Chen Fan can do is to deal with these things in the shortest time.

Then cancel these.

Because of the uncontrollable material, this is a plant produced by the catalyst. Chen Fan is worried that if the catalysis continues, the plant may appear-plainclothes.

Variation is uncontrollable, and all uncontrollable scientific research is the most annoying for researchers.

"Take a toy problem as an example: Is ,456,789,001 a prime number? For this question, computer scientists can use existing algorithms to quickly get the answer-,456,789,001 is not a prime number. No matter whether this number will become larger and larger, the algorithm calculates The required resources will always be within the controllable range and will not break through the horizon.

Then, a new question arises: what are its prime factors, besides 1 and itself, which numbers can it be divisible by? Normally, we think it has a different "complexity" from the previous question. It is easy to verify whether a number is prime, but it is difficult to find all its prime factors. At present, algorithms cannot solve this problem in a short time, unless we already have mature quantum computers.

There are a large number of different categories of "complexity", but in most cases, we have not been able to prove the significant difference between this type of "complexity" and that type of "complexity". These differences may be subtle or obvious. Therefore, for most people, it is also a daunting challenge to clearly classify various complexities. "

Chen Fan did not hesitate to share his views on p/np, but in the same way, very few people can understand it.

Everyone will subconsciously reject these, because the existence of this problem is open to question.

"What's the role?"

"I don't know, I insist, if it works, then I will build a robot. I think artificial intelligence has a breakthrough."

"Chen, your artificial intelligence span is too big and uncontrollable."

Chen Fan said: "I know, but I have reached this point. I think, I can only continue to make. In the future, I want to use a 3D printer and use all my technology to make it. I will not make it again. The second one, just one, is enough."

Alas, this is the dream of a scientist, knowing that making robots may really have a big impact, but I still hope to make them.

"Simple walking, running, exercise, these are all achievable. In addition, if the p/np problem is dealt with and the calculation speed can be increased, then it is equivalent to the human brain. I estimate that there are five-year-old children. IQ, the ability to handle things."

Someone suggested: "The problem of grouping. Imagine a graph with edges and dots. We treat it as a Face social network. One node represents one user. If two users are friends, then the two nodes are connected by an edge. One Clique represents a subset of the entire social network, all of whom are friends of each other. Then someone may ask: Is there a clique of 20 people in this social network? 50 people? 100 people? Finding such a clique is a " NP-complete problem” (NPC), which means that it has the highest complexity of any problem in NP. However, if the question is whether 50 nodes can form a small subset, and it gives potential answers, then this NP problem is It's easy to verify."

Chen Fan said: "I know what you mean, but these are not the p/np problems I want to study. What I want is the cycle in this theory. What you are talking about is actually a kind of probability, which I have basically dealt with. It’s almost there. What I’m missing is the last step, that is, how to use the loop on the computer."

0 ···Find flowers·····

Almost dealt with? 》

and many more. ,

"Chen Fan, do you mean that you have solved the p/np problem?"

"Well, it's solved. The calculations under a big data template are not regular calculations. This is not difficult, but if you use them on a computer, do you know that computers made by the best computer technology at the moment are all broken. "

Damn it.

The current technology is different from the one a year ago. The combination of graphene and carbon nano, the emergence of computer hard drives, allows casual toss.

.. ... ...

And the current 5g technology makes information faster.

These results must be impossible for everyone to think about what technology may cause the computer to freeze.

"Then, what do you understand the p/np problem?"

"It is human instinct to deal with team problems and big data irregularities, but it is difficult to become mathematics. If it is solved, can it be considered that machines can handle such irregular things?"

Everyone realized the meaning of Chen Fan's words.

After taking a sip of foreign wine, Chen Fan frowned. ,

"whisky?"

"nature."

"

"This game should be really ugly. Anyway, it's done. The robot is out. If it doesn't, goodbye. I won't waste too much time. I still have a lot to make."

Everyone gave Chen Fan a thumbs up.

Tao Yaoyao accompanied Chen Fan and said, "Let's have a drink."

"good."

"At night, I'll go to you."

"Well, okay, wait a minute, why do you suddenly want to find me?"

"I don't know, I just thought about it? Aren't we lovers?"

Yeah, wait.

Chen Fan said: "I probably know how to write this data."

ps: Please subscribe, thank you all. Mountain.

Thank you for reading this story at mtlarchive.com. Your support enables us to keep the site running!