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

We study Brown's definition of the probabilistic zeta function of a finite lattice as a generalization of that of a finite group. We propose a natural alternative or extension that may be better suited for non-atomistic lattices. The…

We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, can not avoid the notion of halting to be probabilistic in Quantum…

We advance a Bayesian concept of 'intrinsic asymptotic universality' taking to its final conclusions previous conceptual and numerical work based upon a concept of a reprogrammability test and an investigation of the complex qualitative…

Chaitin's work, in its depth and breadth, encompasses many areas of scientific and philosophical interest. It helped establish the accepted mathematical concept of randomness, which in turn is the basis of tools that I have developed to…

We introduce a theory of probabilistic renormalization for series, the renormalized values being encoded in the expectation of a certain random variable on the set of natural numbers. We identify a large class of weakly renormalizable…

We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…

We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of Turing machines that we call "branching Turing machines" (which includes most of the known examples…

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…

Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every…

The $\Omega$ numbers-the halting probabilities of universal prefix-free machines-are known to be exactly the Martin-L{\"o}f random left-c.e. reals. We show that one cannot uniformly produce, from a Martin-L{\"o}f random left-c.e. real…

It would be a heavenly reward if there were a method of weighing theories and sentences in such a way that a theory could never prove a heavier sentence (Chaitin's Heuristic Principle). Alas, no satisfactory measure has been found so far,…

In 1975, Chaitin introduced his celebrated Omega number, the halting probability of a universal Chaitin machine, a universal Turing machine with a prefix-free domain. The Omega number's bits are {\em algorithmically random}--there is no…

Partial zeta functions of algebraic varieties over finite fields generalize the classical zeta function by allowing each variable to be defined over a possibly different extension field of a fixed finite field. Due to this extra variation…

This paper provides a probabilist point of view about some results in analytic number theory. The main tool is the family of Zeta laws, which is a consolation for the non-existence of an uniform law on the set of integers. We prove the…

In a recent article we have discussed the connections between averages of powers of Riemann's $\zeta$-function on the critical line, and averages of characteristic polynomials of random matrices. The result for random matrices was shown to…

Recently, Keating and the second author of this paper devised a heuristic for predicting asymptotic formulas for moments of the Riemann zeta-function $\zeta(s)$. Their approach indicates how lower twisted moments of $\zeta(s)$ may be used…

Finite Euler product is known to be one of the classical zeta functions in number theory. In [1], [2] and [3], we have introduced some multivariable zeta functions and studied their definable probability distributions on R^d. They include…

The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…

We introduce new genuine zetas. There are two types, i.e., the pure non- abelian zetas defined using semi-stable bundles, and the group zetas defined for reductive groups. Basic properties such as rationality and functional equation are…

We apply recent ideas about complexity and randomness to the philosophy of laws and chances. We develop two ways to use algorithmic randomness to characterize probabilistic laws of nature. The first, a generative chance* law, employs a…