Reading as a god

Chapter 114 Is it just a coincidence?
After listing all the bibliographies involved in all 144 fragments, Zhang Shan felt for the first time that the so-called Ghidling's rule was also ineffective.

Looking at more than 500 various books involved on a huge piece of paper, and Gu Zijin with a confused face.

Zhang Shan only felt that her head was getting bigger!
Zhang Shan unexpectedly found that most of the books he listed did not find corresponding books.

It stands to reason that Mizuki's mathematics data room is detailed enough, but Zhang Shan couldn't find the simple "Deduction of Number Theory" after searching for a long time.

Gu Zijin complained in a low voice: "Zhang Shan, are you sure the books you listed are books on Earth? Why haven't I read most of them? Or are they all in English, and these are all translated names?"

Is it okay not to book on earth?

Zhang Shan suddenly realized, he thought of the description of Youxiang reading card:

(Using this card, the host consciousness can enter the meson space library to read for 60 minutes, which can be superimposed. The host stays in the meson space for one hour, and the time in the normal world of the host will only pass by one picosecond.

Note: The host of this card can only be used for reading. When using this card, the rules for the host to gain experience from reading books are the same as the rules for the host to gain experience in the real space. When using this card, the host cannot get any money.

In particular, the rules for using this card are the same as those of Jingxiang reading cards, but the host needs to use at least 10 Jingxiang reading cards before using this card; in addition, due to the professionalism of the meson space library, it is recommended that the host be inspired when using this card Activity increased to over 90 points)
I can't find it anywhere else, and it doesn't make sense to find it in the meson space library in the system!
Zhang Shan decisively decided to visit the Meson Space Library to verify it if he had the opportunity.

Zhang Shan then began to further summarize the information he listed.

Soon Zhang Shan had a pleasant surprise. Zhang Shan found that there were a total of 48 fragments that were related to the content of discrete mathematics.

This is too coincidental, right? !Zhang Shan remembers to describe systematically:
“系统随机赠与宿主散落的SCI论文‘碎片’36个（在这36个碎片中有24个迷惑性碎片，只有12个有价值碎片，在这些有价值碎片中共包含3篇SCI级别论文）”

“新手礼包中系统随机赠与宿主散落的SCI论文‘碎片’108个（在这108个碎片中有72个迷惑性碎片，只有36个有价值碎片，在这些有价值碎片中共包含10篇SCI级别论文）”

Is it just a coincidence that there are exactly 48 valuable shards in the system?

Although it cannot be said that these fragments related to discrete mathematics coincide with valuable fragments, Zhang Shan always feels that there is a great connection between the two.

Zhang Shan’s idea also has other grounds. Among the various branches of mathematics analyzed and summarized by Zhang Shan just now, discrete mathematics is most closely related to Zhang Shan’s current professional computer science and technology department.

Discrete mathematics is the general term for the areas of mathematics most useful to theoretical computer science, including computability theory, computational complexity theory, and information theory.

Among them, the computational theory tests the limits of different theoretical models of computers, including the most powerful model known - the Turing machine.

The complexity theory research can be handled by computers; even if some problems can be solved theoretically by computers, the solution is still not practical because it will take too much time or space. Despite the rapid progress of computer hardware.

Finally, information theory focuses on the amount of data that can be stored on a particular medium, and thus has concepts such as compression and entropy.

The teaching content of discrete mathematics in undergraduate software engineering majors is generally divided into four parts: mathematical logic, set theory, algebraic systems, and graph theory. These four parts are closely connected.

Mathematical logic describes a symbolic system that can describe all concepts in set theory.

There are three small modules in set theory: sets, relations, and functions.Relations are a subset of the Cartesian product of sets, and functions are a subset of relations.

Algebraic systems are operations that define functions.

Graph theory is a special class of algebraic systems.

Discrete mathematics is a relatively new field among many branches of mathematics. To some extent, discrete mathematics is also a virgin land, waiting for people to get involved.

Discrete mathematics has many fundamental unsolved problems.For example, the most famous of them is the P/NP problem.

The P/NP problem is an unsolved problem in the field of computational complexity theory in theoretical informatics, and it is also one of the seven Millennium Prize problems of the Clay Institute of Mathematics. The P/NP problem includes the relationship between the complexity class P and NP. In 1971 Stephen A. Cook and Leonid Levin relatively independently posed the question whether complexity classes P and NP are equivalent (P=NP?)

Simply put, the P/NP problem may not be known to people, but if the P to NP problem is the seven millennium problems of the Clay Mathematics Institute's high reward (they are NP-complete problems, Hodge's conjecture, , Poincaré conjecture, Riemann hypothesis, Yang-Mills existence and quality gap, Navel-Stoker equation, BSD conjecture. Among them, the Poincaré conjecture has been solved), many people immediately understood.

This question is also the biggest problem in computer science, and it concerns how fast a computer can complete a task.

Zhang Shan remembers that the field of fragment No. 99 listed just now belongs to the field of discrete mathematics, which covers "Research on Complexity-related P-related Issues", "In-depth P/NP Problems", "Alternative Thinking of Computational Complexity Theory";
Fragment No. 100 is also discrete mathematics, covering the books "P=NP?", "P≠NP?" bibliography.

So the 99th, 100th, and 101st fragments point to the famous P/NP problem in discrete mathematics?
Zhang Shan was completely stunned. If it is really a P/NP problem, it is not a problem that can be expressed in the simple SCI area.

If this is thrown out, it will be a super blockbuster that can shock the world.

Even so, there is still a long way to go for Zhang Shan. A person who has not even read discrete mathematics seriously and claims to have solved the NP problem may be regarded as either a lunatic or a fool.

This situation is not too bad, anyway, after the final verification, someone will rectify your name.

The worst-case scenario is that the results are completely usurped by others.

Making wedding dresses for others doesn't count!And bear the stigma of plagiarism.

Academia has never been an ivory tower.

What touches people's hearts is not only money, but also fame and fortune.

(End of this chapter)