Related papers: Normal numbers and limit computable Cantor series
For every countable ordinal number $\alpha$ we construct an entire function $f=f_\alpha$ such that the family $\left\{f(nz):n\in\mathbb{N}\right\}$ is exactly $Q_\alpha$-normal in the unit disk.
The article is devoted to the alternating Cantor series. It is proved that any real number belonging to $[a_0-1;a_0]$, where $a_0=\sum^{\infty} _{k=1} {\frac{d_{2k}-1}{d_1d_2...d_{2k}}} $, has no more than two representations by the series…
The uncountability of the real numbers is one of their most basic properties, known (far) outside of mathematics. Cantor's 1874 proof of the uncountability of the real numbers even appears in the very first paper on set theory, i.e. a…
We define a random Liouville function (\lambda_Q) which depends on a random set (Q) of primes and prove that (A_Q = \{n \in \mathbb{N} | \lambda_Q(n) = -1 \}) is normal almost everywhere. This fact enables us to generate a family of normal…
In the present paper the authors construct normal numbers in base $q$ by concatenating $q$-adic expansions of prime powers $\lfloor\alpha p^\theta\rfloor$ with $\alpha>0$ and $\theta>1$.
We consider the issue of computability at the most fundamental level of physical reality: the Planck scale. To this aim, we consider the theoretical model of a quantum computer on a non commutative space background, which is a computational…
We give a construction of a real number that is normal to all integer bases and continued fraction normal. The computation of the first n digits of its continued fraction expansion performs in the order of n^4 mathematical operations. The…
We propose a definition of quantum computable functions as mappings between superpositions of natural numbers to probability distributions of natural numbers. Each function is obtained as a limit of an infinite computation of a quantum…
Given a real number $0.a_1a_2 a_3\dots$ that is normal to base $b$, we examine increasing sequences $n_i$ so that the number $0.a_{n_1}a_{n_2}a_{n_3}\dots$ are normal to base $b$. Classically it is known that if the $n_i$ form an arithmetic…
Let $L=(L_d)_{d \in \mathbb N}$ be any ordered probability sequence, i.e., satisfying $0 < L_{d+1} \le L_d$ for each $d \in \mathbb N$ and $\sum_{d \in \mathbb N} L_d =1$. We construct sequences $A = (a_i)_{i \in \mathbb N}$ on the…
We define a class of "algebraic" random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate the low SNR series expansion coefficients in closed form. We…
A real number \alpha is called recursively enumerable if there exists a computable, increasing sequence of rational numbers which converges to \alpha. The randomness of a recursively enumerable real \alpha can be characterized in various…
Cantor's diagonal method is traditionally used to prove the uncountability of the set of all infinite binary sequences. This paper analyzes the expressive limits of this method. It is shown that under any constructive application --…
We explore in depth the number theoretic and statistical properties of certain sets of numbers arising from their Cantor series expansions. As a direct consequence of our main theorem we deduce numerous new results as well as strengthen…
We prove that a real number a greater than or equal to 2 is the irrationality exponent of some computable real number if and only if a is the upper limit of a computable sequence of rational numbers. Thus, there are computable real numbers…
It is a long-standing open question in quantum complexity theory whether the definition of $\textit{non-deterministic}$ quantum computation requires quantum witnesses $(\textsf{QMA})$ or if classical witnesses suffice $(\textsf{QCMA})$. We…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
The central limit theorem ensures that a sum of random variables tends to a Gaussian distribution as their total number tends to infinity. However, for a class of positive random variables, we find that the sum tends faster to a log-normal…
We analyze the convergence order of an algorithm producing the digits of an absolutely normal number. Furthermore, we introduce a stronger concept of absolute normality by allowing Pisot numbers as bases, which leads to expansions with…
Kleene's computability theory based on his S1-S9 computation schemes constitutes a model for computing with objects of any finite type and extends Turing's `machine model' which formalises computing with real numbers. A fundamental…