Related papers: Partial randomness and dimension of recursively en…
We present a simple model of a random walk with partial memory, which we call the \emph{random memory walk}. We introduce this model motivated by the belief that it mimics the behavior of the once-reinforced random walk in high dimensions…
We present two theorems concerned with algorithmic randomness and differentiability of functions of several variables. Firstly, we prove an effective form of the Rademacher's Theorem: we show that computable randomness implies…
In this brief paper the probability density of a random real, complex and quaternion determinant is rederived using singular values. The behaviour of suitably rescaled random determinants is studied in the limit of infinite order of the…
Algorithmic randomness theory starts with a notion of an individual random object. To be reasonable, this notion should have some natural properties; in particular, an object should be random with respect to image distribution if and only…
Let $E\subset\rr$ be a closed set of Hausdorff dimension $\alpha$. We prove that if $\alpha$ is sufficiently close to 1, and if $E$ supports a probabilistic measure obeying appropriate dimensionality and Fourier decay conditions, then $E$…
Let $\alpha$ be an irrational real number. We show that the set of $\epsilon$-badly approximable numbers \[ \mathrm{Bad}^\varepsilon (\alpha) := \{x\in [0,1]\, : \, \liminf_{|q| \to \infty} |q| \cdot \| q\alpha -x \| \geq \varepsilon \} \]…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
We study computable probably approximately correct (CPAC) learning, where learners are required to be computable functions. It had been previously observed that the Fundamental Theorem of Statistical Learning, which characterizes PAC…
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…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…
Pseudoentropy characterizations provide a quantitatively precise demonstration of the close relationship between computational hardness and computational randomness. We prove a unified pseudoentropy characterization that generalizes and…
We introduce a generalized Fourier ratio, the \(\ell^1/\ell^2\) norm ratio of coefficients in an \emph{arbitrary} orthonormal system, as a single, basis-invariant measure of \emph{effective dimension} that governs fundamental limits across…
The current work introduces the notion of pdominant sets and studies their recursion-theoretic properties. Here a set A is called pdominant iff there is a partial A-recursive function {\psi} such that for every partial recursive function…
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…
A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…
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…
An approximation of a real is a sequence of rational numbers that converges to the real. An approximation is left-c.e. if it is computable and nondecreasing and is d.c.e. if it is computable and has bounded variation. A real is computably…
We characterize some major algorithmic randomness notions via differentiability of effective functions. (1) As the main result we show that a real number z in [0,1] is computably random if and only if each nondecreasing computable function…
We show that given any non-computable left-c.e. real $\alpha$ there exists a left-c.e. real $\beta$ such that $\alpha\neq \beta+\gamma$ for all left-c.e. reals and all right-c.e. reals $\gamma$. The proof is non-uniform, the dichotomy being…