Related papers: Are prime numbers and quadratic residues random?
We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (``universal probability'') as a starting point, and define complexity (an operator) as its negative logarithm. A number of…
Quantum trajectories are Markov chains modeling quantum systems subjected to repeated indirect measurements. Their stationary regime depends on what observables are measured on the probes used to indirectly measure the system. In this…
We study the quadratic residue problem known as an NP complete problem by way of the prime number and show that a nondeterministic polynomial process does not belong to the class P because of a random distribution of solutions for the…
We overview a series of recent works addressing numerical simulations of partial differential equations in the presence of some elements of randomness. The specific equations manipulated are linear elliptic, and arise in the context of…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
High entropy alloys add a new dimension, atomic-scale randomness and the associated scale-dependent composition fluctuations, to the traditional metallurgical axes of time-temperature-composition-microstructure. Alloy performance is…
V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…
In this expository article, we describe the recent approach, motivated by ergodic theory, towards detecting arithmetic patterns in the primes, and in particular establishing that the primes contain arbitrarily long arithmetic progressions.…
We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…
In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…
As an alternative to the well-known methods of "chaining" and "bracketing" that have been developed in the study of random fields, a new method, which is based on a {\em stochastic maximal inequality} derived by using the formula for…
We consider the linear and quadratic higher order terms associated to the response of the statistical properties of a dynamical system to suitable small perturbations. These terms are related to the first and second derivative of the…
A new number system, the set of the non-Dedekindian numbers, is introduced and characterized axiomatically. It is then proved that any hypercontinous hyperreal number system is strictly included in the set of the Non-Dedekindian Numbers.…
In this paper we initiate a somewhat detailed investigation of the relationships between quantitative recurrence indicators and algorithmic complexity of orbits in weakly chaotic dynamical systems. We mainly focus on examples.
Non-compact symmetries cannot be fully broken by randomness since non-compact groups have no invariant probability distributions. In particular, this makes trickier the "Copernican" random choice of the place of the observer in infinite…
The aim of this thesis is to determine classes of NP relations for which random generation and approximate counting problems admit an efficient solution. Since efficient rank implies efficient random generation, we first investigate some…
The article attempts to demonstrate the rich history of one truly remarkable problem situated at the confluence of probability theory and theory of numbers - finding the probability of co-primality of two randomly selected natural numbers.…
Information theory on a time-discrete setting in the framework of time series analysis is generalized to the time-continuous case. Considerations of the Roessler and Lorenz dynamics as well as the Ornstein-Uhlenbeck process yield for…
Loosely speaking, the Shannon entropy rate is used to gauge a stochastic process' intrinsic randomness; the statistical complexity gives the cost of predicting the process. We calculate, for the first time, the entropy rate and statistical…
We give an algorithm to determine all the repeated concatenations, in a given base, of a natural number in a residue class. The author recently describes a particular sequence of $v$-palindromes that inspires this investigation. We also…