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

The halting probabilities of universal prefix-free machines are universal for the class of reals with computably enumerable left cut (also known as left-c.e. reals), and coincide with the Martin-Loef random elements of this class. We study…

We consider partial sums of a weighted Steinhaus random multiplicative function and view this as a model for the Riemann zeta function. We give a description of the tails and high moments of this object. Using these we determine the likely…

An a priori semimeasure (also known as "algorithmic probability" or "the Solomonoff prior" in the context of inductive inference) is defined as the transformation, by a given universal monotone Turing machine, of the uniform measure on the…

This analysis which uses new mathematical methods aims at proving the Riemann hypothesis and figuring out an approximate base for imaginary non-trivial zeros of zeta function at very large numbers, in order to determine the path that those…

Previously, the author introduced quasirandom permutations, permutations of $\mathbb{Z}_n$ which map intervals to sets with low discrepancy. Here we show that several natural number-theoretic permutations are quasirandom, some very strongly…

Kolmogorov complexity and algorithmic probability are defined only up to an additive resp. multiplicative constant, since their actual values depend on the choice of the universal reference computer. In this paper, we analyze a natural…

Beginning with Turing's seminal work in 1950, artificial intelligence proposes that consciousness can be simulated by a Turing machine. This implies a potential theory of everything where the universe is a simulation on a computer, which…

Universality is one of the most important ideas in computability theory. There are various criteria of simplicity for universal Turing machines. Probably the most popular one is to count the number of states/symbols. This criterion is more…

A generalization of the Apery-like numbers, which is used to describe the special values $\zeta_Q(2)$ and $\zeta_Q(3)$ of the spectral zeta function for the non-commutative harmonic oscillator, are introduced and studied. In fact, we give a…

We study a general type of series and relate special cases of it to Stirling series, infinite series discussed by Choi and Hoffman, and also to special values of the Arakawa-Kaneko zeta function, complementing and generalizing earlier…

Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…

In this paper, we study various twisted A-harmonic sums, named following the seminal log-algebraicity papers of G. Anderson. These objects are partial sums of new types of special zeta values introduced by the first author and linked to…

We study the convergence speed of the batch learning algorithm, and compare its speed to that of the memoryless learning algorithm and of learning with memory (as analyzed in joint work with N. Komarova). We obtain precise results and show…

We introduce the Hadamard topology on the Witt ring of rational functions, giving a simultaneous refinement of the weight and point-counting topologies. Zeta functions of algebraic varieties over finite fields are elements of the rational…

A semi-analytic method to compute the first coefficients of the renormalization group functions on a random lattice is introduced. It is used to show that the two-dimensional $O(N)$ non-linear $\sigma$-model regularized on a random lattice…

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

Motivated by a probabilistic analysis of a simple game (itself inspired by a problem in computational learning theory) we introduce the \emph{moment zeta function} of a probability distribution, and study in depth some asymptotic properties…

We focus on a well-known convergence phenomenon, the fact that the $\zeta$ zeros are the universal singularities of certain Euler products.

Since human randomness production has been studied and widely used to assess executive functions (especially inhibition), many measures have been suggested to assess the degree to which a sequence is random-like. However, each of them…

This paper reviews the Church-Turing Thesis (or rather, theses) with reference to their origin and application and considers some models of "hypercomputation", concentrating on perhaps the most straight-forward option: Zeno machines (Turing…