相关论文: Natural Halting Probabilities, Partial Randomness,…

Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…

In the first of this pair of papers, it was proven that that no physical computer can correctly carry out all computational tasks that can be posed to it. The generality of this result follows from its use of a novel definition of…

It is well known that the kind of P systems involved in the definition of the P conjecture is able to solve problems in the complexity class $\mathbf{P}$ by leveraging the uniformity condition. Here we show that these systems are indeed…

We answer two questions posed by Castro and Cucker, giving the exact complexities of two decision problems about cardinalities of omega-languages of Turing machines. Firstly, it is $D_2(\Sigma_1^1)$-complete to determine whether the…

In the present paper, we show that under the Riemann hypothesis, and for fixed $h, \epsilon > 0$, the supremum of the real and the imaginary parts of $\log \zeta (1/2 + it)$ for $t \in [UT -h, UT + h]$ are in the interval $[(1-\epsilon)…

We give small universal Turing machines with state-symbol pairs of (6, 2), (3, 3) and (2, 4). These machines are weakly universal, which means that they have an infinitely repeated word to the left of their input and another to the right.…

Let $s(n)$ denote the number of ones in the binary expansion of a natural number $n\in\mathbb{N}$. For any $t\in\mathbb{N}$ and $d\in\mathbb{Z}$, let $\mu_t(d)$ denote the asymptotic density of the set of those natural numbers $n$ for which…

Multiple zeta values are real numbers defined by an infinite series generalizing values of the Riemann zeta function at positive integers. Finite truncations of this series are called multiple harmonic sums and are known to have interesting…

A numeration system originally implies a digitization of real numbers, but in this paper it rather implies a compactification of real numbers as a result of the digitization. By definition, a numeration system with $G$, where $G$ is a…

A resource-bounded version of the statement "no algorithm recognizes all non-halting Turing machines" is equivalent to an infinitely often (i.o.) superpolynomial speedup for the time required to accept any coNP-complete language and also…

We study generalised prime systems $\mathcal{P}$ $(1<p_1\leq p_2\leq...,$ with $p_j\in\R$ tending to infinity) and the associated Beurling zeta function $\zeta_{\mathcal{P}}(s) =\prod_{j=1}^{\infty} (1-p_j^{-s})^{-1}$. Under appropriate…

We introduce a framework to study the random entire function $\zeta_\beta$ whose zeros are given by the Sine$_\beta$ process, the bulk limit of beta ensembles. We present several equivalent characterizations, including an explicit power…

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

We show that probabilistic computable functions, i.e., those functions outputting distributions and computed by probabilistic Turing machines, can be characterized by a natural generalization of Church and Kleene's partial recursive…

In this article, we study microscopic properties of a two-dimensional eigenvalue ensemble near a conical singularity arising from insertion of a point charge in the bulk of the support of eigenvalues. In particular, we characterize all…

We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.

Turing's estimator allows one to estimate the probabilities of outcomes that either do not appear or only rarely appear in a given random sample. We perform a simulation study to understand the finite sample performance of several related…

Abelian cellular automata (CA) are CA which are group endomorphisms of the full group shift when endowing the alphabet with an abelian group structure. A CA randomizes an initial probability measure if its iterated images weak *-converge…

We prove absolute regularity ($\beta$-mixing) for nonstationary and multivariate versions of two popular classes of integer-valued processes. We show how this result can be used to prove asymptotic normality of a least squares estimator of…

An {\omega}-language is a set of infinite words over a finite alphabet X. We consider the class of recursive {\omega}-languages, i.e. the class of {\omega}-languages accepted by Turing machines with a B\"uchi acceptance condition, which is…