Related papers: New Computing Model of $GN_eTM$ Turing Machine On …
We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a…
In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.
It is well known that the following Collatz Conjecture is one of the unsolved problems in mathematics. Collatz Conjecture: For any positive integer $n>1$, the following recursive algorithm will convergent to 1 by a finite number of steps.…
Fixing some computably enumerable theory $T$, the Friedman-Goldfarb-Harrington (FGH) theorem says that over elementary arithmetic, each $\Sigma_1$ formula is equivalent to some formula of the form $\Box_T \varphi$ provided that $T$ is…
This paper builds a cumulative tower of Grothendieck universes that provides a precise size discipline for higher type theory. Starting from an increasing sequence of inaccessible cardinals, we give an inductive-recursive definition of…
Number of results in number theory have been developed using a new method. The Goldbach binary conjecture in strengthened formulation have been among them.
From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…
We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.
In this paper we attack the Erdos-Straus conjecture by means of the structure of its solutions, extending and improving the results of a previous paper. Using previous results and supported by the works of Elsholtz and Tao and Monks and…
We prove an inverse ternary Goldbach-type result. Let $N$ be sufficiently large and $c>0$ be sufficiently small. If $A_1,A_2,A_3\subset [N]$ are subsets with $|A_1|,|A_2|,|A_3|\geq N^{1/3-c}$, then $A_1+A_2+A_3$ contains a composite number.…
In this paper, we interpret NDTM (NonDeterministic Turing Machine) used to define NP by tracing to the source of NP. Originally NP was defined as the class of problems solvable in polynomial time by a NDTM in the theorem of Cook, where the…
In this work, we present a proof of the existence of real and ordered solutions to the generalized Bethe Ansatz equations for the one dimensional Hubbard model on a finite lattice, with periodic boundary conditions. The existence of a…
We explore the Collatz conjecture and its variants through the lens of termination of string rewriting. We construct a rewriting system that simulates the iterated application of the Collatz function on strings corresponding to mixed…
This paper presents a conception for computing gr\"{o}bner basis. We convert some of gr\"{o}bner-computing algorithms, e.g., F5, extended F5 and GWV algorithms into a special type of algorithm. The new algorithm's finite termination problem…
The study of modules over a finite von Neumann algebra ${\mathcal A}$ can be advanced by the use of torsion theories. In this work, some torsion theories for ${\mathcal A}$ are presented, compared and studied. In particular, we prove that…
This paper contains a proof of a conjecture of Breuil and Schneider, on the existence of an invariant norm on any locally algebraic representation of $\GL(n)$, with integral central character, whose smooth part is given by a generalized…
We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detecting cardinal stages of computation. The computational strength…
In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is…
In this thesis noncommutative gauge theory is extended beyond the canonical case, i.e. to structures where the commutator no longer is a constant. In the first part noncommutative spaces created by star-products are studied. We are able to…
There are enormous amount of examples of Computation in nature, exemplified across multiple species in biology. One crucial aim for these computations across all life forms their ability to learn and thereby increase the chance of their…