5 ms·
No it isn't. Randomness, complexity, computability and understandability are related but distinct concepts. Some problems are simple and random, some others ar
by lotsofmangos 12y ago
No it isn't. Randomness, complexity, computability and understandability are related but distinct concepts.
Some problems are simple and random, some others are complex and deterministic and you also even get some problems that are are simple to state, deterministic, provably uncomputable, yet still understandable, such as the Wang tiling problem.
- givan 12y agoWhat problems are simple and random? can you give some examples to prove your argument?
- lotsofmangos 12y agoEmit a single photon at a piece of glass angled at 45 degrees with two detectors, one behind the glass, the other at 90 degrees to the emitter. Which detector is the photon going to trigger?
- givan 12y agoQuantum mechanics is not simple http://en.wikipedia.org/wiki/Uncertainty_principle http://en.wikipedia.org/wiki/Uncertainty_principle too complex to compute.
- lotsofmangos 12y agoThe example I gave is not too complex too compute, it is just that computing it gives you a probability function as the result.