Related papers: Algorithmic randomness and splitting of supermarti…
In this paper we study the path-regularity and martingale properties of the set-valued stochastic integrals defined in our previous work Ararat et al. (2023). Such integrals have some fundamental differences from the well-known…
Randomness comes in two qualitatively different forms. Apparent randomness can result both from ignorance or lack of control of degrees of freedom in the system. In contrast, intrinsic randomness should not be ascribable to any such cause.…
We define a random commuting $d$-tuple of $n$-by-$n$ matrices to be a random variable that takes values in the set of commuting $d$-tuples and has a distribution that is a rapidly decaying continuous weight on this algebraic set. In the…
Since many real-world problems arising in the fields of compiler optimisation, automated software engineering, formal proof systems, and so forth are equivalent to the Halting Problem--the most notorious undecidable problem--there is a…
We extend the class of semimartingales in a natural way. This allows us to incorporate processes having paths that leave the state space R^d. In particular Markov processes related to sub-Markovian kernels, but also non-Markovian processes…
An infinite binary sequence is deemed to be random if it has all definable properties that hold almost surely for the usual probability measure on the set of infinite binary sequences. There are only countably many such properties, so it…
Randomness is fundamental in quantum theory, with many philosophical and practical implications. In this paper we discuss the concept of algorithmic randomness, which provides a quantitative method to assess the Borel normality of a given…
This work starts from definition of randomness, the results of algorithmic randomness are analyzed from the perspective of application. Then, the source and nature of randomness is explored, and the relationship between infinity and…
A number of writers have supposed that for the full specification of belief, higher order probabilities are required. Some have even supposed that there may be an unending sequence of higher order probabilities of probabilities of…
We construct a class of nonnegative martingale processes that oscillate indefinitely with high probability. For these processes, we state a uniform rate of the number of oscillations and show that this rate is asymptotically close to the…
We study the termination problem for nondeterministic recursive probabilistic programs. First, we show that a ranking-supermartingales-based approach is both sound and complete for bounded terminiation (i.e., bounded expected termination…
After a short review of the historical milestones on normal numbers, we introduce the Borel numbers as the reals admitting a probability function on their different bases representations. In this setting, we provide two probabilistic…
We prove that for many ranks r<2m-2, random rank r mixed states in bipartite mxm systems have relatively high Schmidt numbers, which is based on algebraic-geometric separability criterion proved in [1]. This also means that the…
We introduce the notion of a reproducible algorithm in the context of learning. A reproducible learning algorithm is resilient to variations in its samples -- with high probability, it returns the exact same output when run on two samples…
We study the probability that the product of two randomly chosen elements in a finite ring $R$ is equal to some fixed element $x \in R$. We calculate this probability for semisimple rings and some special classes of local rings, and find…
We introduce scalable algorithms for online learning of neural network parameters and Bayesian sequential decision making. Unlike classical Bayesian neural networks, which induce predictive uncertainty through a posterior over model…
An important question for a probabilistic program is whether the probability mass of all its diverging runs is zero, that is that it terminates "almost surely". Proving that can be hard, and this paper presents a new method for doing so; it…
Given a positive random variable $X$, $X\ge0$ a.s., a null hypothesis $H_0:E(X)\le\mu$ and a random sample of infinite size of $X$, we construct test supermartingales for $H_0$, i.e. positive processes that are supermartingale if the null…
The notion of probability plays an important role in almost all areas of science and technology. In modern mathematics, however, probability theory means nothing other than measure theory, and the operational characterization of the notion…
In this paper we deal with the following problem: how does the structure of a finite semigroup $S$ depend on the probability that two elements selected at random from $S$, with replacement, define the same inner right translation of $S$. We…