New Computing Model of GN_eTM Turing Machine On Solving Even Goldbach Conjecture
share
Based on the propositional description of even Goldbach conjecture, in order to verify the truth of even Goldbach conjecture, we will deeply discuss this question and present a new computing model of GN_eTM Turing Machine. This paper proves the infinite existence of even Goldbach's conjecture and obtains the following new results: 1. The criterion of general probability speculation of the existence judgment for even Goldbach conjecture is studied, and which at least have a formula satisfy the deduction result of matching requirements for even Goldbach conjecture in the model ≡M (N_e). 2. In the controller of the GN_eTM model, the algorithm problem of the prime matching rule is given, regardless of whether the computer can be recursively solved, the rule algorithm for designing prime numbers in controllers is computer recursively solvable. 3. The judgment problem that about even Goldbach conjecture whether infinite existence is studied. The new research result has shown that according to the constitution model of the full arranged matrix of given even number N_e, and if only given an even number N_e, it certainly exists the matrix model Mod≡X (p) and is proved to be equivalent. Therefore, it proves indirectly that the model GN_eTM does not exist halting problem, and it also indicate that the even Goldbach conjecture is infinity existence.
READ FULL TEXT