Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2112.13205

New Computing Model of $GN_eTM$ Turing Machine On Solving Even Goldbach Conjecture

Bogang Lin
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 $G{{N}_{e}}TM$ 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 $\bmod \overset{\equiv }{\mathop{M}}\,({{N}_{e}})$. 2. In the controller of the $G{{N}_{e}}TM$ 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\overset{\equiv }{\mathop{X}}\,(p)$ and is proved to be equivalent. Therefore, it proves indirectly that the model $G{{N}_{e}}TM$ does not exist halting problem, and it also indicate that the even Goldbach conjecture is infinity existence.

Explore related subjects

cs.CC

Keep this discovery

BibTeXRIS

Bogang Lin. 2021-12-25. New Computing Model of $GN_eTM$ Turing Machine On Solving Even Goldbach Conjecture. https://arxiv.org/abs/2112.13205

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗