Related papers: Conditional algorithmic Mordell
In this paper, we provide refined sufficient conditions for the quadratic Chabauty method to produce a finite set of points, with the conditions on the rank of the Jacobian replaced by conditions on the rank of a quotient of the Jacobian…
We consider input-deterministic finite state transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality on infinite words. When these transducers are given by a strongly connected set of states,…
This paper analyzes infinitary nondeterministic computability theory. The main result is D $\ne$ ND $\cap$ coND where D is the class of sets decidable by infinite time Turing machines and ND is the class of sets recognizable by a…
An algebraic representation of the Turing machines is given, where the configurations of Turing machines are represented by 4 order tensors, and the transition functions by 8 order tensors. Two types of tensor product are defined, one is to…
We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin's Omega number, halting probability, and program-size complexity. A classification of Turing machines…
In this article we give a general approach to the following analogue of Shafarevich's conjecture for some polarized algebraic varieties; suppose that we fix a type of an algebraic variety and look at families of such type of varieties over…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…
In the moduli space of polarized varieties the same unpolarized variety can occur multiple times However, for K3 surfaces, compact hyperk\"ahler manifolds, and abelian varieties the number is finite. This may be viewed as a consequence of…
We study a class of meromorphic modular forms characterised by Fourier coefficients that satisfy certain divisibility properties. We present new candidates for these so-called magnetic modular forms, and we conjecture properties that these…
Products, multiplicative Chern characters, and finite coefficients, are unarguably among the most important tools in algebraic K-theory. Although they admit numerous different constructions, they are not yet fully understood at the…
Quantum Turing machines are discussed and reviewed in this paper. Most of the paper is concerned with processes defined by a step operator $T$ that is used to construct a Hamiltonian $H$ according to Feynman's prescription. Differences…
Faltings proved that there are finitely many abelian varieties of genus $g$ over a number field $K$, with good reduction outside a finite set of primes $S$. Fixing one of these abelian varieties $A$, we prove that there are finitely many…
Consider a universal Turing machine that produces a partial or total function (or a binary stream), based on the answers to the binary queries that it makes during the computation. We study the probability that the machine will produce a…
Let $k$ be an infinite finitely generated field of characteristic $p>0$. Fix a separated scheme $X$ smooth, geometrically connected, and of finite type over $k$ and a smooth proper morphism $f:Y\rightarrow X$. The main result of this paper…
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazirani who have shown that…
In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…
Let $V$ be a plane smooth cubic curve over a finitely generated field $k.$ The Mordell-Weil theorem for $V$ states that there is a finite subset $P\subset V(k)$ such that the whole $V(k)$ can be obtained from $P$ by drawing secants and…
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…
Using recent developments in coalgebraic and monad-based semantics, we present a uniform study of various notions of machines, e.g. finite state machines, multi-stack machines, Turing machines, valence automata, and weighted automata. They…
Infinite time Turing machines extend the operation of ordinary Turing machines into transfinite ordinal time. By doing so, they provide a natural model of infinitary computability, a theoretical setting for the analysis of the power and…