Related papers: New Computing Model of $GN_eTM$ Turing Machine On …
We present a detailed description of the essentially entropic lattice Boltzmann model. The entropic lattice Boltzmann model guarantees unconditional numerical stability by iteratively solving the nonlinear entropy evolution equation. In…
We first establish the existence of an unbounded solution to a backward stochastic differential equation (BSDE) with generator $g$ allowing a general growth in the state variable $y$ and a sub-quadratic growth in the state variable $z$,…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
Fixed point iterations are known to generate chaos, for some values in their parameter range. It is an established fact that Turing Machines are fixed point iterations. However, as these Machines operate in integer space, the standard…
It is a well-known result of Auslander and Reiten that contravariant finiteness of the class $\mathcal{P}^{\mathrm{fin}}_\infty$ (of finitely generated modules of finite projective dimension) over an Artin algebra is a sufficient condition…
In this paper a new conjecture equivalent to Collatz conjecture is presented. In particural, showing that (all) the solution(s) of newly introduced iterative functional equation(s) have a given property is equivalent to prove Collatz…
We analyze the notion of guessing model, a way to assign combinatorial properties to arbitrary regular cardinals. Guessing models can be used, in combination with inaccessibility, to characterize various large cardinals axioms, ranging from…
Associate a unique numerical sequence called the modular signature with each positive integer, using modular residues of each integer under the prime numbers, and distinguishing between the core seed primes and non-core seed primes used to…
In this paper, a modified formulation of generalized probabilistic theories that will always give rise to the structure of Hilbert space of quantum mechanics, in any finite outcome space, is presented and the guidelines to how to extend…
For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only if T halts, thus proving that the property of having definable principal subcongruences is…
The theory of finitely generated relative (co)tilting modules has been established in the 1980s by Auslander and Solberg, and infinitely generated relative tilting modules have recently been studied by many authors in the context of…
I show that physical devices that perform observation, prediction, or recollection share an underlying mathematical structure. I call devices with that structure "inference devices". I present a set of existence and impossibility results…
A certain mathematician M, considering some hypothesis H, conclusion C and text P, can arrive at one of the following judgments: (1) P does not convince M of the fact that since H, it follows that C; (2) P is the proof that since H, it…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
In this article we prove three main theorems: (1) guessing models are internally unbounded, (2) for any regular cardinal $\kappa \ge \omega_2$, $\textsf{ISP}(\kappa)$ implies that $\textsf{SCH}$ holds above $\kappa$, and (3) forcing posets…
In this paper we propose an alternative formulation of the binary and ternary Goldbach conjectures as the systems of equations involving the Euler $\phi$-function.
Mathematicians has been trying to prove the weak Goldbach's conjecture by adding prime numbers, as stated in the conjecture. However, we believe that the solution does not need to be analytically solved. Instead of trying to add prime…
Combining the approaches made in works with Galeotti and Passmann, we define and study a notion of "almost sure" realizability with parameter-free ordinal Turing machines (OTMs). In particular, we show that, in contrast to the classical…
In this paper, we prove the existence portion of the Bertram-Feinberg-Mukai Conjecture for an infinite family of new cases using degeneration technique. This not only leads to a substantial improvement of known results but also develops…
We study an abstract group of reversible Turing machines. In our model, each machine is interpreted as a homeomorphism over a space which represents a tape filled with symbols and a head carrying a state. These homeomorphisms can only…