We investigate the effect of randomness in both relationships and decisions on the evolution of cooperation. Simulation results show, in such randomness' presence, the system evolves more frequently to a cooperative state than in its absence. Specifically, there is an optimal amount of randomness, which can induce the highest level of cooperation. The mechanism of randomness promoting cooperati...

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 inequalities. We address this issue by proving tight bounds of randomness and information conservation with respect to recursively enumerable transformations...

We establish tight bounds on the amount on nonuniformity that is necessary for extracting a string with randomness rate 1 from a single source of randomness with lower randomness rate. More precisely, as instantiations of more general results, we show that while O(1) amount of advice regarding the source is not enough for extracting a string with randomness rate 1 from a source string with cons...

We discuss some aspects of algorithmic randomness and state some open problems in this area. The rst part is devoted to the question \What is a computably random sequence?" Here we survey some of the approaches to algorithmic randomness and address some questions on these concepts. In the second part we look at the Turing degrees of Martin-LL of random sets. Finally, in the third part we deal w...

We study Doob’s martingale convergence theorem for computable continuous time martingales on Brownian motion, in the context of algorithmic randomness. A characterization of the class of sample points for which the theorem holds is given. Such points are given the name of Doob random points. It is shown that a point is Doob random if its tail is computably random in a certain sense. Moreover, D...

Establishing secret common randomness between two or multiple devices in a network resides at the root of communication security. The problem is traditionally decomposed into a randomness generation stage (randomness purity is subject to employing often costly true random number generators) and a key-agreement information exchange stage, which can rely on public-key infrastructure or on key wra...

The non-local correlations obtained by performing measurements on entangled quantum states certify the presence of randomness in the outputs. However, there exist non-local correlations that are (i) supra-quantum, in the sense that give an amount of non-locality higher than in quantum theory, but yet (ii) non-signalling, as they do not allow any form of communication. In the talk, we first comp...

We study the problem of folding of the regular triangular lattice in the presence of a quenched random bending rigidity ±K and a magnetic field h (conjugate to the local normal vectors to the triangles). The randomness in the bending energy can be understood as arising from a prior marking of the lattice with quenched creases on which folds are favored. We consider three types of quenched rando...

We introduce the zeta number, natural halting probability and natural complexity of a Turing machine and we relate them to Chaitin’s Omega number, halting probability, and program-size complexity. A classification of Turing machines according to their zeta numbers is proposed: divergent, convergent and tuatara. We prove the existence of universal convergent and tuatara machines. Various results...

We initiate the formal study on authenticated key exchange (AKE) under bad randomness. This could happen when (1) an adversary compromises the randomness source and hence directly controls the randomness of each AKE session; and (2) the randomness repeats in different AKE sessions due to reset attacks.We construct two formal security models, Reset-1 and Reset-2, to capture these two bad randomn...