Related papers: Normal numbers and limit computable Cantor series
In this paper we study the distribution of the real algebraic numbers. Given an interval $I$, a positive integer $n$ and $Q>1$, define the counting function $\Phi_n(Q;I)$ to be the number of algebraic numbers in $I$ of degree $n$ and height…
Kleene's computability theory based on the 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…
We show that for each computable ordinal $\alpha>0$ it is possible to find in each Martin-L\"of random $\Delta^0_2$ degree a sequence $R$ of Cantor-Bendixson rank $\alpha$, while ensuring that the sequences that inductively witness $R$'s…
In this article we call a sequence $(a_n)_n$ of elements of a metric space nearly computably Cauchy if for every strictly increasing computable function $r:\mathbb{N}\to\mathbb{N}$ the sequence $(d(a_{r(n+1)},a_{r(n)}))_n$ converges…
Given a Coxeter system of large type we prove a non--commutative central limit theorem: After normalisation with the square root of n the characteristic function of the set of the first n generators tends in distribution to Wigners…
The large-beta_0 limit of QCD is discussed, with the emphasize on simple technical methods of calculating various quantities at the order 1/\beta_0. Many examples, mainly from heavy quark physics, are considered. Some QCD results based on…
In this article, first we give two formulae for the delta invariant of a complex curve singularity that can be embedded as a ${\mathbb Q}$-Cartier divisor in a normal surface singularity with rational homology sphere link. Next, we consider…
The bandwidth of a signal is an important physical property that is of relevance in many signal- and information-theoretic applications. In this paper we study questions related to the computability of the bandwidth of computable…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…
Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…
The concept of ``countable set'' is attributed to Georg Cantor, who set the boundary between countable and uncountable sets in 1874. The concept of ``computable set'' arose in the study of computing models in the 1930s by the founders of…
In this paper we investigate algorithmic randomness on more general spaces than the Cantor space, namely computable metric spaces. To do this, we first develop a unified framework allowing computations with probability measures. We show…
A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As…
This paper outlines new paradigms for real analysis and computability theory in the recently proposed non-Aristotelian finitary logic (NAFL). Constructive real analysis in NAFL (NRA) is accomplished by a translation of diagrammatic concepts…
In \cite{SchmidtGames}, W. Schmidt proved that the set of non-normal numbers in base $b$ is a {\it winning set}. We generalize this result by proving that many sets of non-normal numbers with respect to the Cantor series expansion are…
In 1949 Wall showed that $x = 0.d_1d_2d_3 \dots$ is normal if and only if $(0.d_nd_{n+1}d_{n+2} \dots)_n$ is a uniformly distributed sequence. In this article, we consider sequences which are slight variants on this. In particular, we show…
We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…
Let $Z$ be a standard normal random variable (r.v.). It is shown that the distribution of the r.v. $\ln|Z|$ is infinitely divisible; equivalently, the standard normal distribution considered as the distribution on the multiplicative group…
In this paper we look at the topological type of algebraic sum of achievement sets. We show that there is a Cantorval such that the algebraic sum of its $k$ copies is still a Cantorval for any $k \in \mathbb{N}$. We also prove that for any…
Kawamura and Cook have developed a framework for studying the computability and complexity theoretic problems over "large" topological spaces. This framework has been applied to study the complexity of the differential operator and the…