|
|
楼主 |
发表于 2022-8-4 22:22
|
显示全部楼层
机器翻译
The logical proof of the Millennium puzzle PNP by 13312690681m@sina.cn, Yulong County, Lijiang City, Yunnan Province, Yang Yanhong Key words: logical truth table, Boolean algebra, higher-order logic, Turing machine read-write head abstract existence premise S=1, Then there is at least one P problem (computer-solvable problem) equal to NP problem (solution is computer-verifiable problem), that is, P←→NP(P=NP). Conclusion: For all P-like and NP-like problems, there is P=NP, There are also P≠NPP and NP[ edit] classes. P is all the problems that can be solved by computers. NP is all the problems whose solutions can verify whether the solutions are correct. Deduction and prediction of special events are obtained from assumptions and general principles. When using logical rules for analysis, deduction and inference depend on a set of initial assumptions (axioms). If the initial assumptions are true and there are no logical contradictions in the analysis, according to logical rules, Then the conclusion must be true: the problems that the computer can handle include image processing, voice input and numerical calculation. The intersection of the three is binary: 0, 1 for 0, 1 with [0, 0] [0, 1] [1, 0] [1, 1] and four Boolean algebras with 0+1=1, It can be seen that 1-1=0 is a logical expression that the same thing exists and does not exist at the same time. It is impossible to discuss a special problem. The computer weather forecast is obviously a P-like problem. If there is rain or the sky is defined as rain [1] and the sky is [0], from the practical experience, the computer weather forecast is P-like, and the actual verification of the weather forecast is NP-like. If the forecast is rainy and the actual weather is rainy, the computer weather forecast is accurate. ② if rain is forecast and the actual weather is sunny, the computer weather forecast is inaccurate. ③ If the weather forecast is clear and the actual weather is fine, the computer weather forecast is accurate. ④ If the forecast is clear and the actual weather is rainy, the computer weather forecast is inaccurate. ⑤ The weather forecast results must be increased by one point (S+1) and decreased by one point (S-1). ⑥ The logic is S+1 (accurate). S-1 (not allowed) ... S assignment can get the logical truth table Table 1 The logical truth table established by Boolean algebra S+1=1+1=1S-1=1-1=0 Table 2 The logical truth table established by weather forecast can be reduced to the logical framework of P (solving, NP (verifying) puzzle. The reading and writing head of Turing machine moves one frame to the left as S-1, Move one grid to the right, S+1, table 3, table 4. From the truth table of the logic table, it can be concluded that when s is assigned to 1, P=NP is recorded as PNP. For all classes p and all classes NP, there are two states of on and off by the circuit switch. The expression construction polynomial with 2 n exists s = 1+2+2 2+2 3+2 4+…+2 n and 2s = 2+2 2 3+2 4+…+2 (n+1) s = 2s-s, then s = 2. Formula, P≠NP. For single S=1 or S=0, a new logic table is constructed, and the logic formula s = 0 means that the read-write head keeps the current state, and the current state is rewritten to another state. The logic expression is s+1 (s = 0) s = 0, then Boolean algebra s+1 = 1s = 0s+1 = 1. It can be seen that there is also P=NP in single s = 0, that is S = 1s = 1, then S+1 = 1s = 1s = 1, then P≠NP. Synthesizing the above logical tables, it can be concluded that there are P-like problems equal to NP-like problems except Turing shutdown problems, and there are also P-like problems not equal to NP-like problems. Reference "Formal Logic" Jin Yuelin "Virtual and Real World" John L. Casty P52,P128 |
|
IP卡
狗仔卡
显身卡