>>5281405 (lb)
Definitely interesting. On the surface it seems like non-deterministic finite automata are hyper graphs, and if there was a way to "execute" them non-deterministically (for real) rather than partially converting it to a deterministic finite automata (up to 2^n more states potentially - rusty), then you'd get a tremendous bump in any graph based algos. AFAIK, that won't get you past the fundamental limits of computation (e.g., NP complete), but idk maybe they discovered how to do it. Perhaps this might be where the quantum computer may come in - since it is my understanding that non-determinism is at its core (though still not black magic). Gonna dig more on it, just scratched the surface.