相关论文: Natural Halting Probabilities, Partial Randomness,…
In this thesis, we introduce a new quantum Turing machine (QTM) model that supports general quantum operators, together with its pushdown, counter, and finite automaton variants, and examine the computational power of classical and quantum…
We prove that if $\omega$ is uniformly distributed on $[0,1]$, then as $T\to\infty$, $t\mapsto \zeta(i\omega T+it+1/2)$ converges to a non-trivial random generalized function, which in turn is identified as a product of a very well behaved…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
The complexity class $NP$ can be logically characterized both through existential second order logic $SO\exists$, as proven by Fagin, and through simulating a Turing machine via the satisfiability problem of propositional logic SAT, as…
The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially,…
We position Turing's result regarding the undecidability of the halting problem as a result about programs rather than machines. The mere requirement that a program of a certain kind must solve the halting problem for all programs of that…
We introduce a new method for studying murmurations, based on random matrix theory. With this method, we exhibit murmurations or similar phenomena: assuming ratios conjectures, for elliptic curves ordered by height, quadratic twists of a…
Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
In recent work, Fyodorov and Keating conjectured the maximum size of $|\zeta(1/2+it)|$ in a typical interval of length O(1) on the critical line. They did this by modelling the zeta function by the characteristic polynomial of a random…
Herein we survey the main results concerning quantum automata and machines with classical control. These machines were originally proposed by Sernadas et al in [37], during the FCT QuantLog project. First, we focus on the expressivity of…
Taking $t$ at random, uniformly from $[0,T]$, we consider the $k$th moment, with respect to $t$, of the random variable corresponding to the $2\beta$th moment of $\zeta(1/2+ix)$ over the interval $x\in(t, t+1]$, where $\zeta(s)$ is the…
Complexity classes such as $\#\mathbf{P}$, $\oplus\mathbf{P}$, $\mathbf{GapP}$, $\mathbf{OptP}$, $\mathbf{NPMV}$, or the class of fuzzy languages realised by polynomial-time fuzzy nondeterministic Turing machines, can all be described in…
A remarkable new definition of a self-delimiting universal Turing machine is presented that is easy to program and runs very quickly. This provides a new foundation for algorithmic information theory. This new universal Turing machine is…
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…
We propose a regularization technique and apply it to the Euler product of zeta functions, mainly of the Riemann zeta function, to make unknown some clear. In this paper that is the first part of the trilogy, we try to demonstrate the…
The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures involving even…
We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating $n$-dimensional complexity by using an $n$-dimensional deterministic Turing…
We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…
We study randomness beyond $\Pi^1_1$-randomness and its Martin-L\"of type variant, introduced in \cite{MR2340241} and further studied in \cite{Continuous-higher-randomness}. The class given by the infinite time Turing machines (\ITTM s),…