I think you need to remember that if the Quantum::Superposition modules were run on a true quantum computer, in which a 'bit' can hold multiple state information truely simulatenously, then the any() and all() functions operate at O(1) time (instead of O(n) time for a typical '1 bit == 1 state' PC), and all other variations on that based on any() or all() reflect this. The prime number calculator, for example, is an O(n) operation on any PC today; but if a quantum computer which can return all() in O(1) time existed, this is a O(1) method.

Sure, we don't have a true quantum computer yet, but I think the interesting thing with Q::S and the other such classes is that it makes some problems much more interesting to think about, possibly offering insight into how to approach a problem. The running time of the solution may not be as efficient as it might seem, and actually may be worse than the normal, '1 value per bit' PC, but if/when we have a quantum computer, that new solution could become invaluable.

---

Dr. Michael K. Neylon - mneylon-pm@masemware.com || "You've left the lens cap of your mind on again, Pinky" - The Brain