Parrondo’s paradox occurs in sequences of games in which a winning expectation may be obtained by playing the games in a random order, even though each game in the sequence may be lost when played individually. Several variations of Parrondo’s games with paradoxical property have been introduced. In this paper, I examine whether Parrondo’s paradox occurs or not in scale free networks. Two model...

The asymptotic behavior of Einstein-Rosen waves at null infinity in 4 dimensions is investigated in all directions by exploiting the relation between the 4-dimensional space-time and the 3-dimensional symmetry reduction thereof. Somewhat surprisingly, the behavior in a generic direction is better than that in directions orthogonal to the symmetry axis. The geometric origin of this difference ca...

Experiments have reported the entanglement of two spatially separated macroscopic atomic ensembles at room temperature (Krauter et al 2011 Phys. Rev. Lett. 107 080503; Julsgaard et al 2001 Nature 413 400). We show how an Einstein–Podolsky–Rosen (EPR) paradox is realizable with this experiment. Our proposed test involves violation of an inferred Heisenberg uncertainty principle, which is a suffi...

The Knowability Paradox is a logical argument which states that if all truths are knowable, then all truths are actually known. In 1963 Frederich Fitch published ‘A Logical Analysis of Some Value Concepts’[3]. This brief article appeared on the Journal of Symbolic Logic and it immediately became a classic of philosophical logic. It is in this paper that Fitch presented the Knowability Paradox, ...

The EU has set the policy target of reducing energy use by 20% by the year 2020. Therefore, a substantial consumption decrease is needed in built environment sector. Despite the great energy efficiency improvements in households, recent energy consumption data analyses show that these targets will unlikely be reached. The general aim of this study is to point out the need to define new indicato...

We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion probability is low or when it is highly imprecise. We show how the proposed measure provides a new model of the Ellsberg paradox. Moreover, we further substanti...

We show that all proposed quantum bit commitment schemes are insecure because the sender can always cheat successfully by using an EPR-type of attack and delaying her measurement until she opens her commitment.

There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown that if the uncertainty perception and the question of when an agent reports that two things are indistinguishable are both carefully modeled, the problems dis...

This paper describes interpolation procedures for EPR. In principle, interpolation for EPR is simple: It is a special case of first-order interpolation. In practice, we would like procedures that take advantage of properties of EPR: EPR admits finite models and those models are sometimes possible to describe very compactly. Inspired by procedures for propositional logic that use models and core...