This review is about the convenience, the benefits, as well as the destructive capacities of money. It deals with various aspects of money creation, with its value, and its appropriation. All sorts of money tend to get corrupted by eventually creatin
g too much of them. In the long run, this renders money worthless and deprives people holding it. This misuse of money creation is inevitable and should come as no surprise. Abusive money creation comes in various forms. In the present fiat money system suspended in free thought and sustained merely by our belief in and our conditioning to it, money is conveniently created out of thin air by excessive government spending and speculative credit creation. Alas, any too tight money supply could ruin an economy by inviting all sorts of unfriendly takeovers, including wars or competition. Therefore the ambivalence of money as benefactor and destroyer should be accepted as destiny.
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e. it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an asymptotic proper
ty --- of quantum randomness by performing finite tests of randomness inspired by algorithmic information theory.
Our aim is to experimentally study the possibility of distinguishing between quantum sources of randomness--recently proved to be theoretically incomputable--and some well-known computable sources of pseudo-randomness. Incomputability is a necessary,
but not sufficient symptom of true randomness. We base our experimental approach on algorithmic information theory which provides characterizations of algorithmic random sequences in terms of the degrees of incompressibility of their finite prefixes. Algorithmic random sequences are incomputable, but the converse implication is false. We have performed tests of randomness on pseudo-random strings (finite sequences) of length $2^{32}$ generated with software (Mathematica, Maple), which are cyclic (so, strongly computable), the bits of $pi$, which is computable, but not cyclic, and strings produced by quantum measurements (with the commercial device Quantis and by the Vienna IQOQI group). Our empirical tests indicate quantitative differences, some statistically significant, between computable and incomputable sources of randomness.
