Related papers: Luzin's (N) and randomness reflection

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an…

A fruitful way of obtaining meaningful, possibly concrete, algorithmically random numbers is to consider a potential behaviour of a Turing machine and its probability with respect to a measure (or semi-measure) on the input space of binary…

This expository paper advocates an approach to physics in which ``typicality" is identified with a suitable form of algorithmic randomness. To this end various theorems from mathematics and physics are reviewed. Their original versions…

Let $f$ be a function or distribution on $\rr d$. We show that $f$ belongs to a certain Pilipovi{\'c} space, if and only if $f$ and suitable partial fractional Fourier transforms of $f$ satisfy certain types of estimates.

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…

Fractional moments have been investigated by many authors to represent the density of univariate and bivariate random variables in different contexts. Fractional moments are indeed important when the density of the random variable has…

A rational function $f(x)$ is rationally summable if there exists a rational function $g(x)$ such that $f(x)=g(x+1)-g(x)$. Detecting whether a given rational function is summable is an important and basic computational subproblem that…

Let $f:\mathbb{R}^n\to\mathbb{R}$ be a function. Assume that for a measurable set $\Omega$ and almost every $x\in\Omega$ there exists a vector $\xi_x\in\mathbb{R}^n$ such that $$\liminf_{h\to 0}\frac{f(x+h)-f(x)-\langle \xi_x,…

In this paper, we will generalize the definition of partially random or complex reals, and then show the duality of random and complex, i.e., a generalized version of Levin-Schnorr's theorem. We also study randomness from the view point of…

The notion of random sequence was introduced by Martin-Loef in 1966. At the same time he defined the so-called randomness deficiency function that shows how close are random sequences to non-random (in some natural sense). Other deficiency…

A function $f:\mathbb{Z}_n \to \mathbb{C}$ can be represented as a linear combination $f(x)=\sum_{\alpha \in \mathbb{Z}_n}\widehat{f}(\alpha) \chi_{\alpha,n}(x)$ where $\widehat{f}$ is the (discrete) Fourier transform of $f$. Clearly, the…

We prove that a Radon measure $\mu$ on $\mathbb{R}^n$ can be written as $\mu=\sum_{i=0}^n\mu_i$, where each of the $\mu_i$ is an $i$-dimensional rectifiable measure if and only if for every Lipschitz function $f:\mathbb{R}^n\to\mathbb{R}$…

The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…

We completely characterize orbit reflexivity and R-orbit reflexivity for square matrices over the real numbers. Unlike the complex case in which every matrix is orbit reflexive and C-orbit reflexivity is characterized solely in terms of the…

A set C of reals is said to be negligible if there is no probabilistic algorithm which generates a member of C with positive probability. Various classes have been proven to be negligible, for example the Turing upper-cone of a…

We study Luzin N-property with respect to the Hausdorff measures for Sobolev spaces W^k_p(R^n,R^d). We prove that such N-property holds except for one critical dimensional value t_*=n-(k-1)p; for this critical value the N-property fails in…

We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

Let $\succsim$ be a binary relation on the set of simple lotteries over a countable outcome set $Z$. We provide necessary and sufficient conditions on $\succsim$ to guarantee the existence of a set $U$ of von Neumann--Morgenstern utility…