Related papers: Relations between randomness deficiencies
The coincidence-time loophole was identified by Larsson & Gill (Europhys. Lett. 67, 707 (2004)); a concrete model that exploits this loophole has recently been described by De Raedt et al. (Found. Phys., to appear). It is emphasized here…
The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences $A$ and $B$, $B$ is Martin-L\"of random and $A$ is…
We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes…
The randomness rate of an infinite binary sequence is characterized by the sequence of ratios between the Kolmogorov complexity and the length of the initial segments of the sequence. It is known that there is no uniform effective procedure…
We consider a class of non-homogeneous Markov chains, that contains many natural examples. Next, using martingale methods, we establish some deviation and moment inequalities for separately Lipschitz functions of such a chain, under moment…
Given a stochastic process $\{A_n, n \geq 1\}$ taking values in natural numbers, the random continued fractions is defined as $[A_1, A_2, \cdots, A_n, \cdots]$ analogue to the continued fraction expansion of real numbers. Assume that…
The theory of random real numbers is exceedingly well-developed, and fascinating from many points of view. It is also quite challenging mathematically. The present notes are intended as no more than a gateway to the larger theory. They…
The broken random sample problem was first introduced by DeGroot, Feder, and Gole (1971, Ann. Math. Statist.): in each observation (batch), a random sample of $M$ i.i.d. point pairs $ ((X_i,Y_i))_{i=1}^M$ is drawn from a joint distribution…
We define twelve variants of a Reifenberg's affine approximation property, which are known to be connected with the singular sets of minimal surfaces. With this motivation we investigate the regularity of the sets possessing these. We…
We register a random sequence which has the following properties: it has three segments being the homogeneous Markov processes. Each segment has his own one step transition probability law and the length of the segment is unknown and…
In order to study large variations or fluctuations of finite or infinite sequences (time series), we bring to light an 1868 paper of Crofton and the (Cauchy-)Crofton theorem. After surveying occurrences of this result in the literature, we…
Imagine a sequence in which the first letter comes from a binary alphabet, the second letter can be chosen on an alphabet with 10 elements, the third letter can be chosen on an alphabet with 3 elements and so on. When such a sequence can be…
An inequality for the variance of an additive function defined on random decomposable structures, called assemblies, is established. The result generalizes estimates obtained earlier in the cases of permutations and mappings of a finite set…
A Martin-L\"of test $\mathcal U$ is universal if it captures all non-Martin-L\"of random sequences, and it is optimal if for every ML-test $\mathcal V$ there is a $c \in \omega$ such that $\forall n(\mathcal{V}_{n+c} \subseteq…
It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…
Different questions lead to the same class of functions from natural integers to integers: those which have integral difference ratios, i.e. verifying $f(a)-f(b)\equiv0 \pmod {(a-b)}$ for all $a>b$. We characterize this class of functions…
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…
The theory of rough sets was firstly introduced by Pawlak (see \cite{p}). Many Mathematician has been studied the relations between rough sets and algebraic systems such as groups, rings and modules. In this paper we will introduce the…
This paper proposes an alternative language for expressing results of the algorithmic theory of randomness. The language is more precise in that it does not involve unspecified additive or multiplicative constants, making mathematical…
Random residue sequences (RR) may be used in many random number applications including those related to multiple access in communications. This paper investigates variations on an algorithm to generate RR sequences that was proposed earlier…