Related papers: Differences of halting probabilities
Suppose $\mu$ and $\nu$ are probability measures on $\mathbb R$ satisfying $\mu \leq_{cx} \nu$. Let $a$ and $b$ be convex functions on $\mathbb R$ with $a \geq b \geq 0$. We are interested in finding \[ \sup_{\mathcal M} \sup_{\tau}…
This is a joint introduction to classical and free probability, which are twin sisters. We first review the foundations of classical probability, notably with the main limiting theorems (CLT, CCLT, PLT, CPLT), and with a look into examples…
A remarkable achievement in algorithmic randomness and algorithmic information theory was the discovery of the notions of K-trivial, K-low and Martin-Lof-random-low sets: three different definitions turns out to be equivalent for very…
Universal dimensionless quantities, such as Binder ratios and wrapping probabilities, play an important role in the study of critical phenomena. We study the finite-size scaling behavior of the wrapping probability for the Potts model in…
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
Termination analysis of linear loops plays a key r\^{o}le in several areas of computer science, including program verification and abstract interpretation. Already for the simplest variants of linear loops the question of termination…
An enumerative invariant theory in Algebraic Geometry, Differential Geometry, or Representation Theory, is the study of invariants which 'count' $\tau$-(semi)stable objects $E$ with fixed topological invariants $[E]=\alpha$ in some…
Let $\alpha, \beta \in (0,1)$ such that at least one of them is irrational. We take a random walk on the real line such that the choice of $\alpha$ and $\beta$ has equal probability $1/2$. We prove that almost surely the $\alpha\beta$-orbit…
Given a sequence $(M^n)^{\infty}_{n=1}$ of nonnegative martingales starting at $M^n_0=1$, we find a sequence of convex combinations $(\widetilde{M}^n)^{\infty}_{n=1}$ and a limiting process $X$ such that…
A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…
We consider the totally asymmetric exclusion process on a ring in discrete time with the backward-ordered sequential update and particle-dependent hopping probabilities. Using a combinatorial treatment of the Bethe ansatz, we derive the…
One-parameter natural exponential family (NEF) plays fundamental roles in probability and statistics. This article contains two independent results: (a) A conjecture of Bar-Lev, Bshouty and Enis states that a polynomial with a simple root…
Polynomial closure is a standard operator which is applied to a class of regular languages. In the paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while…
In a recent article by Chapuy and Perarnau, it was shown that a uniformly chosen automaton on $n$ states with a $2$-letter alphabet has a synchronizing word of length $O(\sqrt{n}\log n)$ with high probability. In this note, we improve this…
This article, dedicated to Herbert Saul Wilf on the occaison of his forthcoming 80-th birthday, describes two complementary approaches to enumeration, the "positive" and the "negative", each with its advantages and disadvantages. Both…
The main purpose of this paper is to show that we can exploit the difference ($l_1$-norm and $l_2$-norm) in the probability calculation between quantum and probabilistic computations to claim the difference in their space efficiencies. It…
This paper studies random cubical sets in $\mathbb{R}^d$. Given a cubical set $X\subset \mathbb{R}^d$, a random variable $\omega_Q\in[0,1]$ is assigned for each elementary cube $Q$ in $X$, and a random cubical set $X(t)$ is defined by the…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…
The prefix palindromic length $PPL_u(n)$ of an infinite word $u$ is the minimal number of concatenated palindromes needed to express the prefix of length $n$ of $u$. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that…
We study the task, for a given language $L$, of enumerating the (generally infinite) sequence of its words, without repetitions, while bounding the delay between two consecutive words. To allow for delay bounds that do not depend on the…