Related papers: Are prime numbers and quadratic residues random?
In the study of random access machines (RAMs) it has been shown that the availability of an extra input integer, having no special properties other than being sufficiently large, is enough to reduce the computational complexity of some…
The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…
We consider the dynamical behavior of Martin-L\"of random points in dynamical systems over metric spaces with a computable dynamics and a computable invariant measure. We use computable partitions to define a sort of effective symbolic…
Topological data analysis (TDA) is an emergent field of data analysis. The critical step of TDA is computing the persistent Betti numbers. Existing classical algorithms for TDA are limited if we want to learn from high-dimensional…
An integer $a$ is a quadratic nonresidue for a prime $p$ if $x^2 \equiv a \bmod p$ has no solution. Quadratic nonresidues may be found by probabilistic methods in polynomial time. However, without assuming the Generalized Riemann…
In this paper we introduce a new model of random simplicial complexes depending on multiple probability parameters. This model includes the well-known Linial - Meshulam random simplicial complexes and random clique complexes as special…
Imagine a sequence in which the first letter comes from a binary alphabet, the second letter can be chosen on an alphabet with 10 elements, the third letter can be chosen on an alphabet with 3 elements and so on. When such a sequence can be…
Linear Dynamical Systems, both discrete and continuous, are invaluable mathematical models in a plethora of applications such the verification of probabilistic systems, model checking, computational biology, cyber-physical systems, and…
We present experimental results on the effects of using quantum or 'truly' random numbers, as opposed to pseudorandom numbers, in a system that exhibits computational creativity (given its ability to compose original chess problems). The…
Recent developments in the mathematical foundations of quantum mechanics have brought the theory closer to that of classical probability and statistics. On the other hand, the unique character of quantum physics sets many of the questions…
We argue that the complex numbers are an irreducible object of quantum probability. This can be seen in the measurements of geometric phases that have no classical probabilistic analogue. Having complex phases as primitive ingredient…
We deal here with the issue of determinism versus randomness in time series. One wishes to identify their relative importance in a given time series. To this end we extend i) the use of ordinal patterns-based probability distribution…
Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts…
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…
The rounding of first order phase transitions by quenched randomness is stated in a form which is applicable to both classical and quantum systems: The free energy, as well as the ground state energy, of a spin system on a $d$-dimensional…
Relative entropy is a fundamental class of distances between probability distributions, with widespread applications in probability theory, statistics, and machine learning. In this work, we study relative entropy from a categorical…
We survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes…
The usual conjectures of quantum measurements approaches, inspired from the traditional interpretation of Heisenberg's ("uncertainty") relations, are proved as being incorrect. A group of reconsidered conjectures and a corresponding new…
We investigate the race between prime numbers in many residue classes modulo $q$, assuming the standard conjectures GRH and LI. Among our results we exhibit, for the first time, prime races modulo $q$ with $n$ competitor classes where the…