> > Do any() and all() have some magic around how they are
> > implemented in von Neumann computers that make them faster than
> > standard CS searching techniques?
>
> I'm probably naive here but shortcuts in a non-parallelized (classical)
> implementation rely on the usual shortcircuiting: the first true allows
> any to return, the first false can terminate all. How can you do better?
You can't, in serial implementation. But on a parallel architecture
or, better still, on a quantum device, you can run all the computations
in parallel.
Damian
