Related papers: Randomness is valid at large numbers
Statistics is one of the most valuable of disciplines. Science is based on proof and it alone produces results, other approaches are not, and do not. Statistics is the only acceptable language of proof in science. Yet statistics is…
A new version of a strong law of large numbers for a ``good'' pairwise independent sequence of random variables (r.v.'s) with a small part of ``bad'' dependent r.v.'s is proposed. The main goal is to relax the assumption on the existence of…
For two independent, almost surely finite random variables, independence of their minimum (time) and the event that one of them is either greater, equal or less than the other (cause) is completely characterized. It is shown that, other…
I will propose the notion that the universe is digital, not as a claim about what the universe is made of but rather about the way it unfolds. Central to the argument will be the concepts of symmetry breaking and algorithmic probability,…
Current discrete randomness and information conservation inequalities are over total recursive functions, i.e. restricted to deterministic processing. This restriction implies that an algorithm can break algorithmic randomness conservation…
A different general philosophy, to be called Full Randomness (FR), for the analysis of random effects models is presented, involving a notion of reducing or preferably eliminating fixed effects, at least formally. For example, under FR…
Getting an unbiased result is a remarkably long standing problem of collective observation/measurement. It is pointed out that quantum coin tossing can generate unbiased result defeating dishonesty.
This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…
Tossing a coin is the most elementary Monte Carlo experiment. In a computer the coin is replaced by a pseudo random number generator. It can be shown analytically and by exact enumerations that popular random number generators are not…
Randomness in the sense of Martin-L\"of can be defined in terms of lower semicomputable supermartingales. We show that such a supermartingale cannot be replaced by a pair of supermartingales that bet only on the even bits (the first one)…
A rigorous general definition of quantum probability is given, which is valid for elementary events and for composite events, for operationally testable measurements as well as for inconclusive measurements, and also for non-commuting…
This article is a brief personal account of the past, present, and future of algorithmic randomness, emphasizing its role in inductive inference and artificial intelligence. It is written for a general audience interested in science and…
We derive generalization bounds for learning algorithms based on their robustness: the property that if a testing sample is "similar" to a training sample, then the testing error is close to the training error. This provides a novel…
A real is called integer-valued random if no integer-valued martingale can win arbitrarily much capital betting against it. A real is low for integer-valued randomness if no integer-valued martingale recursive in A can succeed on an…
We apply a common measure of randomness, the entropy, in the context of iterated functions on a finite set with n elements. For a permutation, it turns out that this entropy is asymptotically (for a growing number of iterations) close to…
We discuss the role of ergodicity and chaos for the validity of statistical laws. In particular we explore the basic aspects of chaotic systems (with emphasis on the finite-resolution) on systems composed of a huge number of particles.
We discuss counterintuitive aspects of probabilities for systems of identical particles obeying quantum statistics. Quantum coins and children (two level systems) and quantum dice (many level systems) are used as examples. It is emphasized…
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and…
A large deviation function mathematically characterizes the statistical property of atypical events. Recently, in non-equilibrium statistical mechanics, large deviation functions have been used to describe universal laws such as the…
Ferrie and Combes [PRL 113 120404 (2014)] produce a classical measurement scheme that supposedly exhibits `anomalous' weak values. I show that their model is flawed due to an incorrect definition of the weak value. As a consequence their…