Related papers: A note on the differences of computably enumerable…
Stochastic optimization algorithms have become indispensable in modern machine learning. An unresolved foundational question in this area is the difference between with-replacement sampling and without-replacement sampling -- does the…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
Exploring further the properties of ITRM-recognizable reals, we provide a detailed analysis of recognizable reals and their distribution in G\"odels constructible universe L. In particular, we show that, for unresetting infinite time…
Using a theorem proved by Bekka and Driutti, we show that if $\mathfrak{f}$ is a freely generated nilpotent Lie algebra of step-two, then almost every irreducible representation of the corresponding Lie group restricted to some lattice…
Let $G$ be a connected compact group equipped with the normalised Haar measure $\mu$. Our first result shows that given $\alpha, \beta>0$, there is a constant $c = c(\alpha,\beta)>0$ such that for any compact sets $A,B\subseteq G$ with $…
We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…
We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense…
Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…
In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion…
The \emph{International Obfuscated C Code Contest} was a programming contest for the most creatively obfuscated yet succinct C code. By \emph{contrast}, an interest herein is in programs which are, \emph{in a sense}, \emph{easily} seen to…
We consider a homogeneous system of linear equations of the form $A_\alpha^{\otimes N} {\bf x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_\alpha$ depends on a…
Kac's lemma determines the expected return time to a set of positive measure under iterations of an ergodic probability preserving transformations. We introduce the notion of an \emph{allocation} for a probability preserving action of a…
The Bell inequality is derived under the assumption of three physical data sets, random or deterministic. The data sets represent a laboratory realization of the three probability based variables used by Bell. For physical data as can be…
Let $\eta_i$, $i\ge 1$, be a sequence of independent and identically distributed random variables with finite third moment, and let $\Delta_n$ be the total variation distance between the distribution of $S_n:=\sum_{i=1}^n\eta_i$ and the…
According to Deutsch, a universal quantum Turing machine (UQTM) is able to perform, in repeating a fixed unitary transformation on the total system, an arbitrary unitary transformation on an arbitrary data state, by including a program as…
We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…
Let $P_r(n)$ be the set of partitions of n with non negative rth differences. Let $\lambda$ be a partition chosen uniformly at random among the set $P_r(n)$. Let $d(\lambda)$ be a positive rth difference chosen uniformly at random in…
LC-loops, RC-loops and C-loops are collectively called central loops. It is shown that an LC(RC)-loop is a left(right) universal loop. But an LC(RC)-loop is a universal loop if and only if it is a right(left) universal loop. It is observed…
We characterize the points that satisfy Birkhoff's ergodic theorem under certain computability conditions in terms of algorithmic randomness. First, we use the method of cutting and stacking to show that if an element x of the Cantor space…
A central limit theorem for arrays of symmetric row-wise exchangeable random variables is presented. The result is valid for finite and infinite extendable and non-extendable sequences. Unlike most reported versions of the central limit…